Home/Automatic Planning of Fine Motions: Correctness and Completeness

Automatic Planning of Fine Motions: Correctness and Completeness

Matthew T. Mason
Conference Paper, Proceedings of the IEEE International Conference on Robotics and Automation, 1984, pp. 492-503, March, 1984

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

In this paper we explore a method for automatic planning of robot fine-motion programs, first described in [Lozano-Perez, 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.

BibTeX Reference
@conference{Mason-1984-15180,
title = {Automatic Planning of Fine Motions: Correctness and Completeness},
author = {Matthew T. Mason},
booktitle = {Proceedings of the IEEE International Conference on Robotics and Automation, 1984},
month = {March},
year = {1984},
pages = {492-503},
}
2017-09-13T10:53:16+00:00