The Multi-Agent Rendezvous Problem: The Asynchronous Case
This paper is concerned with the collective behavior of a group of n > 1 mobile autonomous agents, labelled 1 through n, which can all move in the plane. Each agent is able to continuously track the positions of all other agents currently within its "sensing region" where by an agent's sensing region is meant a closed disk of positive radius r centered at the agent's current position. The multi-agent rendezvous problem is to devise "local" control strategies, one for each agent, which without...[Show more]
|Collections||ANU Research Publications|
|Source:||IEEE Conference on Decision and Control Proceedings 2004|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.