Global Path Planning Approaches for Material Movements in a Worksite

In various environments (e.g., manufacturing shopfloors, civil engineering construction sites, space) there is an increasing need to efficiently transport objects from locations to other locations. Although most practical material transportation robotic system built so far have been quite primitive, we believe that in many areas one can significantly gain in efficiency, reliability and flexibility by automatically planning the motions of the transportation devices. While process planning provides a high-level ‘logical’ and possibly ‘temporal’ specification of material movements, motion planning says how these movements are to be ‘physically’ carried out. Thus, motion planning is the natural intermediate stage between process planning and task execution. In this paper, we survey techniques for planning mobile robot paths among obstacles, which have been developed over the last few years. We focus on the so-called ‘global’ techniques. We describe in detail the three most common approaches, which are based on the notions of cell decomposition, free space retraction, and visibility graph, respectively. Within the first two approaches, we survey both the so-called exact and approximate techniques. Although this paper is far from exploring all the facets of motion planning, it gives a fundamental and detailed presentation of issues, which are of general interest to all motion planning problems. These issues are likely to be of prime importance in future material transportation systems.

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

[2]  Hans Rohnert,et al.  Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..

[3]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

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

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

[6]  Chee-Keng Yap,et al.  Algorithmic and geometric aspects of robotics , 1987 .

[7]  M. Spivak A comprehensive introduction to differential geometry , 1979 .

[8]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

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

[10]  Jean Latombe Motion Planning with Uncertainty: The Preimage Backchaining Approach , 1988 .

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

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

[13]  Micha Sharir,et al.  An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract) , 1985, SCG '85.

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

[15]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

[16]  V. Arnold Mathematical Methods of Classical Mechanics , 1974 .

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

[18]  Micha Sharir,et al.  Retraction: A new approach to motion-planning , 1983, STOC.

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

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

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

[22]  Chee Yap,et al.  Algorithmic motion planning , 1987 .

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

[24]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[25]  Andrzej Lingas,et al.  The Power of Non-Rectilinear Holes , 1982, ICALP.

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

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

[28]  Micha Sharir,et al.  Planning, geometry, and complexity of robot motion , 1986 .

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

[30]  Rodney A. Brooks,et al.  Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.

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

[32]  Bernard Chazelle,et al.  Decomposing a polygon into its convex parts , 1979, STOC.

[33]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[36]  Hanan Samet,et al.  Region representation: quadtrees from boundary codes , 1980, CACM.

[37]  Pere Brunet,et al.  Object representation by means of nonminimal division quadtrees and octrees , 1985, TOGS.

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

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

[40]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[41]  Dennis S. Arnon,et al.  A cellular decomposition algorithm for semi-algebraic sets , 1979, EUROSAM.