Abstract
The majority rule scheme has been applied in the setting of robot swarms as a mechanism
to reach consensus among a population of robots regarding the optimality of one out of two options.
In the context of distributed decision making for agents, we consider two schemes of combining the
majority rule scheme with dynamic adaptation for the well-known double bridge problem to cater for
a situation where the shortest path changes over time. By modeling the systems as Markov chains,
initial results regarding the quality and the trade-off of ef¿ciency and adaptation time can be obtained.
Original language | English |
---|---|
Title of host publication | Pre-proceedings QAPL 2013 (Rome) |
Editors | L. Bortolussi, H. Wiklicky |
Place of Publication | Rome |
Publisher | Sapienza Università di Roma |
Pages | 1-4 |
Publication status | Published - 2013 |