SOUR graphs for efficient completion.
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect...
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with...
This special issue of the Kybernetika Journal arose from the 9th workshop on uncertainty processing, WUPES’12, held in Mariánské Lázně, Czech Republic, in September 2012. In the selection process for this special issue, we tried to capture the rich variety of the presented methodological approaches. The quality of the selected papers was judged by reviewers in accord with the usual practice of Kybernetika. After a careful selection, 7 papers were included in the special issue. There are, however,...