Continuous Protocols for Swarm Robotics

作者: Peter Kling , Friedhelm Meyer auf der Heide

DOI: 10.1007/978-3-030-11072-7_13

关键词: Distributed computingRobotComputer sciencePoint (geometry)Energy consumptionSwarm roboticsSimple (abstract algebra)Upper and lower boundsPlane (geometry)Focus (optics)

摘要: We consider simple models of swarms identical, anonymous robots: they are points in the plane and “see” only their neighbors (robots within distance one). will deal with distributed local protocols such that result formations like “gathering at one point”. The focus be on assuming a continuous time model. present upper lower bounds run energy consumption, compare different both theoretically experimentally.

参考文章(18)
Yoann Dieudonné, Franck Petit, Self-stabilizing Deterministic Gathering Algorithmic Aspects of Wireless Sensor Networks. ,vol. 5804, pp. 230- 241 ,(2009) , 10.1007/978-3-642-05434-1_23
Noam Gordon, Israel A. Wagner, Alfred M. Bruckstein, Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities Ant Colony Optimization and Swarm Intelligence. pp. 142- 153 ,(2004) , 10.1007/978-3-540-28646-2_13
Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Solving the robots gathering problem international colloquium on automata languages and programming. pp. 1181- 1196 ,(2003) , 10.1007/3-540-45061-0_90
Yoshiaki Katayama, Yuichi Tomida, Hiroyuki Imazu, Nobuhiro Inuzuka, Koichi Wada, Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots Structural Information and Communication Complexity. pp. 274- 288 ,(2007) , 10.1007/978-3-540-72951-8_22
Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada, Gathering autonomous mobile robots with dynamic compasses: an optimal result international symposium on distributed computing. pp. 298- 312 ,(2007) , 10.1007/978-3-540-75142-7_24
K. Ruben Gabriel, Robert R. Sokal, A New Statistical Approach to Geographic Variation Analysis Systematic Biology. ,vol. 18, pp. 259- 278 ,(1969) , 10.2307/2412323
Reuven Cohen, David Peleg, Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems SIAM Journal on Computing. ,vol. 34, pp. 1516- 1528 ,(2005) , 10.1137/S0097539704446475
A. Watton, D. W. Kydon, Analytical Aspects of the N-Bug Problem American Journal of Physics. ,vol. 37, pp. 220- 221 ,(1969) , 10.1119/1.1975458
Bastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, Roger Wattenhofer, None, A tight runtime bound for synchronous gathering of autonomous robots with limited visibility Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11. pp. 139- 148 ,(2011) , 10.1145/1989493.1989515
N. Pezeshkian, J. M. Spector, M. Raymond, A. Gupta, Hoa G. Nguyen, Autonomous Communication Relays for Tactical Robots ,(2003)