Investigation of Planning, Multi-Agent Planning and Task Hierarchial Networks designs

Looking at the above and their application to this project.

http://en.wikipedia.org/wiki/Multi-agent_planning

http://en.wikipedia.org/wiki/Plan

http://en.wikipedia.org/wiki/Hierarchical_task_network

http://abotea.rsise.anu.edu.au/data/offline-htn-planning.pdf

http://www.cs.pitt.edu/~milos/courses/cs2740/HW-SOLS/hw-5-sol.pdf

The rough design of how the rocket jumping solution for routing to otherwise unreachable areas is as follows.

If the bot is given a goal to travel to a destination within its immediate vicinity, it will try and find a route to that destination through the clusters using the cluster portal. If a route can't be found and the destination is in range of a rocket jump, the bot will search for the solution in a graph of abilities and store then act out the optimal path that will achieve the goal.