Gathering few fat mobile robots in the plane

Theoretical Computer Science - Tập 410 - Trang 481-499 - 2009
Jurek Czyzowicz1, Leszek Ga̧sieniec2, Andrzej Pelc1
1Département d’informatique, Université du Québec en Outaouais, Gatineau, Québec J8X 3X7, Canada
2Department of Computer Science, The University of Liverpool, Liverpool, L69 7ZF, UK

Tài liệu tham khảo

Ando, 1999, A distributed memoryless point convergence algorithm for mobile robots with limited visibility, IEEE Transactions on Robotics and Automation, 15, 818, 10.1109/70.795787

Balch, 1998, Behavior based formation control for multi-robot teams, IEEE Transactions on Robotics and Automation, 14, 10.1109/70.736776

P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer, Gathering of autonomous mobile robots with limited visibility, in: Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001, in: LNCS, vol. 2010, pp. 247–258

Sugihara, 1996, Distributed algorithms for formation of geometric patterns with many mobile robots, Journal of Robotic Systems, 13, 127, 10.1002/(SICI)1097-4563(199603)13:3<127::AID-ROB1>3.0.CO;2-U

Suzuki, 1999, Distributed anonymous mobile robots: Formation of geometric patterns, SIAM Journal on Computing, 28, 1347, 10.1137/S009753979628292X