A Connectivity Preserving Framework for Distributed Motion Coordination in Proximity Networks
Online Publication Date2018-08-17
Print Publication Date2018-06
Permanent link to this recordhttp://hdl.handle.net/10754/630506
MetadataShow full item record
AbstractA necessary condition for global performance guarantees in most of the motion coordination algorithms is connectivity of the underlying network topology. In proximity networks, connectivity maintenance becomes critical because the neighborhood set of each agent is dynamic and depends on the locations of all the other agents in the network. We present an efficient framework for distributed motion coordination in proximity networks. The proposed framework relies on identifying agents in a so called weakly connected dominating (WCD) set of the underlying network graph. Maintaining only the edges incident to the agents in WCD, which we call as critical edges, preserves the connectivity of the overall network. The proposed framework is presented in the context of rendezvous problem, which is selected because of its canonical importance in distributed systems with mobile agents. We propose a controller that drives all the agents to a common point by preserving the critical edges only. The proposed scheme is robust to failure of edges that are not critical and nodes that do not belong to WCD. Moreover, it performs well in terms of energy consumption and computational complexity.
CitationJaleel H, Abbas W (2018) A Connectivity Preserving Framework for Distributed Motion Coordination in Proximity Networks. 2018 Annual American Control Conference (ACC). Available: http://dx.doi.org/10.23919/acc.2018.8431056.
Conference/Event name2018 Annual American Control Conference, ACC 2018