Automatic Planning of Fine Motions: Correctness and Completeness.

摘要

This paper explores a method for automatic planning of robot fine-motion programs, first described in another paper. 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. (Author)