This paper studies the connectivity maintenance problem in linear and nonlinear cyclic pursuit, when different control gains are assigned to each agent. Feasibility/infeasibility conditions for this problem are established in both the linear and nonlinear scenarios using geometric arguments. These conditions elucidate the role played by the control gains, initial conditions and communication radius of the agents, on the connectivity of the robotic network. ©2010 IEEE.
Morbidi, F., Giannitrapani, A., Prattichizzo, D. (2010). Maintaining connectivity among multiple agents in cyclic pursuit: a geometric approach. In Proceedings of the 49th IEEE Conference on Decision and Control (pp.7461-7466). New York : IEEE [10.1109/CDC.2010.5717945].
Maintaining connectivity among multiple agents in cyclic pursuit: a geometric approach
MORBIDI F.;GIANNITRAPANI A.;PRATTICHIZZO D.
2010-01-01
Abstract
This paper studies the connectivity maintenance problem in linear and nonlinear cyclic pursuit, when different control gains are assigned to each agent. Feasibility/infeasibility conditions for this problem are established in both the linear and nonlinear scenarios using geometric arguments. These conditions elucidate the role played by the control gains, initial conditions and communication radius of the agents, on the connectivity of the robotic network. ©2010 IEEE.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/18359
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo