Share Email Print

Proceedings Paper

Manipulator path planning in 3-dimensional space
Author(s): Dmitry A. Pavlov
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Present paper is aimed to work out efficient algorithm of multi-chain manipulator path planning in 3D space with static polygonal obstacles. The resulting solution is based on navigational maps approach. Using this approach, manipulator features are considered as intellectual agent, and reachability information is stored in compact form. This enables fast adaptation to arbitrary parameters of manipulator and workspace. The paper describes two algorithms: (i) a local walkthrough with obstacle avoidance, and (ii) incremental navigational map building, performed at running stage. Both algorithms take an extensive use of the specific features of the task. Working simultaneously, they allow real-time manipulator path planning, as well as self-learning in idle mode. Algorithms are implemented as a demonstration program.

Paper Details

Date Published: 9 June 2006
PDF: 5 pages
Proc. SPIE 6253, Ninth International Workshop on Nondestructive Testing and Computer Simulations, 62530P (9 June 2006); doi: 10.1117/12.676736
Show Author Affiliations
Dmitry A. Pavlov, St. Petersburg State Technical Univ. (Russia)

Published in SPIE Proceedings Vol. 6253:
Ninth International Workshop on Nondestructive Testing and Computer Simulations
Alexander I. Melker, Editor(s)

© SPIE. Terms of Use
Back to Top