Laplacian Sheep: A Hybrid, Stop-Go Policy for Leader-Based Containment Control
Author(s) -
Giancarlo FerrariTrecate,
Magnus Egerstedt,
Annalisa Buffa,
M. Ji
Publication year - 2006
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-33170-0
DOI - 10.1007/11730637_18
Subject(s) - containment (computer programming) , computer science , context (archaeology) , laplacian matrix , laplace operator , regular polygon , polytope , graph , robot , control (management) , adversary , mathematical optimization , computer security , theoretical computer science , mathematics , artificial intelligence , discrete mathematics , paleontology , mathematical analysis , geometry , biology , programming language
The problem of driving a collection of mobile robots to a given target location is studied in the context of partial difference equations. In particular, we are interested in achieving this transfer while ensuring that the agents stay in the convex polytope spanned by dedicated leader-agents, whose dynamics will be given by a hybrid Stop-Go policy. The resulting system ensures containment through the enabling result that under a Laplacian, decentralized control strategy for the followers, these followers will converge to a location in the convex leader polytope, as long as the leaders are stationary and the interaction graph is connected. Simulation results testify to the viability of the proposed, hybrid control strategy.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom