Robot path planning for space-truss assembly

Construction, repair, and maintenance of space-based structures will require extensive planning of operations in order to effectively carry out these tasks. The path planning algorithm described here is a general approach to generating paths that guarantee collision avoidance for a single chain nonredundant or redundant robot. The algorithm uses a graph search of feasible points in position space followed by a local potential field method that guarantees collision avoidance among objects, structures, and the robot arm as well as the conformance to joint limit constraints. This algorithm is novel in its computation of goal attractive potential fields in Cartesian space and computation of obstacle repulsive fields in robot joint space. These effects are combined to generate robot motion. Computation is efficiently implemented through the computation of the robot arm Jacobian and not the full inverse arm kinematics. These planning algorithms have been implemented and evaluated using existing space-truss designs and are being integrated into the RPI-CIRSSE testbed environment.

[1]  J. Angeles.  On the Numerical Solution of the Inverse Kinematic Problem , 1985 .

[2]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[3]  Walter Meyer,et al.  Path planning and the geometry of joint space obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[4]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[5]  Jorge Angeles,et al.  Kinematic Inversion of Robotic Manipulators in the Presence of Redundancies , 1989, Int. J. Robotics Res..

[6]  Michael Zyda,et al.  Solving global two-dimensional routing problems using snell's law and a search , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[7]  Brad E. Paden,et al.  Path planning using a Jacobian-based freespace generation algorithm , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

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

[9]  Pradeep K. Khosla,et al.  Superquadric artificial potentials for obstacle avoidance and approach , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

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

[11]  Yutaka Kanayama,et al.  Least Cost Paths With Algebraic Cost Functions , 1988, IEEE International Workshop on Intelligent Robots.

[12]  P. Khosla,et al.  Artificial potentials with elliptical isopotential contours for obstacle avoidance , 1987, 26th IEEE Conference on Decision and Control.

[13]  Kang G. Shin,et al.  A probabilistic approach to collision-free robot path planning , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[14]  B. Faverjon,et al.  A local based approach for path planning of manipulators with a high number of degrees of freedom , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[15]  Jorge Angeles,et al.  The Kinematic Inversion of Robot Manipulators in the Presence of Singularities , 1988 .