Tactical route planning: new algorithms for decomposing the map

摘要

The paper defines a new approach and investigates a fundamental problem in route planners. This capability is important for robotic vehicles (Martian Rovers, etc.) and for planning off road military manoeuvres. The emphasis throughout the paper is on the design and analysis and hierarchical implementation of our route planner. The work was motivated by anticipation of the need to search a grid of a trillion points for optimum routes. This cannot be done simply by scaling upward from the algorithms used to search a grid of 10,000 points. Algorithms sufficient for the small grid are totally inadequate for the large grid. Soon, the challenge will be to compute off road routes more then 100 km long and with a one or two meter grid. Previous efforts are reviewed and the data structures, decomposition methods and search algorithms are analyzed and limitations are discussed. A detailed discussion of a hierarchical implementation is provided and the experimental results are analyzed. The principal contributions of the paper are: new algorithms for decomposing the map and new search methods; analysis of new approaches; and the use of expert systems, deductive databases and mediators. Experimental results are included of a detailed implementation.