Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain
- Cite this paper as:
- Das K., Ghose D. (2010) Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain. In: Vadakkepat P. et al. (eds) Trends in Intelligent Robotics. FIRA 2010. Communications in Computer and Information Science, vol 103. Springer, Berlin, Heidelberg
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.