Feedback-based event-driven parts moving

A collection of unactuated disk-shaped "parts" must be brought by an actuated manipulator robot into a specified configuration from arbitrary initial conditions. The task is cast as a noncooperative game played among the parts-which in turn yields a feedback-based event-driven approach to plan generation and execution. The correctness of this approach, an open question, has been demonstrated in simpler settings and is further suggested by the extensive experiments reported here using an actual working implementation with EDAR-a mobile robot operating in a purely feedback-based event-driven manner. These results verify the reliability of this approach against uncertainties in sensory information and unanticipated changes in workspace configuration.

[1]  Jen-Hui Chuang.  Potential-based modeling of three-dimensional workspace for obstacle avoidance , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[2]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[3]  P. Holmes,et al.  Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields , 1983, Applied Mathematical Sciences.

[4]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[5]  Raja Chatila,et al.  Deliberation and reactivity in autonomous mobile robots , 1995, Robotics Auton. Syst..

[6]  D. Koditschek.  The Application of Total Energy as a Lyapunov Function for Mechanical Control Systems , 1989 .

[7]  Shuzhi Sam Ge,et al.  New potential functions for mobile robot path planning , 2000, IEEE Trans. Robotics Autom..

[8]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[9]  Karen Zita Haigh,et al.  A layered architecture for office delivery robots , 1997, AGENTS '97.

[10]  Jun Ota,et al.  Rearrangement planning of multiple movable objects by using real-time search methodology , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[11]  G. Swaminathan.  Robot Motion Planning , 2006 .

[12]  Ehud Rivlin,et al.  To push or not to push: on the rearrangement of movable objects by a mobile robot , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[13]  Charles W. Warren,et al.  Multiple robot path coordination using artificial potential fields , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[14]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[15]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[16]  W. Eric L. Grimson,et al.  Handey: A robot system that recognizes, plans, and manipulates , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[17]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[18]  Ehud Rivlin,et al.  Practical pushing planning for rearrangement tasks , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

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

[20]  Gordon T. Wilfong.  Motion planning in the presence of movable obstacles , 1988, SCG '88.

[21]  Luis Moreno,et al.  Navigation of mobile robots: open questions , 2000, Robotica.

[22]  Wyatt S. Newman,et al.  High speed robot control and obstacle avoidance using dynamic potential functions , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[23]  John M. Evans,et al.  HelpMate: an autonomous mobile robot courier for hospitals , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[24]  Jean-Claude Latombe,et al.  Geometric Reasoning About Mechanical Assembly , 1994, Artif. Intell..

[25]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[26]  Rachid Alami,et al.  Motion planning for a robot and a movable object amidst polygonal obstacles , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[27]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[28]  Charles W. Warren,et al.  Global path planning using artificial potential fields , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[29]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

[30]  Daniel E. Koditschek,et al.  Assembly as a noncooperative game of its pieces: analysis of 1D sphere assemblies , 2001, Robotica.

[31]  Ehud Rivlin,et al.  Practical pushing planning for rearrangement tasks , 1998, IEEE Trans. Robotics Autom..

[32]  H.I. Bozma,et al.  A Game-Theoretic Approach to Integration of Modules , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[33]  Daniel E. Koditschek,et al.  An approach to autonomous robot assembly , 1994, Robotica.