Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Recently, auction methods have been investigated as effective, decentralized methods for
multi-robot coordination. Experimental research has shown great potential, but has not been …

While graph covering is a fundamental and well-studied problem, this field lacks a broad
and unified literature review. The holistic overview of graph covering given in this article …

One of the main applications of mobile robots is terrain coverage: visiting each location in
known terrain. Terrain coverage is crucial for lawn mowing, cleaning, harvesting, search-and …

For large-scale tasks, coverage path planning (CPP) can benefit greatly from multiple robots.
In this paper, we present an efficient algorithm MSTC∗ for multi-robot coverage path …

We investigate time-optimal Multi-Robot Coverage Path Planning (MCPP) for both
unweighted and weighted terrains, which aims to minimize the coverage time, defined as the …

One of the main applications of mobile robots is coverage: visiting each location in known
terrain. Coverage is crucial for lawn mowing, cleaning, harvesting, search-and-rescue …

Keys for graphs incorporate the topology and value constraints needed to uniquely identify
entities in a graph. They have been studied to support object identification, knowledge …

This paper investigates the problem of computing the optimal trajectories of multiple data
MULEs (eg, robots, vehicles, etc.) to minimize data collection latency in wireless sensor …

Sweep coverage plays an important role in many applications like data gathering, sensing
coverage, and devices control. In this paper, we deal with the sweep coverage problem with …