Abstract
The subject of this work is the design of traffic laws for safe and efficient operation of a large number of independent mobile robots in a common territory. The set of traffic laws must be small and simple, and it must allow each individual robot to perform its own movement tasks efficiently, while preventing possible collisions between different robots. We present a close to optimal solution for robots operating in a grid-like environment, significantly improving over previously published results.
Work was supported in part by a grant from the Israeli Academy of Science.
Work at the Weizmann Institute supported in part by the Norman D. Cohen Professorial Chair of Computer Science, and a MINERVA grant.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Borodin and J.E. Hopcroft, Routing, merging, and sorting on parallel models of computation. Jornal of Compumter and System Sciences 30:130–145, 1985.
U. Feige and P. Raghavan, Exact Analysis of Hot-Potato Routing. In proceedings of IEEE symposioum on foundations of computer science, 553–562, 1992.
T. Hagerup and C. Rub, A guided tour of Chernoff bounds. Information Processing Letters 33, 305–308, 1989–90.
T. Leighton, Average case analysis of greedy routing algorithms on arrays. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, p. 2–10, July 1990.
Y. Moses and M. Tennenholtz. On Computational aspects of artificial social systems. In Proceedings of DAI-92, 1992.
D. Peleg and E. Upfal, A time-randomness trade-off for oblivious routing. SIAM Jurnal on Computing 19:256–266, 1990.
S. Preminger, Complexity Analysis of Movement in Multi Robot System. M.Sc. Thesis, Departmant of Applied Mathematics, The Weizmann Institute of Science, 1995.
Y. Shoham and M. Tennenholtz, On traffic laws for mobile robots. In First Conference on AI Planning Systems, 1992.
Y. Shoham and M. Tennenholtz, On social laws for artificial agent societies: Off-line design. Artificial Intelligence, vol. 73, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Preminger, S., Upfal, E. (1996). Safe and efficient traffic laws for mobile robots. In: Karlsson, R., Lingas, A. (eds) Algorithm Theory — SWAT'96. SWAT 1996. Lecture Notes in Computer Science, vol 1097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61422-2_145
Download citation
DOI: https://doi.org/10.1007/3-540-61422-2_145
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61422-7
Online ISBN: 978-3-540-68529-6
eBook Packages: Springer Book Archive