Robot path planning for space-truss assembly

Rolf Muenger; Arthur C. Sanderson

doi:10.1117/12.56756

1 March 1992 Robot path planning for space-truss assembly

Rolf Muenger, Arthur C. Sanderson

Proceedings Volume 1612, Cooperative Intelligent Robotics in Space II; (1992) https://doi.org/10.1117/12.56756
Event: Robotics '91, 1991, Boston, MA, United States

Abstract

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.

Citation Download Citation

Rolf Muenger and Arthur C. Sanderson "Robot path planning for space-truss assembly", Proc. SPIE 1612, Cooperative Intelligent Robotics in Space II, (1 March 1992); https://doi.org/10.1117/12.56756

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available