This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Spatial Planning: A Configuration Space Approach
February 1983 (vol. 32 no. 2)
pp. 108-120
T. Lozano-Perez, Artificial Intelligence Laboratory, Massachusetts Institute of Technology
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.
Index Terms:
robotics, Computational geometry, obstacle avoidance
Citation:
T. Lozano-Perez, "Spatial Planning: A Configuration Space Approach," IEEE Transactions on Computers, vol. 32, no. 2, pp. 108-120, Feb. 1983, doi:10.1109/TC.1983.1676196
Usage of this product signifies your acceptance of the Terms of Use.