Share Email Print

Proceedings Paper

A Fine-Motion Planning Algorithm
Author(s): Matthew A. Turk
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

Assembly tasks typically involve tight fits and precise positioning beyond the capability of position-controlled robots. The motions required for such tasks, called fine-motions, may be performed by means other than pure position control. Fine-motions must overcome the inherent uncertainty in the robot's position relative to its environment. This uncertainty results from errors in sensing, modeling, and control. If bounds on these errors are known or can be estimated accurately, motions may be planned that will perform fine-motion tasks despite the uncertainty. Automatic planning of robot motions to perform these tasks prevents the tedious, error-prone process of constructing a plan for each task by hand. This paper presents an approach to fine-motion planning and an implementation of the algorithms in a planning system. A simple method is explored to plan and perform assembly tasks in the presence of uncertainty using a geometric model of the task, error bounds, and a model of compliant behavior. The principal ingredients of the method are algorithms that manipulate graph representations of the task to find, and choose from, a small number of alternative plans. The approach is implemented in a system that generates plans from task descriptions of two degree-of-freedom operations.

Paper Details

Date Published: 11 December 1985
PDF: 8 pages
Proc. SPIE 0579, Intelligent Robots and Computer Vision IV, (11 December 1985); doi: 10.1117/12.950791
Show Author Affiliations
Matthew A. Turk, Martin Marietta Denver Aerospace (United States)

Published in SPIE Proceedings Vol. 0579:
Intelligent Robots and Computer Vision IV
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top