Distributed, play-based coordination for robot teams in dynamic environments

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present refinements to our previous work on team communication and multi-robot world modeling in the RoboCup legged league. These refinements put high priority on the communication of task-relevant data. We also build upon past results within the simulation and the smallsize leagues and contribute a distributed, play-based role assignment algorithm. This algorithm allows the robots to autonomously adapt their strategy based on the current state of the environment, the game, and the behavior of opponents. The improvements discussed in this paper were used by CMDash in the RoboCup 2005 international competition. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

McMillen, C., & Veloso, M. (2007). Distributed, play-based coordination for robot teams in dynamic environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4434 LNAI, pp. 483–490). Springer Verlag. https://doi.org/10.1007/978-3-540-74024-7_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free