A Computational Interactive Approach to Multi-agent Motion Planning

  • Ji, Sang-Hoon (School of Electrical Engineering and Computer Sciences, Seoul National University) ;
  • Choi, Jeong-Sik (School of Electrical Engineering and Computer Sciences, Seoul National University) ;
  • Lee, Beom-Hee (School of Electrical Engineering and Computer Sciences, Seoul National University)
  • Published : 2007.06.30

Abstract

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agents. Most of the past research results are thus based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents, for the case of general shaped paths in agent movement. First, to reduce the computation time, an extended collision map is developed and utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, a priority for multi-agents is considered for successive and interactive modifications of the agent movements with lower priority. Various solutions using speed reduction and time delay of the relevant agents are investigated and compared in terms of the computation time. A practical implementation is finally provided for three different types of agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

Keywords

References

  1. J. C. Latombe, Robot Motion Planning, Kluwer Academic Publishers, 1991
  2. K. Fujimura, Motion Planning in Dynamic Environment, Springer-Verlag, New York, 1991
  3. M. B. Dias and A. Stentz, 'Opportunistic optimization for market-based multirobot control,' Proc. of IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2002
  4. J. H. Reif, 'Complexity of the mover's problem and generalizations,' Proc. of the 20th IEEE symp. on Foundations of Computer Science, pp. 412-427,1979
  5. J. F. Canny, The Complexity of Robot Motion Planning, MIT Press, 1988
  6. S. Akella and S. Hutchinson, 'Coordinating the motions of multiple robots with specified trajectories,' Proc. of the IEEE Int. Conf on Robotics & Automation, Washington DC, May, 2002
  7. R. R. Murphy, Introduction to AI Robotics, The MIT Press, 2000
  8. J. Hasegawa, K. Kurihara, and N. Nishiuchi, 'Collision-free path planning method for mobile robot,' Proc of IEEE Int. Conf on Systems, Man and Cybernetics, 2002
  9. C. Mudgal and J. Vassileva, 'An influence diagram model for multi-agent negotiation,' Proc. of IEEE Int. Conf on MultiAgent System, pp. 451-452, July, 2000
  10. Y. K. Hwang and N. Ahuja, 'Gross motion planning - a survey,' ACM Computing Surveys, vol. 24, no. 3, pp. 219-291, September 1992 https://doi.org/10.1145/136035.136037
  11. J. Barraquand, L. Kavraki, J. C. Latombe, T. Y. Li, and P. Raghavan, 'A random sampling scheme for path planning,' Int. Journal of Robotic Research, vol. 16, no. 6, pp. 759-774, Dec, 1997 https://doi.org/10.1177/027836499701600604
  12. J. Barraquand and J. Latombe, 'Robot motion planning: A distributed representation approach,' Int. Journel of Robotics Research, vol. 10, pp. 628-649, 1991 https://doi.org/10.1177/027836499101000604
  13. L. Kavraki, P. Svestka, J. Latombe, and M. Overmars, 'Probabilistic roadmap for fast path planning in high-dimensional configuration spaces,' IEEE Trans. on Robotics and Automation, vol. 12, pp. 566-580, 1996 https://doi.org/10.1109/70.508439
  14. T. Y. Li and H. C. Chou, 'Motion planning for a crowd of robots,' Proc. of IEEE Int. Conf on Robotics & Automations, September 2003
  15. K. S. Barber, T. H. Liu, and S. Ramaswamy, 'Conflict detection during plan integration for multi-agent systems,' IEEE Trans. on Systems, Man, and Cybernetics, vol. 31, no. 4, pp. 616-627, August 2001 https://doi.org/10.1109/3477.938264
  16. M. M. Quottrup, T. Bak, and R. Izadi-Zamanabadi, 'Multi-robot planning: A timed automata approach,' Proc. of IEEE Int. Conf on Robotics and Automation, pp. 4417-4422, April, 2004
  17. K. Azarm and G. Schmit, 'Conflict-free motion of multiple mobile robots based on decentralized motion planning and negotiation,' Proc. of IEEE Int. Conf on Robotics and Automation, pp. 3526-3533, April 1997
  18. K. S. Barber, T. H. Liu, and D. C. Han, 'Agentoriented design,' Proc. of the Ninth European Workshop on Modeling Autonomous Agents in a Multi-Agent World, Valencia, Spain, Lecture Notes in Computer Science: Lecture Notes in Artificial Intelligence, F. J. Garijo and M.Boman, Eds., Spring-Verlag, New York, 1999
  19. J. H. Lee and H. Hashimoto, 'Intelligent space,' Proc. of IEEE/RSJ Int. Conf on Intelligent Robots and Systems, vol. 2, pp. 1358-1363, Nov. 2000
  20. O. Kubitz, M. O. Berger, and R. Dumoulin, 'Application of radio frequency identification devices to support navigation of autonomous mobile robots,' Vehicle Technology Conf, vol. 1, pp. 126-130, 1997
  21. H. Norihiro, K. Kiyoshi, M. Kehji, and S. Yasuyuki, 'Collaborative capturing of experiences with ubiquitous sensors and communication robots,' Proc. of IEEE Int. Conf on Robotics & Automation, pp. 4166-4171, September 2003
  22. M. Erdmann and T. Lozano-Perez, 'On multiple moving object,' Proc. of IEEE Int. Conf on Robotics and Automation, vol. 3, pp. 1419-1424, 1986
  23. R. Siewart and I. R. Nourbakhsh, Introduction to Autonomous Mobile Robots, The MIT Press, 2003
  24. B. H. Lee and C. S. G. Lee, 'Collision-free motion planning of two robots,' IEEE Trans. on Systems, Main, and Cybernetics, vol. 17, no 1, pp. 21-31, January/February 1987 https://doi.org/10.1109/TSMC.1987.289330
  25. C. Chang, M. J. Chung, and B. H. Lee, 'Collision avoidance of two general robot manipulators by minimum delay time,' IEEE Trans. on Systems, Main, and Cybernetics, vol. 24, no. 3, pp. 517-522, March 1994 https://doi.org/10.1109/21.279000