Gross motion planning—a survey

Motion planning is one of the most important areas of robotics research. The complexity of the motion-planning problem has hindered the development of practical algorithms. This paper surveys the work on gross-motion planning, including motion planners for point robots, rigid robots, and manipulators in stationary, time-varying, constrained, and movable-object environments. The general issues in motion planning are explained. Recent approaches and their performances are briefly described, and possible future research directions are discussed.

[1]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[2]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

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

[4]  Michael Athans,et al.  Optimal Control , 1966 .

[5]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[6]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[7]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[8]  Patrick M. Thomas,et al.  Efficient Computation of , 1976 .

[9]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[10]  共立出版株式会社.  コンピュータ・サイエンス : ACM computing surveys , 1978 .

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[14]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[15]  Robert L. Scot Drysdale,et al.  Generalized Voronoi diagrams and geometric searching , 1979 .

[16]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[17]  D. T. Lee,et al.  Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[18]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[19]  Raja Chatila,et al.  Path Planning and Environment Learning in a Mobile Robot System , 1982, ECAI.

[20]  John E. Hopcroft,et al.  On the movement of robot arms in 2-dimensional bounded regions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[21]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[22]  Rodney A. Brooks,et al.  Solving the find-path problem by good representation of free space , 1982, IEEE Transactions on Systems, Man, and Cybernetics.

[23]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[24]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[25]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[26]  Charles E. Thorpe,et al.  Path Relaxation: Path Planning for a Mobile Robot , 1984, AAAI.

[27]  Micha Sharir,et al.  On shortest paths in polyhedral spaces , 1986, STOC '84.

[28]  David M. Keirsey,et al.  Planning Strategic Paths Through Variable Terrain Data , 1984, Other Conferences.

[29]  John E. Hopcroft,et al.  Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..

[30]  Yoichiro Maeda,et al.  Sensory Feedback Based on the Artificial Potential for Robot Manipulators , 1984 .

[31]  Kang G. Shin,et al.  Open-loop minimum-time control of mechanical manipulators and its application , 1984 .

[32]  B. Donald.  Motion Planning with Six Degrees of Freedom , 1984 .

[33]  Neville Hogan,et al.  Impedance Control: An Approach to Manipulation , 1984, 1984 American Control Conference.

[34]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[35]  Joseph O'Rourke,et al.  Shortest Paths on Polyhedral Surfaces , 1985, STACS.

[36]  D. Mount.  On Finding Shortest Paths on Convex Polyhedra. , 1985 .

[37]  Rodney A. Brooks,et al.  Natural decomposition of free space for path planning , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[38]  R. Chattergy,et al.  Some Heuristics for the Navigation of a Robot , 1985 .

[39]  Neville Hogan,et al.  Impedance Control: An Approach to Manipulation: Part III—Applications , 1985 .

[40]  Alex Meystel,et al.  Simulation of path planning for a system with vision and map updating , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[41]  J. Reif,et al.  Shortest Paths in Euclidean Space with Polyhedral Obstacles. , 1985 .

[42]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[43]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

[44]  Leonidas J. Guibas,et al.  Visibility-polygon search and euclidean shortest paths , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[45]  Francis Quek,et al.  A Decision System For Autonomous Robot Navigation Over Rough Terrain , 1985, Other Conferences.

[46]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[47]  L. Paul Chew,et al.  Planning the shortest path for a disc in O(n2log n) time , 1985, SCG '85.

[48]  Jean-Paul Laumond,et al.  Position referencing and consistent world modeling for mobile robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[49]  D. T. Lee,et al.  Rectilinear shortest paths with rectangular barriers , 1985, SCG '85.

[50]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[51]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[52]  J. Bobrow,et al.  Time-Optimal Control of Robotic Manipulators Along Specified Paths , 1985 .

[53]  Micha Sharir,et al.  An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles , 1985, SCG '85.

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

[55]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[56]  Steven Fortune,et al.  Coordinated motion of two robot arms , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[57]  Paul R. Cohen,et al.  Handbook of AI , 1986 .

[58]  S. Maddila.  Decomposition algorithm for moving a ladder among rectangular obstacles , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[59]  John E. Hopcroft,et al.  Reducing Multiple Object Motion Planning to Graph Searching , 1984, SIAM J. Comput..

[60]  Alex Meystel,et al.  Minimum-time navigation of an unmanned mobile robot in a 2-1/2D world with obstacles , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[61]  S. Suri.  A linear time algorithm with minimum link paths inside a simple polygon , 1986 .

[62]  Larry S. Davis,et al.  Multiresolution path planning for mobile robots , 1986, IEEE J. Robotics Autom..

[63]  Micha Sharir,et al.  On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..

[64]  Martin Herman,et al.  Fast, three-dimensional, collision-free motion planning , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[65]  Bernard Faverjon.  Object level programming of industrial robots , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[66]  Bruce H. Krogh,et al.  Integrated path planning and dynamic steering control for autonomous vehicles , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[67]  J. Davenport.  A "Piano Movers" Problem. , 1986 .

