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

This paper presents a general method to compute configuration space (c-space) obstacle surfaces (c-surfaces) in planar quaternion space. We extend the method to find the projection of a given point in c-space onto the c-surface We parameterize the general c-surface using a rotation angle and the vector of translation parameters of the individual contacts. We first compute the domain of the rotation parameter. Then, we can setup the translation parameters in a linear equation. The solution of this equation using singular value decomposition gives us the exact parameters of translation. We can extend this quasi-linear method to project 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]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

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

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

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

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

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

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

[8]  Matthew T. Mason,et al.  Compliance and Force Control for Computer Controlled Manipulators , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

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

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

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

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