A quasi-linear method for computing and projecting onto c-surfaces: general case

This paper presents a general method to compute configuration space (c-space) obstacle surfaces (c-surfaces) in dual quaternion space and for projecting points onto them. We parameterize the c-surface using the rotation angles of the object and the vector of translation parameters of the individual contacts. Once we compute the domain of the rotation parameters, we can setup the translation parameters in a linear equation. The singular value decomposition of this equation gives us with the exact parameters of translation. We extend the theory to find the projection of a point in c-space onto the c-surface. We implement our theory on the assembly plan from observation (APO) system. The APO observes discrete instants of an assembly task and reconstructs the compliant motion plan employed in the task. We compute the contacts at each observed instant and the corresponding c-surface. We then interpolate the path on each c-surface to obtain segments of the path. The complete motion plan will be the concatenation of the connected path segments.

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

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

[3]  A. Tucker,et al.  Linear Inequalities And Related Systems , 1956 .

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

[5]  Katsushi Ikeuchi,et al.  A quasi-linear method for computing and projecting onto c-surfaces: planar case , 1997, Proceedings of International Conference on Robotics and Automation.

[6]  Bruce Randall Donald,et al.  On motion planning with six degrees of freedom: Solving the intersection problems in configuration space , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[7]  Randy C. Brost,et al.  Analysis and planning of planar manipulation tasks , 1992 .

[8]  Katsushi Ikeuchi,et al.  Sensor Modeling, Probabilistic Hypothesis Generation, and Robust Localization for Object Recognition , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Katsushi Ikeuchi,et al.  Modeling planar assembly paths from observation , 1996, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. IROS '96.

[10]  J. Michael McCarthy,et al.  An algebraic formulation of configuration-space obstacles for spatial robots , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[11]  J. Michael McCarthy,et al.  Introduction to theoretical kinematics , 1990 .

[12]  Katsushi Ikeuchi,et al.  Towards An Assembly Plan From Observation: Part II: Correction Of Motion parameters Based On Fact Contact Constraints , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  A. J. Goldman,et al.  Polyhedral Convex Cones , 1956 .

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

[15]  S. B. Kang,et al.  An Active Multibaseline Stereo System with Real-Time Image Acquisition , 1994 .