We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Abstract— This paper presents coverage algorithms for mobile sensor networks in which agents have limited power to move. Rather than making use of a constrained optimization tech...
— A decentralized, adaptive control law is presented to drive a network of mobile robots to a near-optimal sensing configuration. The control law is adaptive in that it integrat...
Mac Schwager, Jean-Jacques E. Slotine, Daniela Rus