Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Decentralized Control of Parallel Rigid Formations with Direction Constraints and Bearing Measurements

MPG-Autoren
/persons/resource/persons83915

Franchi,  A
Department Human Perception, Cognition and Action, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

/persons/resource/persons84174

Robuffo Giordano,  P
Department Human Perception, Cognition and Action, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte in PuRe verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Franchi, A., & Robuffo Giordano, P. (2012). Decentralized Control of Parallel Rigid Formations with Direction Constraints and Bearing Measurements. In 51th IEEE Conference on Decision and Control (CDC 2012) (pp. 5310-5317). Piscataway, NJ, USA: IEEE.


Zitierlink: https://hdl.handle.net/11858/00-001M-0000-0013-B54C-7
Zusammenfassung
In this paper we analyze the relationship between scalability, minimality and rigidity, and its application to cooperative control. As a case study, we address the problem of multi-agent formation control by proposing a distributed control strategy that stabilizes a formation described with bearing (direction) constraints, and that only requires bearing measurements and parallel rigidity of the interaction graph. We also consider the possibility of having different graphs modeling the interaction network in order to explicitly take into account the conceptual difference between sensing, communication, control, and parameters stored in the network. We then show how the information can be ‘moved’ from a graph to another making use of decentralized estimation, provided the parallel rigidity property. Finally we present simulative examples in order to show the validity of the theoretical analysis in some illustrative cases.