[68]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[69]  S. Sitharama Iyengar,et al.  Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case , 1987, IEEE Journal on Robotics and Automation.

[70]  Tomas Lozano-Perez.  A simple motion-planning algorithm for general robot manipulators , 1986, IEEE J. Robotics Autom..

[71]  W. Eric L. Grimson,et al.  Handey: A robot system that recognizes, plans, and manipulates , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[72]  Joseph S. B. Mitchell,et al.  The weighted region problem , 1987, SCG '87.

[73]  Wyatt S. Newman,et al.  High speed robot control and obstacle avoidance using dynamic potential functions , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[74]  Chee-Keng Yap,et al.  AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[75]  B. Faverjon,et al.  A local based approach for path planning of manipulators with a high number of degrees of freedom , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[76]  Micha Sharir,et al.  Efficient algorithms for planning purely translational collision-free motion in two and three dimensions , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[77]  Allen R. Tannenbaum,et al.  Robotic manipulators and the geometry of real semialgebraic sets , 1987, IEEE J. Robotics Autom..

[78]  James S. Thorp,et al.  Real Time Control of Robot Manipulators in the Presence of Obstacles , 1987 .

[79]  Alex Meystel,et al.  Navigation algorithm for a nested hierarchical system of robot path planning among polyhedral obstacles , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[80]  Meghanad D. Wagh,et al.  Robot path planning using intersecting convex shapes: Analysis and simulation , 1987, IEEE J. Robotics Autom..

[81]  Vladimir J. Lumelsky.  Effect of kinematics on motion planning for planar robot arms moving amidst unknown obstacles , 1987, IEEE J. Robotics Autom..

[82]  Michael Zyda,et al.  Solving global two-dimensional routing problems using snell's law and a search , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[83]  Yan Ke,et al.  Moving a ladder in three dimensions: upper and lower bounds , 1987, SCG '87.

[84]  Andrew K. C. Wong,et al.  Structuring Free Space as a Hypergraph for Roving Robot Path Planning and Navigation , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[85]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three space , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[86]  Kenneth L. Clarkson,et al.  Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time , 1987, SCG '87.

[87]  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.

[88]  Bruce Randall Donald,et al.  Simplified Voronoi diagrams , 1987, SCG '87.

[89]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[90]  Richard Cole,et al.  Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms , 1987, FOCS.

[91]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[92]  John F. Canny,et al.  A new algebraic method for robot motion planning and real geometry , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[93]  Nasser Kehtarnavaz,et al.  A collision-free navigation scheme in the presence of moving obstacles , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[94]  A.J. Koivo,et al.  On-line generation of collision-free trajectories for multiple robots , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[95]  M. Sharir,et al.  An automatic motion planning system for a convex polygonal mobile robot in 2-dimensional polygonal space , 1988, SCG '88.

[96]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[97]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[98]  황용구,et al.  Robot path planning using a potential field representation. , 1988 .

[99]  Joseph O'Rourke,et al.  Lower bounds on moving a ladder in two and three dimensions , 1988, Discret. Comput. Geom..

[100]  Gordon T. Wilfong.  Motion planning in the presence of movable obstacles , 1988, SCG '88.

[101]  Kang G. Shin,et al.  A probabilistic approach to collision-free robot path planning , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[102]  Daniel E. Koditschek,et al.  Exact robot navigation using cost functions: the case of distinct spherical boundaries in E/sup n/ , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[103]  Leonidas J. Guibas,et al.  On the general motion-planning problem with two degrees of freedom , 2015, SCG '88.

[104]  Bruce Randall Donald,et al.  On the complexity of kinodynamic planning , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[105]  Adel H. Eltimsahy,et al.  Near minimum-time control of robotic manipulator with obstacles in the workspace , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[106]  Steven Dubowsky,et al.  Global time optimal motions of robotic manipulators in the presence of obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[107]  Steven W. Zucker,et al.  Planning collision-free trajectories in time-varying environments: a two-level hierarchy , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[108]  Micha Sharir,et al.  Coordinated motion planning for two independent robots , 1991, SCG '88.

[109]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles , 1988, Geometry and Robotics.

[110]  Pradeep K. Khosla,et al.  Superquadric artificial potentials for obstacle avoidance and approach , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[111]  Vladimir J. Lumelsky,et al.  Motion planning for robot arm manipulators with proximity sensing , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[112]  Mathukumalli Vidyasagar,et al.  Optimal trajectory planning for planar n-link revolute manipulators in the presence of obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[113]  E. Freund,et al.  Real-Time Pathfinding in Multirobot Systems Including Obstacle Avoidance , 1988, Int. J. Robotics Res..

[114]  R. W. Harrigan,et al.  Telerobotic operation of conventional robot manipulators , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[115]  Hanan Samet,et al.  Path planning among moving obstacles using spatial indexing , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[116]  Gordon T. Wilfong,et al.  Planning constrained motion , 1988, STOC '88.

[117]  Gordon T. Wilfong.  Motion planning for an autonomous vehicle , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[118]  Joseph S. B. Mitchell,et al.  Path planning in 0/1/ weighted regions with applications , 1988, SCG '88.

[119]  James A. Storer,et al.  3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles , 1988, MFCS.

[120]  Wyatt S. Newman,et al.  Automatic obstacle avoidance at high speeds via reflex control , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[121]  Yunhui Liu,et al.  A practical algorithm for planning collision-free coordinated motion of multiple mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[122]  Tomás Lozano-Pérez,et al.  Deadlock-free and collision-free coordination of two robot manipulators , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[123]  Daniel E. Koditschek,et al.  The construction of analytic diffeomorphisms for exact robot navigation on star worlds , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[124]  Jörg-Rüdiger Sack,et al.  An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon , 1989, STACS.

[125]  Bernard Faverjon,et al.  Hierarchical object models for efficient anti-collision algorithms , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[126]  Bruce Randall Donald,et al.  A provably good approximation algorithm for optimal-time trajectory planning , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[127]  Brad E. Paden,et al.  Path planning using a Jacobian-based freespace generation algorithm , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[128]  Yan Ke,et al.  An efficient algorithm for link-distance problems , 1989, SCG '89.

[129]  Daniel E. Koditschek,et al.  Robot planning and control via potential functions , 1989 .

[130]  John F. Canny,et al.  Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[131]  Tomás Lozano-Pérez,et al.  Task-level planning of pick-and-place robot motions , 1989, Computer.

[132]  Mikhail J. Atallah,et al.  An optimal parallel algorithm for the visibility of a simple polygon from a point , 1991, JACM.

[133]  Hanan Samet,et al.  Time-minimal paths among moving obstacles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[134]  Stephen J. Buckley,et al.  Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[135]  Charles W. Warren,et al.  Global path planning using artificial potential fields , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[136]  Ruei-Chuan Chang,et al.  Finding All Shortest Path Edge Sequences on a Convex Polyhedron , 1989, WADS.

[137]  J. Michael McCarthy,et al.  Equations for boundaries of joint obstacles for planar robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[138]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[139]  Yong K. Hwang,et al.  Boundary equations of configuration obstacles for manipulators , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[140]  John F. Canny,et al.  An exact algorithm for kinodynamic planning in the plane , 1990, SCG '90.

[141]  Jean-Claude Latombe,et al.  Constraint reformulation in a hierarchical path planner , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[142]  Ming C. Lin,et al.  An opportunistic global path planner , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[143]  Joseph S. B. Mitchell,et al.  Minimum-link paths among obstacles in the plane , 1990, SCG '90.

[144]  D. Strip,et al.  Archimedes : An experiment in automating mechanical assembly , 1990 .

[145]  Bruce Randall Donald,et al.  Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.

[146]  D. T. Lee,et al.  Shortest rectilinear paths among weighted obstacles , 1990, SCG '90.

[147]  Wyatt S. Newman,et al.  Rapid computation of configuration space obstacles , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[148]  Sukhan Lee,et al.  Assembly planning based on subassembly extraction , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[149]  Avinash C. Kak,et al.  Spar: A Planner that Satisfies Operational and Geometric Goals in Uncertain Environments , 1990, AI Mag..

[150]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[151]  Elmer G. Gilbert,et al.  Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..

[152]  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.

[153]  Kurt Mehlhorn,et al.  Approximate motion planning and the complexity of the boundary of the union of simple geometric figures , 2005, Algorithmica.

[154]  Yijie Han,et al.  Shortest paths on a polyhedron , 1990, SCG '90.

[155]  Michael T. Goodrich,et al.  Parallel methods for visibility and shortest path problems in simple polygons (preliminary version) , 1990, SCG '90.

[156]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

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

[158]  Ming C. Lin,et al.  A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[159]  Koichi Kondo,et al.  Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..

[160]  C. S. George Lee,et al.  A framework of knowledge-based assembly planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[161]  Bruce Randall Donald,et al.  Sensor interpretation and task-directed planning using perceptual equivalence classes , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[162]  Rachid Alami,et al.  A geometrical approach to planning manipulation tasks. The case of discrete placements and grasps , 1991 .

[163]  Roger Y. Tsai,et al.  Automated sensor planning for robotic vision tasks , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[164]  Yong K. Hwang,et al.  Practical path planning among movable obstacles , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[165]  Tomás Lozano-Pérez,et al.  Parallel robot motion planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[166]  Narendra Ahuja,et al.  Path planning using the Newtonian potential , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[167]  Narendra Ahuja,et al.  A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..

[168]  Randall H. Wilson,et al.  On geometric assembly planning , 1992 .

[169]  Yong K. Hwang,et al.  SANDROS: a motion planner with performance proportional to task difficulty , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[170]  S. LaValle,et al.  Motion Planning , 2008, Springer Handbook of Robotics.