Combination framework of rendezvous algorithm for multi-agent systems with limited sensing ranges

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

32 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)283-294
Journal / PublicationAsian Journal of Control
Volume13
Issue number2
Publication statusPublished - Mar 2011

Abstract

In this paper, we present a novel rendezvous algorithm framework - the combination framework, which is named after the term convex combination in computational geometry. The convergence of the proposed algorithms is proved based on the novel tools from the recent results in graph theory and consensus study. It has been observed that the circumcenter algorithm can be considered as a special case of the combination framework. Moreover, the relevant analysis provides us a novel viewpoint on designing and the rendezvous rate of rendezvous algorithms for networked multi-agent systems with limited sensing ranges. © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society.

Research Area(s)

  • Convex combination, Cooperative control, Decentralized rendezvous algorithms, Graph theory, Multi-agent systems