pith. sign in

arxiv: 1104.0457 · v3 · pith:6S5VZXQ3new · submitted 2011-04-04 · 🧮 math.OC · cs.SY

Nonuniform Coverage Control on the Line

classification 🧮 math.OC cs.SY
keywords agentscontrolnumbersensingagentclosecomputationdistributed
0
0 comments X
read the original abstract

This paper investigates control laws allowing mobile, autonomous agents to optimally position themselves on the line for distributed sensing in a nonuniform field. We show that a simple static control law, based only on local measurements of the field by each agent, drives the agents close to the optimal positions after the agents execute in parallel a number of sensing/movement/computation rounds that is essentially quadratic in the number of agents. Further, we exhibit a dynamic control law which, under slightly stronger assumptions on the capabilities and knowledge of each agent, drives the agents close to the optimal positions after the agents execute in parallel a number of sensing/communication/computation/movement rounds that is essentially linear in the number of agents. Crucially, both algorithms are fully distributed and robust to unpredictable loss and addition of agents.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.