Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation

This manuscript presents a heuristic algorithm based on geometric concepts for the problem of finding a path composed of line segments from a given origin to a given destination in the presence of polygonal obstacles. The basic idea involves constructing circumscribing triangles around the obstacles to be avoided. Our heuristic algorithm considers paths composed primarily of line segments corresponding to partial edges of these circumscribing triangles, and uses a simple branch-and-bound procedure to find a relatively short path of this type. This work was motivated by the military planning problem of developing mission plans for cruise missiles, but is applicable to any two-dimensional path-planning problem involving obstacles.

[1]  Qiuming Zhu,et al.  Hidden Markov model for dynamic obstacle avoidance of mobile robot navigation , 1991, IEEE Trans. Robotics Autom..

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3]  S. Sitharama Iyengar,et al.  Finding obstacle-avoiding shortest paths using implicit connection graphs , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Suguru Arimoto,et al.  Computation of the tangent graph of polygonal obstacles by moving-line processing , 1994, IEEE Trans. Robotics Autom..

[5]  S W E Earles,et al.  Three-Dimensional Shortest Path Planning in the Presence of Polyhedral Obstacles , 1996 .

[6]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[7]  Ching-Shiow Tseng,et al.  Path planning for robobt manipulators in polyhhedral objects environment , 1995, J. Field Robotics.

[8]  Brent B Welch,et al.  Practical Programming in Tcl and Tk , 1999 .

[9]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[10]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[11]  Tien C. Hsia,et al.  Joint trajectory generation for redundant robots in an environment with obstacles , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[12]  M. Galicki,et al.  Optimal Planning of a Collision-free Trajectory of Redundant Manipulators , 1992 .

[13]  Kuu-Young Young,et al.  Path planning in the presence of obstacles based on task requirements , 1994, J. Field Robotics.

[14]  Zvi Shiller,et al.  Optimal obstacle avoidance based on the Hamilton-Jacobi-Bellman equation , 1994, IEEE Trans. Robotics Autom..

[15]  Jun Ni,et al.  An Algorithm for the Generation of an Optimum CMM Inspection Path , 1994 .

[16]  Christopher Vyn Jones,et al.  Visualization and Optimization , 1997 .

[17]  Kang G. Shin,et al.  Shortest path planning in discretized workspaces using dominance relation , 1991, IEEE Trans. Robotics Autom..

[18]  Ali Boroujerdi,et al.  Joint Routing in Networks , 1993 .

[19]  Jeffery L. Kennington,et al.  The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm , 1993, Comput. Optim. Appl..

[20]  David M. Mount,et al.  An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.

[21]  Ming-Chuan Leu,et al.  Manipulator Motion Planning in the Presence of Obstacles and Dynamic Constraints , 1991, Int. J. Robotics Res..

[22]  O. Egeland,et al.  Trajectory planning and collision avoidance for underwater vehicles using optimal control , 1994 .

[23]  Yunhui Liu,et al.  Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph , 1995, IEEE Trans. Robotics Autom..

[24]  Y. Hamam,et al.  Optimal Trajectory Planning of Manipulators With Collision Detection and Avoidance , 1992 .

[25]  Shin-Min Song,et al.  Path planning and gait of walking machine in an obstacle-strewn environment , 1991, J. Field Robotics.

[26]  S. Arimoto,et al.  Path Planning Using a Tangent Graph for Mobile Robots Among Polygonal and Curved Obstacles , 1992 .

[27]  George W. Rogers,et al.  Autorouting using a parallel Dijkstra algorithm with embedded constraints , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.

[28]  M. Doquet,et al.  Taking Environmental Constraints into Account in the Planning of the Extra High Voltage Transmission Network: EDF's Approach , 1996, IEEE Power Engineering Review.

[29]  George W. Rogers,et al.  Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints , 1995, Neurocomputing.