A case-based approach to robot motion planning

The authors present a case-based robot motion planning system. Case-based planning affords on the system good average case performance by allowing it to understand and exploit the tradeoff between completeness and computational cost, and permits it to successfully plan and learn in a complex domain without the need for an extensively engineered and possibly incomplete domain theory. The system automatically classifies motion planning problems according to the solution method that is most appropriate, not by using a fixed classification of problems, but by learning with experience how to map problems to solution methods.<<ETX>>

[1]  Kristian J. Hammond,et al.  Explaining and Repairing Plans that Fail , 1987, IJCAI.

[2]  Barbara Hayes-Roth,et al.  A Case-Based Mechanical Redesign System , 1989, IJCAI.

[3]  Jean-Claude Latombe,et al.  New heuristic algorithms for efficient hierarchical path planning , 1991, IEEE Trans. Robotics Autom..

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

[5]  Bernard Faverjon,et al.  Obstacle avoidance using an octree in the configuration space of a manipulator , 1984, ICRA.

[6]  Janet L. Kolodner,et al.  The MEDIATOR: Analysis of an Early Case-Based Problem Solver , 1989, Cogn. Sci..

[7]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[8]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[9]  Narendra Ahuja,et al.  Path planning using a potential field representation , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[10]  Janet L. Kolodner,et al.  Extending Problem Solver Capabilities Through Case-Based Inference , 1987 .

[11]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[12]  Rodney A. Brooks,et al.  Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.

[13]  Ray Bareiss,et al.  Concept Learning and Heuristic Classification in WeakTtheory Domains , 1990, Artif. Intell..

[14]  Daniel E. Koditschek,et al.  Robot planning and control via potential functions , 1989 .

[15]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[16]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[17]  Seth Hutchinson,et al.  Dealing With Unexpected Moving Obstacles By Integrating Potential Field Planning With Inverse Dynamics Control , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

[18]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[19]  Wendy G. Lehnert,et al.  Case-based Problem Solving with a Large Knowledge Base of Learned Cases , 1987, AAAI.

[20]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .