Automatic planning of fine motions: Correctness and completeness

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.

[1]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Matthew T. Mason,et al.  Compliance and Force Control for Computer Controlled Manipulators , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[5]  井上 博允,et al.  Force Feedback in Precise Assembly Tasks , 1975 .

[6]  J. L. Nevins,et al.  The Force Vector Assembler Concept , 1972 .

[7]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[8]  Peter M. Will,et al.  An Experimental System for Computer Controlled Mechanical Assembly , 1975, IEEE Transactions on Computers.

[9]  Hirochika Inoue,et al.  Force Feedback in Precise Assembly Tasks , 1974 .