Algorithmica

, Volume 10, Issue 2–4, pp 102–120 | Cite as

An opportunistic global path planner

  • John F. Canny
  • Ming C. Lin
Path-Planning

Abstract

In this paper we describe a robot path-planning algorithm that constructs a global skeleton of free-space by incremental local methods. The curves of the skeleton are the loci of maxima of an artificial potential field that is directly proportional to distance of the robot from obstacles. Our method has the advantage of fast convergence of local methods in uncluttered environments, but it also has a deterministic and efficient method of escaping local extremal points of the potential function. We first describe a general roadmap algorithm, for configuration spaces of any dimension, and then describe specific applications of the algorithm for robots with two and three degrees of freedom.

Key words

Obstacle avoidance Global path planner Roadmap algorithm Robot motion planning Artificial potential field 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots.IJRR,5(1): 90–98, 1986.MathSciNetGoogle Scholar
  2. [2]
    J. F. Canny.The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA, 1988.Google Scholar
  3. [3]
    T. Lozano-Pérez and M. Wesley. An algorithm for planning collision-free paths among polyhedral obstacles.Comm. ACM,22(10): 560–570, 1979.CrossRefGoogle Scholar
  4. [4]
    J. Reif.Complexity of the Mover's Problem and Generalizations, Chap. 11, pp. 267–281. Ablex Publishing, Norwood, NJ, 1987.Google Scholar
  5. [5]
    J. T. Schwartz and M. Sharir.On the ‘Piano Movers’ Problem, II. General Techniques for Computing Topological Properties of Real Algebraic Manifolds, Chap. 5, pp. 154–186. Ablex Publishing, Norwood, NJ, 1987.Google Scholar
  6. [6]
    B. Langlois, J. Barraquand, and J.-C. Latombe. Robot motion planning with many degrees of freedom and dynamic constraints. InProceedings 5th ISRR, Tokyo, Japan, 1989, pp. 74–83.Google Scholar
  7. [7]
    J. Canny. Computing roadmaps of general semi-algebraic sets. InAAECC-91, pp. 94–107,1991.Google Scholar
  8. [8]
    J. F. Canny. Generalized characteristic polynomials.J. Symbolic Computation,9(3), 1990.Google Scholar
  9. [9]
    D. Manocha and J. F. Canny. Efficient techniques for multipolynomial resultant algorithms.Proceedings of ISSAC '91, Bonn, Germany, 1991.Google Scholar
  10. [10]
    J. F. Canny and A. Rege. An efficient algorithm for computing perturbed polynomial systems. University of California, Berkeley, 1992. In preparation.Google Scholar
  11. [11]
    M. C. Lin and J. F. Canny. A fast algorithm for incremental distance calculation.IEEE ICRA '91 Proceedings,2: 1008–1014, 1991.Google Scholar
  12. [12]
    C. G. Gibson, K. Wirthmuller, A. A. du Plessis, E. J. N. Looijenga.Topological Stability of Smooth Mappings. Springer-Verlag, Berlin, 1976.MATHCrossRefGoogle Scholar
  13. [13]
    J. F. Canny. Constructing roadmaps of semi-algebraic sets, I: Completeness.Artificial Intelligence,37: 203–222, 1988.MATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    J. Milnor. On the Betti numbers of real varieties.Proc. Amer. Math. Soc.,15: 275–280, 1964.MATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    R. Thom. Sur l'homologie des varietes algebriques reelles.Differential and Combinatorial Topology, pp. 255–265, 1965.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1993

Authors and Affiliations

  • John F. Canny
    • 1
  • Ming C. Lin
    • 2
  1. 1.Department of Computer ScienceUniversity of CaliforniaBerkeleyUSA
  2. 2.Department of Electrical Engineering and Computer ScienceUniversity of CaliforniaBerkeleyUSA

Personalised recommendations