1 January 1997 in Artificial Intelligence
1 October 1979 in Communications of the ACM
1 February 1983 in IEEE Transactions on Computers
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 March 1984 in The International Journal of Robotics Research
Active compliance enables robots to carry out tasks in the presence of significant sensing and control errors. Compliant motions are quite difficult for humans to specify, however. Furthermore, robot programs are quite sensitive to details of geometry and to error characteristics and must, therefore, be constructed anew for each task. These factors motivate the search for automatic synthesis tools for robot program ming, especially for compliant motion. This paper describes a formal approach to the synthesis of compliant-motion strategies from geometric descriptions of assembly operations and explicit estimates of errors in sensing and control. A key aspect of the approach is that it provides criteriafor correct ness of compliant-motion strategies.
1 June 1987 in IEEE Journal on Robotics and Automation
A simple and efficient algorithm is presented, using configuration space, to plan collision-free motions for general manipulators. An implementation of the algorithm for manipulators made up of revolute joints is also presented. The configuration-space obstacles for an n degree-of-freedom manipulator are approximated by sets of n - 1- dimensional slices, recursively built up from one-dimensional slices. This obstacle representation leads to an efficient approximation of the free space outside of the configuration-space obstacles.
1 September 1984 in The International Journal of Robotics Research
This paper discusses how local measurements of three- dimensional positions and surface normals (recorded by a set of tactile sensors, or by three-dimensional range sensors), may be used to identify and locate objects from among a set of known objects. The objects are modeled as polyhedra having up to six degrees of freedom relative to the sensors. We show that inconsistent hypotheses about pairings between sensed points and object surfaces can be discarded efficiently by using local constraints on distances between faces, angles between face normals, and angles (relative to the surface normals) of vectors between sensed points. We show by simu lation and by mathematical bounds that the number of hy potheses consistent with these constraints is small. We also show how to recover the position and orientation of the object from the sensory data. The algorithm's performance on data obtained from a triangulation range sensor is illustrated.