Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Boroujerdi, A., C. Dong, Q. Ma, and B. Moret. (1993). “Joint Routing in Networks,” Undated Technical Report, Department of Computer Science, University of New Mexico, Albuquerque, NM.

    Google Scholar 

  • Dijkstra, E. (1959). “A Note on Two Problems in Connection with Graphs.” Numerische Mathematik 1, 269–271.

    Google Scholar 

  • Galicki, M. (1992).“Optimal Planning of a Collision-Free Trajectory of Redundant Manipulators.” The International Journal of Robotics Research 11(6), 549–559.

    Google Scholar 

  • Ghosh, S. and D. Mount. (1987). “An Output Sensitive Algorithm for Computing Visibility Graphs.” In Proc. of the 28th Ann. Symp. on Foundations of Computer Science. Los Angeles, California: 12–14 October 1987, IEEE, pp. 11–19.

  • Guo, Z.Y. and T.C. Hsia. (1993). “Joint Trajectory Generation for Redundant Robots in an Environment with Obstacles.” Journal of Robotic Systems 10(2), 199–215.

    Google Scholar 

  • Helgason, R., J. Kennington, and K. Lewis. (1996).“Finding Safe Paths in Networks,” Technical Report 96-CSE-7, Department of Computer Science and Engineering, SMU, Dallas, TX 75275–0122.

    Google Scholar 

  • Helgason, R., J. Kennington, and K. Lewis. (1997a).“Cruise Missile Mission Planning with a Probability Side Constraint,” Technical Report 97-CSE-3, Department of Computer Science and Engineering, SMU, Dallas, TX 75275-0122.

    Google Scholar 

  • Helgason, R., J. Kennington, and K. Lewis. (1997b).“Cruise Missile Strike Planning: Automatic Multiple Path Generation,” Technical Report 97-CSE-24, Department of Computer Science and Engineering, SMU, Dallas, TX 75275-0122.

    Google Scholar 

  • Helgason, R., J. Kennington, and B. Stewart. (1993). “The One-to-One Shortest-Path Problem: An Empirical Analysis with the Two-Tree Dijkstra Algorithm,” Computational Optimization and Applications 1, 47–75.

    Google Scholar 

  • Jiang, K., L.D. Seneviratne, and S.W.E. Earles. (1996). “Three-Dimensional Shortest Path Planning in the Presence of Polyhedral Obstacles.” Proceedings of the Institute of Mechanical Engineers: Journal of Mechanical Engineeing Science, Part C, 210, 373–381.

    Google Scholar 

  • Jones, C.V. (1994).“Visualization and Optimization.” ORSA Journal on Computing 6(3), 221–257.

    Google Scholar 

  • Jun, S. and K.G. Shin. (1991). “Shortest Path Planning in Discretized Workspaces Using Dominance Relation.” IEEE Transactions on Robotics and Automation 7(3), 342–350.

    Google Scholar 

  • Lee, J.K. and S.M. Song. (1991). “Path Planning and Gait ofWalking Machine in an Obstacle-StrewnEnvironment.” Journal of Robotic Systems 8(6), 801–827.

    Google Scholar 

  • Liu, Y.H. and S. Arimoto. (1992). “Path Planning Using a Tangent Graph for Mobile Robots Among Polygonal and Curved Obstacles.” The International Journal of Robotics Research 11(4), 376–382.

    Google Scholar 

  • Liu, Y.H. and S. Arimoto. (1994). “Computation of the Tangent Graph of Polygonal Obstacles by Moving-Line Processing.” IEEE Transactions on Robotics and Automation 10(6), 823–830.

    Google Scholar 

  • Liu, Y.H. and S. Arimoto. (1995). “Finding the Shortest Path of a Disk Among Polygonal Obstacles Using a Radius-Independent Graph.” IEEE Transactions on Robotics and Automation 11(5), 682–691.

    Google Scholar 

  • Lu, E., J. Ni, and S.M. Wu. (1994).“An Algorithm for the Generation of an Optimum CMM Inspection Path.” Transactions of the ASME: Journal of Dynamic Systems, Measurement, and Control 116, 396–401.

    Google Scholar 

  • O'Rourke, J. (1994). Computational Geometry in C. Cambridge: Cambridge University Press.

    Google Scholar 

  • Seidel, R. (1997). “Convex Hull Computations.” In J. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton, NY: CRC Press, ch. 19, pp. 361–375.

    Google Scholar 

  • Singh, S.K. and M.C. Leu. (1991) “Manipulator Motion Planning in the Presence of Obstacles and Dynamic Constraints.” The International Journal of Robotics Research 10(2), 171–187.

    Google Scholar 

  • Solka, J., J. Perry, B. Poellinger, and G. Rogers. (1995a). “Fast Computation of Optimal Paths Using a Parallel Dijkstra Algorithm with Embedded Constraints.” Neurocomputing 8, 195–212.

    Google Scholar 

  • Solka, J., J. Perry, B. Poellinger, and G. Rogers. (1995b). “Autorouting Using a Parallel Dijkstra Algorithm with Embedded Constraints,” Technical Report, The Naval Surface Warfare Center, Dahlgren, VA.

    Google Scholar 

  • Spangelo, I. and O. Egeland. (1994). “Trajectory Planning and CollisionAvoidance for UnderwaterVehicles Using Optimal Control.” IEEE Journal of Oceanic Engineering 19(4), 502–511.

    Google Scholar 

  • Sundar, S. and Z. Shiller. (1997). “Optimal ObstacleAvoidance Based on the Hamilton-Jacobi-Bellman Equation.” IEEE Transactions on Robotics and Automation 13(2), 305–310.

    Google Scholar 

  • Trogneux, F., M. Doquet, and P. Mallet. (1996). “Taking Environmental Constraints into Account in the Planning of the Extra High Voltage Transmission Network; EDF's Approach.” IEEE Transactions on Power Delivery 11(4), 1901–1906.

    Google Scholar 

  • Tseng, C.S. and T.S. Lue. (1995). “Path Planning for Robot Manipulators in Polyhedral Objects Environment.” Journal of Robotic Systems 12(10), 637–646.

    Google Scholar 

  • Wang, D. and Y. Hamam. (1992). “Optimal Trajectory Planning of Manipulators with Collision Detection and Avoidance.” The International Journal of Robotics Research 11(5), 460–468.

    Google Scholar 

  • Welch, B. (1995). Practical Programming in Tcl and Tk. Upper Saddle River, NJ: Prentice-Hall Inc.

    Google Scholar 

  • Welzl, E. (1985). “Constructing the Visibility Graph for n Line Segments in O(n2) Time.” IPL 20, 167–171.

    Google Scholar 

  • Wu, T.H. and K.Y. Young. (1994). “Path Planning in the Presence of Obstacles Based on Task Requirements.” Journal of Robotic Systems 11(8), 703–716.

    Google Scholar 

  • Zheng, S.Q., J.S. Lim, and S.S. Iyengar. (1996). “Finding Obstacle-Avoiding Shortest Paths Using Implicit Connection Graphs.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15(1), 103–110.

    Google Scholar 

  • Zhu, Q. (1991). “Hidden Markov Model for Dynamic Obstacle Avoidance of Mobile Robot Navigation.” IEEE Transactions on Robotics and Automation 7(3), 390–397.

    Google Scholar 

  • Zuniga, M. and P. Gorman. (1995). “Threat Site Overflight Modeling for Strike Route Optimization,” Undated Technical Report, Naval Research Laboratory, Washington, D.C.

    Google Scholar 

  • Zuniga, M., J. Uhlmann, and J. Hofmann. (1995). “The Interdependent Joint Routing Problem: Description and Algorithmic Approach,” Technical Report, Naval Research Laboratory, Washington, D.C.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX, 75275-0122, USA

    R.V. Helgason

  2. Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX, 75275-0122, USA

    J.L. Kennington

  3. Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX, 75275-0122, USA

    K.R. Lewis

Authors
  1. R.V. Helgason
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J.L. Kennington
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K.R. Lewis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Helgason, R., Kennington, J. & Lewis, K. Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation. Journal of Heuristics 7, 473–494 (2001). https://doi.org/10.1023/A:1011325912346

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011325912346

Search

Navigation