Path planning for altruistically negotiating processes

Autonomous negotiating systems are composed of logically (even geographically) separated software agents that control logical or physical resources that altruistically seek to perform useful work in a cooperative manner. These systems are multi-agent systems that consist of a population of autonomous agents collaborating to work for a common goal while simultaneously performing their individual tasks (i.e., computational resources are distributed amongst interconnected agents). With the increasing capabilities of the collaborative agents, the need for faster and more efficient methods of utilizing the distributed resources has also increased. This paper focuses on improving the performance of one such multi-agent system that deals with the path planning for autonomous robots. This is achieved by exploiting parallelism among processing resources embedded in the autonomous vehicles, using a distributed memory, message-passing execution model

[1]  Bruce Randall Donald,et al.  Kinodynamic motion planning , 1993, JACM.

[2]  Steven M. LaValle,et al.  Resolution complete rapidly-exploring random trees , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[3]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[4]  P. Cheng,et al.  RRT-based trajectory design for autonomous automobiles and spacecraft , 2001 .

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

[6]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[7]  Marios M. Polycarpou,et al.  COOPERATIVE PATH-PLANNING FOR AUTONOMOUS VEHICLES USING DYNAMIC PROGRAMMING , 2002 .

[8]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[9]  Jonathan P. How,et al.  COORDINATION AND CONTROL OF MULTIPLE UAVs , 2002 .

[10]  B. Moor,et al.  Mixed integer programming for multi-vehicle path planning , 2001, 2001 European Control Conference (ECC).

[11]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[12]  Michael T. Goodrich,et al.  Algorithm design , 2001 .

[13]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[14]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[15]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[16]  Jean-Claude Latombe,et al.  Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 2005, Algorithmica.