{"title":"Vision-based Distributed Coordination and Flocking of Multi-agent Systems","authors":"N. Moshtagh, A. Jadbabaie, Kostas Daniilidis","doi":"10.15607/RSS.2005.I.006","DOIUrl":null,"url":null,"abstract":"We propose a biologically inspired, distributed coordination scheme based on nearest-neighbor interactions for a set of mobile kinematic agents equipped with vision sensors. It is assumed that each agent is only capable of measuring the following three quantities relative to each of its nearest neighbors (as defined by a proximity graph): time-to-collision, a single optical flow vector and relative bearing. We prove that the proposed distributed control law results in alignment of headings and flocking, even when the topology of the proximity graph representing the interconnection changes with time. It is shown that when the proximity graph is ”jointly connected” over time, flocking and velocity alignment will occur. Furthermore, the distributed control law can be extended to the case where the agents follow a leader. Under similar connectivity assumptions, we prove that the headings converge to that of the leader. Simulations are presented to demonstrate the effectiveness of this approach.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"124 1","pages":"41-48"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics science and systems : online proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15607/RSS.2005.I.006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26
Abstract
We propose a biologically inspired, distributed coordination scheme based on nearest-neighbor interactions for a set of mobile kinematic agents equipped with vision sensors. It is assumed that each agent is only capable of measuring the following three quantities relative to each of its nearest neighbors (as defined by a proximity graph): time-to-collision, a single optical flow vector and relative bearing. We prove that the proposed distributed control law results in alignment of headings and flocking, even when the topology of the proximity graph representing the interconnection changes with time. It is shown that when the proximity graph is ”jointly connected” over time, flocking and velocity alignment will occur. Furthermore, the distributed control law can be extended to the case where the agents follow a leader. Under similar connectivity assumptions, we prove that the headings converge to that of the leader. Simulations are presented to demonstrate the effectiveness of this approach.