Abstract
Consider a group of N robots aiming to converge towards a single point. The robots cannot communicate, and their only input is obtained by visual sensors. A natural algorithm for the problem is based on requiring each robot to move towards the robots' center of gravity. The paper proves the correctness of the center-of-gravity algorithm in the semi-synchronous model for any number of robots, and its correctness in the fully asynchronous model for two robots. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Cohen, R., & Peleg, D. (2004). Robot convergence via center-of-gravity algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3104, 79–88. https://doi.org/10.1007/978-3-540-27796-5_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
