The problem of deploying continuous-time kinematic agents on a line is considered. To achieve the prescribed formation each agent uses a binary information, namely whether the distance of the agent from a neighbor is below or above the prescribed inter-agent distance. A simple control law which achieves and maintains the formation despite the coarse information available is designed. © 2011 IEEE.
A note on the deployment of kinematic agents by binary information / DE PERSIS, Claudio; M., Cao; F., Ceragioli. - (2011), pp. 2487-2492. (Intervento presentato al convegno 50th IEEE Conference on Decision and Control and European Control Conference tenutosi a Orlando; United States nel December 2011) [10.1109/CDC.2011.6160576].
A note on the deployment of kinematic agents by binary information
DE PERSIS, Claudio;
2011
Abstract
The problem of deploying continuous-time kinematic agents on a line is considered. To achieve the prescribed formation each agent uses a binary information, namely whether the distance of the agent from a neighbor is below or above the prescribed inter-agent distance. A simple control law which achieves and maintains the formation despite the coarse information available is designed. © 2011 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
