Automatic Planning of Fine Motions: Correctness and Completeness

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


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.

Notes
Number of pages: 12

Text Reference
Matthew T. Mason, "Automatic Planning of Fine Motions: Correctness and Completeness," Proceedings of the IEEE International Conference on Robotics and Automation, 1984, March, 1984, pp. 492-503.

BibTeX Reference
@inproceedings{Mason_1984_1526,
   author = "Matthew T. Mason",
   title = "Automatic Planning of Fine Motions: Correctness and Completeness",
   booktitle = "Proceedings of the IEEE International Conference on Robotics and Automation, 1984",
   pages = "492-503",
   month = "March",
   year = "1984",
}