Algorithmica

, Volume 10, Issue 2–4, pp 102–120

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.

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