Optimal Allocation of Many Robot Guards for Sweep-Line Coverage
Si Wei Feng,Teng Guo,Jingjin Yu,Si Wei Feng,Teng Guo,Jingjin Yu
We study the problem of allocating many mobile robots for the execution of a pre-defined sweep schedule in a known two-dimensional environment, with applications toward search and rescue, coverage, surveillance, monitoring, pursuit-evasion, and so on. The mobile robots (or agents) are assumed to have one-dimensional sensing capability with probabilistic guarantees that deteriorate as the sensing d...
