Das, Kaushik and Ghose, Debasish (2010) Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain. In: 13th Federation-of-International-Robot-soccer-Association Robot World Congress, SEP 15-17, 2010 , Amirit Vishwa Vidyapeetham, Bangalore, INDIA, pp. 162-169.Full text not available from this repository.
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Mechanical Sciences > Aerospace Engineering (Formerly, Aeronautical Engineering)
|Date Deposited:||08 Apr 2011 07:19|
|Last Modified:||08 Apr 2011 07:19|
Actions (login required)