DocumentCode :
2629276
Title :
The multi-agent rendezvous problem
Author :
Lin, J. ; Morse, A.S. ; Anderson, B.D.O.
Author_Institution :
Yale Univ., New Haven, CT, USA
Volume :
2
fYear :
2003
fDate :
9-12 Dec. 2003
Firstpage :
1508
Abstract :
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 any active communication between agents, cause all members of the group to eventually rendezvous at single unspecified location. This paper describes two types of strategies for solving the problem. The first consists of agent strategies, which are mutually synchronized, in the sense that all depend on a common clock. The second consists of strategies, which can be implemented independent of each other, without reference to a common clock.
Keywords :
cooperative systems; distributed control; mobile robots; multi-robot systems; position control; local control strategies; mobile autonomous agents; multiagent rendezvous problem; sensing region; Australia; Autonomous agents; Clocks; Communication system control; Computer aided software engineering; Councils; Government; Real time systems; Synchronization; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2003. Proceedings. 42nd IEEE Conference on
ISSN :
0191-2216
Print_ISBN :
0-7803-7924-1
Type :
conf
DOI :
10.1109/CDC.2003.1272825
Filename :
1272825
Link To Document :
بازگشت