Name
Abstract | ||
|---|---|---|
This paper presents a distributed algorithmic solution, termed Coalition formation and deployment algorithm, to achieve network configurations where agents cluster into coincident groups that are distributed optimally over the environment. The motivation for this problem comes from spatial estimation tasks executed with unreliable sensors. We propose a probabilistic strategy that combines a repeated game governing the formation of coalitions with a spatial motion component governing their location. For a class of probabilistic coalition switching laws, we establish the convergence of the agents to coincident groups of a desired size in finite time and the asymptotic convergence of the overall network to the optimal deployment, both with probability 1. We also investigate the algorithm's time and communication complexity. Specifically, we upper bound the expected completion time of executions that use the proportional-to-number-of-unmatched-agentscoalition switching law under arbitrary and complete communication topologies. We also upper bound the number of messages required per timestep to execute our strategy. The proposed algorithm is robust to agent addition and subtraction. From a coalitional game perspective, the algorithm is novel in that the players' information is limited to the neighboring clusters. From a motion coordination perspective, the algorithm is novel because it brings together the basic tasks of rendezvous (individual agents into clusters) and deployment (clusters in the environment). Simulations illustrate the correctness, robustness, and complexity results. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.automatica.2013.08.019 | Automatica |
Keywords | Field | DocType |
Sensor networks,Hedonic games,Coalition formation,Optimal deployment,Spatial estimation | Mathematical optimization,Control theory,Upper and lower bounds,Correctness,Communication complexity,Robustness (computer science),Network topology,Repeated game,Rendezvous,Probabilistic logic,Mathematics | Journal |
Volume | Issue | ISSN |
49 | 11 | 0005-1098 |
Citations | PageRank | References |
0 | 0.34 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Ouimet | 1 | 6 | 4.34 |
| Jorge Cortes | 2 | 1452 | 128.75 |