A note on the deployment of kinematic agents by binary information
Claudio De Persis, Ming Cao, Francesca Ceragioli · 2011
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.