Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ROBOT.2007.363676
Title: | Multi-robot formations based on the queue-formation scheme with limited communications | Authors: | Fua, C.-H. Ge, S.S. Do, K.D. Lim, K.W. |
Keywords: | Convergence Deliberative coordination Limited communication ranges Multi-robot formations |
Issue Date: | 2007 | Citation: | Fua, C.-H., Ge, S.S., Do, K.D., Lim, K.W. (2007). Multi-robot formations based on the queue-formation scheme with limited communications. Proceedings - IEEE International Conference on Robotics and Automation : 2385-2390. ScholarBank@NUS Repository. https://doi.org/10.1109/ROBOT.2007.363676 | Abstract: | In this paper, we investigate the operation of the Queue-formation structure (or Q-structure) in multi-robot teams with limited communications. Information flow is divided into two time scales: (i) the fast time scale where the robots' reactive actions are determined based only on local communications, and (ii) the slow time scale, where information required is less demanding, can be collected over a longer time with intermittent information loss. Therefore, there is no need for global information at all times, reducing the overall communication load. In addition, a dynamic target determination algorithm, based on the Q-structure, is used to produce a series of targets that incrementally guide each robot into formation. It provides greater control over the distance between robots on the same queue for better formation scaling. An analysis of the convergence of the system of robots is provided. Simulation studies verify the effectiveness of the scheme. © 2007 IEEE. | Source Title: | Proceedings - IEEE International Conference on Robotics and Automation | URI: | http://scholarbank.nus.edu.sg/handle/10635/71068 | ISBN: | 1424406021 | ISSN: | 10504729 | DOI: | 10.1109/ROBOT.2007.363676 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.