Decentralized Motion Planning for Multiple Mobile Robots: The Cocktail Party Model

Autonomous Robots

Volumn 4, Issue 1, 1997, Pages 121-135

  Lumelsky, V J ^{a,b,c,d,e,f,g,h}   Harinarayan, K R ^a,b,i  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b University of Wisconsin Madison   (United States)

^c TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

^d ICS   (Russian Federation)

^e YALE UNIVERSITY   (United States)

^f Soc's Tech Comm Robot Motion P   (United States)

^g SME ^*

^h ACM   (United States)

ⁱ INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Autonomous agents; Decentralized intelligence; Mobile robots; Robot motion planning

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COLLISION AVOIDANCE; COMPUTER SIMULATION; DECENTRALIZED CONTROL; MOBILE ROBOTS; SENSORS;

AUTONOMOUS AGENTS; COCKTAIL PARTY MODEL; DECENTRALIZED INTELLIGENCE; DECENTRALIZED MOTION PLANNING;

MOTION PLANNING;

EID: 0030713716     PISSN: 09295593     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008815304810     Document Type: Article

References (17)

1. Abelson, H. and diSessa, A. 1981. Turtle Geometry. MIT Press: Cambridge, MA.
2. Buckley, S. 1989. Fast motion planning for multiple moving robots. Proceedings of the IEEE International Conference on Robotics and Automation, pp. 322-326.
3. Cheung, E. and Lumelsky, V.J. 1989. Proximity sensing in robot manipulator motion planning: System and implementation issues. IEEE Journal of Robotics and Automation, 5(6):740-751.
4. Erdmann, M. and Lozano-Perez, T. 1987. On multiple moving objects. Algorithmica, 2:477-522.
5. Harding, E. and Kendall, D. (Eds.), Stochastic Geometry, John Wiley and Sons: London-New York, 1974.
6. Hopcroft, J., Schwartz, J., and Sharir, M. 1984. On the complexity of motion planning for multiple independent objects: PSPACE hardness of the 'warehouseman's problem'. International Journal of Robotics Research 3, 3(4):76-88.
7. Kant, K. and Zucker, S. 1986. Towards efficient planning: The path-velocity decomposition. International Journal of Robotics Research, 5:72-89.
8. Lumelsky, V. and Stepanov, A. 1987. Path planning strategies for a point mobile automaton moving amongst unknown obstacles of arbitrary shape. Algorithmica, 3(4):403-430.
9. Mahadevan, S. and Connell, J. 1992. Automatic programming of behavior-based robots using reinforcement learning. Artificial Intelligence, 55(2,3):311-365.
10. Mataric, M. 1994. Interaction and intelligent behavior. Ph.D. Thesis, MIT, Dept. of Electrical Engineering and Computer Science, AITR-1495.
11. Preparata, F. and Shamos, M. 1985. Computational Geometry, Springer-Verlag: New York.
12. Scheinman, V. 1987. Robotworld: A multiple robot vision guided assembly system. Proceedings of the International Symposium on Robotics Research.
13. Schwartz, J. and Sharir, M. 1983. On the piano movers problem - III. Coordinating the motion of several independent bodies. International Journal of Robotics Research, 3.
14. Spirakis, P. and Yap, C. 1984. Strong NP-hardness of moving many discs. Information Processing Letters, 19:55-59.
15. Tournassoud, P. 1986. A strategy for obstacle avoidance and its application to multi-robot systems. Proceedings of the IEEE International Conference on Robotics and Automation, pp. 1224-1229.
16. Yap, C. 1984. Coordinating the motion of several discs. TR-105, Courant Institute of Mathematical Sciences, New York University, New York.
17. Yegorov, V. 1996. Statistical analysis of sensor-based motion planning algorithms. MS Thesis, Dept. of Computer Science, University of Wisconsin-Madison.