In this paper we propose a novel policy for steering multiple vehicles between assigned independent start and goal configurations and ensuring collision avoidance. The policy rests on the assumption that agents are all cooperating by implementing the same traffic rules. However, the policy is completely decentralized, as each agent decides its own motion by applying those rules only on locally available information, and totally scalable, in the sense that the amount of information processed by each agent and the computational complexity of the algorithms are not increasing with the number of agents in the scenario. The proposed policy applies to systems in which new vehicle may enter the scene and start interacting with existing ones at any time, while others may leave. Under mild conditions on the initial configurations, the policy is shown to be safe, i.e. to guarantee collision avoidance throughout the system evolution. In the paper, conditions are discussed on the desired configurations of agents under which the ultimate convergence of all vehicles to their goals can also be guaranteed. To show that such conditions are actually necessary and sufficient, which turns out to be a challenging liveness verification problem for a complex hybrid automaton, we employ a probabilistic verification method. The paper finally reports on simulations for systems of several tens of vehicles, and with some experimental implementation showing the practicality of the approach.
|Autori interni:||PALLOTTINO, LUCIA|
|Autori:||PALLOTTINO L.; SCORDIO V.G.; FRAZZOLI E.; BICCHI A.|
|Titolo:||Decentralized cooperative policy for conflict resolution in multi-vehicle systems|
|Anno del prodotto:||2007|
|Digital Object Identifier (DOI):||10.1109/TRO.2007.909810|
|Appare nelle tipologie:||1.1 Articolo in rivista|