Spatial Planning: A Configuration Space Approach

This paper presents algorithms for computing constraints on the position of an object due to the presence of ther objects. This problem arises in applications that require choosing how to arrange or how to move objects without collisions. The approach presented here is based on characterizing the position and orientation of an object as a single point in a configuration space, in which each coordinate represents a degree of freedom in the position or orientation of the object. The configurations forbidden to this object, due to the presence of other objects, can then be characterized as regions in the configuration space, called configuration space obstacles. The paper presents algorithms for computing these configuration space obstacles when the objects are polygons or polyhedra.

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

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

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

[4]  R. Brooks.  Solving the Find-Path Problem by Representing Free Space as Generalized Cones , 1982 .

[5]  Godfried T. Toussaint,et al.  An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

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

[7]  Victor O. K. Li,et al.  Finding minimum rectilinear distance paths in the presence of barriers , 1981, Networks.

[8]  Jacob T. Schwartz,et al.  Finding the Minimum Distance Between Two Convex Polygons , 1981, Information Processing Letters.

[9]  F. Frances Yao.  On the priority approach to hidden-surface algorithms , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Antonio Albano,et al.  Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Leonidas J. Guibas,et al.  On translating a set of rectangles , 1980, STOC '80.

[12]  Richard Paul,et al.  Manipulator Cartesian Path Control , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

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

[14]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[15]  Georges Giralt,et al.  A Multi-level Planning and Navigation System for a Mobile Robot: A First Approach to HILARE , 1979, IJCAI.

[16]  Hans P. Moravec.  Visual Mapping by a Robot Rover , 1979, IJCAI.

[17]  John W. Boyse,et al.  Interference detection among solids and surfaces , 1979, CACM.

[18]  Bruce J. Schachter,et al.  Decomposition of Polygons into Convex Sets , 1978, IEEE Transactions on Computers.

[19]  Kevin Q. Brown.  Fast Intersection of Half Spaces. , 1978 .

[20]  David E. Muller,et al.  Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..

[21]  D. E. Muller,et al.  Finding the Intersection of a Set of n Half-Spaces in Time O(nlogn). , 1977 .

[22]  T.C. Woot.  Progress in Shape Modeling* , 1977, Computer.

[23]  Alan M. Thompson.  The Navigation System of the JPL Robot , 1977, IJCAI.

[24]  Michael A. Wesley,et al.  AUTOPASS: An Automatic Programming System for Computer Controlled Mechanical Assembly , 1977, IBM J. Res. Dev..

[25]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[26]  S. M. Udupa,et al.  Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.

[27]  Tomas Lozano-Perez,et al.  The Design of a Mechanical Assembly System , 1976 .

[28]  Michael Ian Shamos,et al.  Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[29]  Antonio Albano,et al.  NESTING TWO-DIMENSIONAL SHAPES IN RECTANGULAR MODULES , 1976 .

[30]  Russell H. Taylor,et al.  The synthesis of manipulator control programs from task-level specifications , 1976 .

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

[32]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.

[33]  R. A. Lewis,et al.  Autonomous manipulation on a robot: Summary of manipulator software functions , 1974 .

[34]  Gregory F. Pfister.  On Solving The Findspace Problem, or How to Find Out Where Things Aren't .... , 1973 .

[35]  Terry Winograd,et al.  Understanding natural language , 1974 .

[36]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[37]  M. Adamowicz.  The optimum two-dimensional allocation of irregular, multiply-connected shapes with linear, logical and geometric constraints , 1970 .

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

[39]  Nils J. Nilsson,et al.  A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.

[40]  Donald L Peiper.  THE KINEMATICS OF MANIPULATORS UNDER COMPUTER CONTROL , 1968 .

[41]  John E Warnock,et al.  A Hidden Line Algorithm for Halftone Picture Representation , 1968 .

[42]  William E. Howden,et al.  The sofa problem , 1968, Comput. J..

[43]  R. V. Benson.  Euclidean Geometry and Convexity , 1966 .

[44]  L. A. Li︠u︡sternik.  Convex figures and polyhedra , 1966 .