By Topic

Automatic planning of fine motions: Correctness and completeness

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. Mason ; Carnegie-Mellon University, Pittsburgh, PA

In this paper we explore a method for automatic planning of robot fine-motion programs, first described in [Lozano-Pérez, Mason, and Taylor 1983]. The primary result is a variation that is shown to be "bounded-complete"-the method obtains a solution whenever a solution consisting of a bounded number of motions exists.

Published in:

Robotics and Automation. Proceedings. 1984 IEEE International Conference on  (Volume:1 )

Date of Conference:

Mar 1984