In this paper, the problem of determining if a population of mobile robots is able to travel from an initial configuration to a target configuration is addressed. This problem is related with the controllability of the automaton describing the system. To solve the problem, the concept of navigation automaton is introduced, allowing a simplification in the analysis of controllability. A set of illustrative examples is presented. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Melo, F. A., Ribeiro, M. I., & Lima, P. (2005). Navigation controllability of a mobile robot population. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3276, pp. 499–507). Springer Verlag. https://doi.org/10.1007/978-3-540-32256-6_45
Mendeley helps you to discover research relevant for your work.