Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain
The aim of this paper is to develop a computationally efficient decentralized rendezvous algorithm for a group of autonomous agents. The algorithm generalizes the notion of sensor domain and decision domain of agents to enable implementation of simple computational algorithms. Specifically, the algorithm proposed in this paper uses a rectilinear decision domain (RDD) as against the circular decision domain assumed in earlier work. Because of this, the computational complexity of the algorithm reduces considerably and, when compared to the standard Ando’s algorithm available in the literature, the RDD algorithm shows very significant improvement in convergence time performance. Analytical results to prove convergence and supporting simulation results are presented in the paper.
KeywordsMulti-agent Rendezvous Decision domain Consensus
Unable to display preview. Download preview PDF.
- 4.Lin, J., Morse, A.S., Anderson, B.D.O.: The Multi-Agent Rendezvous problem. In: Conference on Decesion & Control, Maui, Hawaii, USA, pp. 1508–1513 (2003)Google Scholar
- 6.Das, K., Ghose, D.: Positional Consensus in Multi-Agent Systems using a Broadcast Control Mechanism. In: American Control Conference, St. louis, Missouri, USA, pp. 5731–5736 (2009)Google Scholar
- 7.Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1972)Google Scholar