Home > Research > Publications & Outputs > Traffic control for a swarm of robots

Research

Electronic data

Links

Text available via DOI:

View graph of relations

Traffic control for a swarm of robots: avoiding group conflicts

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Traffic control for a swarm of robots: avoiding group conflicts. / Soriano Marcolino, Leandro; Chaimowicz, Luiz.
Proceedings of the 2009 IEEE International Conference on Intelligent Robots and Systems (IROS 2009). St. Louis, MO: IEEE, 2009. p. 1949-1954 (Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on).

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Soriano Marcolino, L & Chaimowicz, L 2009, Traffic control for a swarm of robots: avoiding group conflicts. in Proceedings of the 2009 IEEE International Conference on Intelligent Robots and Systems (IROS 2009). Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on, IEEE, St. Louis, MO, pp. 1949-1954. https://doi.org/10.1109/IROS.2009.5354336

APA

Soriano Marcolino, L., & Chaimowicz, L. (2009). Traffic control for a swarm of robots: avoiding group conflicts. In Proceedings of the 2009 IEEE International Conference on Intelligent Robots and Systems (IROS 2009) (pp. 1949-1954). (Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on). IEEE. https://doi.org/10.1109/IROS.2009.5354336

Vancouver

Soriano Marcolino L, Chaimowicz L. Traffic control for a swarm of robots: avoiding group conflicts. In Proceedings of the 2009 IEEE International Conference on Intelligent Robots and Systems (IROS 2009). St. Louis, MO: IEEE. 2009. p. 1949-1954. (Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on). doi: 10.1109/IROS.2009.5354336

Author

Soriano Marcolino, Leandro ; Chaimowicz, Luiz. / Traffic control for a swarm of robots : avoiding group conflicts. Proceedings of the 2009 IEEE International Conference on Intelligent Robots and Systems (IROS 2009). St. Louis, MO : IEEE, 2009. pp. 1949-1954 (Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on).

Bibtex

@inproceedings{c140ab93a1d34c268fffde250e554af3,
title = "Traffic control for a swarm of robots: avoiding group conflicts",
abstract = "A very common problem in the navigation of robotic swarms is when groups of robots move into opposite directions, causing congestion situations that may compromise performance. In this paper, we propose a distributed coordination algorithm to alleviate this type of congestion. By working collaboratively, and warning their teammates about a congestion risk, robots are able to coordinate themselves to avoid these situations. We executed simulations and real experiments to study the performance and effectiveness of the proposed algorithm. Results show that the algorithm allows the swarm to navigate in a smoother and more efficient fashion, and is suitable for large groups of robots.",
author = "{Soriano Marcolino}, Leandro and Luiz Chaimowicz",
year = "2009",
doi = "10.1109/IROS.2009.5354336",
language = "English",
isbn = "9781424438307",
series = "Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on",
publisher = "IEEE",
pages = "1949--1954",
booktitle = "Proceedings of the 2009 IEEE International Conference on Intelligent Robots and Systems (IROS 2009)",

}

RIS

TY - GEN

T1 - Traffic control for a swarm of robots

T2 - avoiding group conflicts

AU - Soriano Marcolino, Leandro

AU - Chaimowicz, Luiz

PY - 2009

Y1 - 2009

N2 - A very common problem in the navigation of robotic swarms is when groups of robots move into opposite directions, causing congestion situations that may compromise performance. In this paper, we propose a distributed coordination algorithm to alleviate this type of congestion. By working collaboratively, and warning their teammates about a congestion risk, robots are able to coordinate themselves to avoid these situations. We executed simulations and real experiments to study the performance and effectiveness of the proposed algorithm. Results show that the algorithm allows the swarm to navigate in a smoother and more efficient fashion, and is suitable for large groups of robots.

AB - A very common problem in the navigation of robotic swarms is when groups of robots move into opposite directions, causing congestion situations that may compromise performance. In this paper, we propose a distributed coordination algorithm to alleviate this type of congestion. By working collaboratively, and warning their teammates about a congestion risk, robots are able to coordinate themselves to avoid these situations. We executed simulations and real experiments to study the performance and effectiveness of the proposed algorithm. Results show that the algorithm allows the swarm to navigate in a smoother and more efficient fashion, and is suitable for large groups of robots.

U2 - 10.1109/IROS.2009.5354336

DO - 10.1109/IROS.2009.5354336

M3 - Conference contribution/Paper

SN - 9781424438307

T3 - Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on

SP - 1949

EP - 1954

BT - Proceedings of the 2009 IEEE International Conference on Intelligent Robots and Systems (IROS 2009)

PB - IEEE

CY - St. Louis, MO

ER -