@article {4134, title = {Provably Safe Multi-Robot Coordination With Unreliable Communication}, journal = {IEEE Robotics and Automation Letters}, volume = {4}, year = {2019}, pages = {3232-3239}, doi = {10.1109/LRA.2019.2924849}, author = {A. Mannucci and L. Pallottino and F. Pecora} } @conference {3531, title = {A Planning and Control System for Self-Driving Racing Vehicles}, booktitle = {2018 IEEE 4th International Forum on Research and Technology for Society and Industry (RTSI)}, year = {2018}, month = {Sept}, pages = {1-6}, address = {Palermo, Italy}, doi = {10.1109/RTSI.2018.8548444}, author = {D. Caporale and A. Fagiolini and L. Pallottino and A Settimi and A. Biondo and F. Amerotti and F. Massa and S. De Caro and A. Corti and L. Venturini} } @conference {PSFB07-ACC, title = {Probabilistic verification of decentralized multi-agent control strategies: a case study in conflict avoidance}, booktitle = {American Control Conference (ACC)}, year = {2007}, pages = {170-175}, abstract = {

Many challenging verification problems arise from complex hybrid automata that model decentralized control systems. As an example, we will consider decentralized policies that steer multiple vehicles in a shared environment: properties of safety and liveness, such as collision avoidance and ultimate convergence of all vehicles to their goals, must be verified. To formally verify the behavior of proposed policies, it is desired to identify the broadest class of start and goal configurations, such that safety and liveness would be guaranteed. Simple conditions are proposed to identify such a class: ideally, a formal proof that such conditions are necessary and sufficient for safety and liveness is requested. Unfortunately, in decentralized control frameworks classical approaches are difficult to apply. Hence, probabilistic verification method can be applied to quantify the accuracy and the confidence of the veridicity of the desired predicate. The probabilistic verification method is applied to a recently proposed cooperative and completely decentralized collision avoidance policy for non-holonomic vehicles.

}, keywords = {Embedded Control, Robotics}, author = {L. Pallottino and A. Bicchi and E. Frazzoli} } @conference {PSFB06, title = {Probabilistic verification of a decentralized policy for conflict resolution in multi-agent systems}, booktitle = {Proc. IEEE Int. Conf. on Robotics and Automation}, year = {2006}, note = {

Correct version

}, pages = {2448-2453}, abstract = {

In this paper, we consider a decentralized cooperative control policy proposed recently for steering multiple non-holonomic vehicles between assigned start and goal configurations while avoiding collisions. The policy is known to ensure safety (i.e., collision avoidance) for an arbitrarily large number of vehicles, if initial configurations satisfy certain conditions. The method is highly scalable, and effective solutions can be obtained for several tens of autonomous agents. On the other hand, the liveness property of the policy, i.e. the capability of negotiating a solution in finite time, is not yet completely understood. In this paper, we introduce a condition on the final vehicle configurations, which we conjecture to be sufficient for guaranteeing liveness. Because of the overwhelming complexity of proving the sufficiency of such condition, we assess the correctness of the conjecture in probability through the analysis of the results of a large number of randomized experiments.

}, keywords = {Embedded Control, Robotics}, author = {L. Pallottino and V. G. Scordio and E. Frazzoli and A. Bicchi} }