Snake-based path planning for redundant manipulators

An energy-minimizing contour, or snake, is composed of a set of connected splines and has equations of motion such that it will try to reach a configuration at which it is at a minimum energy. A potential field representation of the workspace is used as an environment into which the snake, representing a manipulator, is placed. The snake is then guided by these image forces and can thus be used to plan paths for highly redundant manipulators in two or three dimensions. The method is fast, and directly suitable for parallel processing, and has the potential to provide real-time path planning for such robots. Results are given which show the paths found both in two and three dimensions for redundant manipulators.<<ETX>>

[1]  Gregory S. Chirikjian,et al.  An obstacle avoidance algorithm for hyper-redundant manipulators , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[2]  Stephen Cameron,et al.  Motion planning for non-holonomic industrial robot vehicles , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[3]  T. Hague,et al.  Motion Planning for the Oxford AGV , 1990, Proceedings of the IEEE International Workshop on Intelligent Motion Control.

[4]  Terry E. Weymouth,et al.  Using Dynamic Programming For Minimizing The Energy Of Active Contours In The Presence Of Hard Constraints , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[5]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[6]  Stephen Cameron,et al.  Experiments with a rule-based robot palletiser , 1992 .

[7]  Andrew P. Witkin,et al.  Spacetime constraints , 1988, SIGGRAPH.

[8]  Andrew Blake,et al.  Real-time Visual Tracking for Surveillance and Path Planning , 1992, ECCV.

[9]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[10]  Narendra Ahuja,et al.  Path planning using a potential field representation , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[11]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[12]  Andrew Blake,et al.  Parallel Implementation of Lagrangian Dynamics for real-time snakes , 1991 .

[13]  E. M. Lifshitz,et al.  Mechanics and Electrodynamics , 1972 .

[14]  Daniel E. Koditschek,et al.  Exact robot navigation by means of potential functions: Some topological considerations , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[15]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[16]  Vladimir J. Lumelsky,et al.  Continuous motion planning in unknown environment for a 3D cartesian robot arm , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.