Advertisement
Published in:
2005 | OriginalPaper | Chapter
The Multi-Agent Rendezvous Problem. An Extended Summary
Authors : J. Lin, A.S. Morse, B.D.O. Anderson
Published in: Cooperative Control
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 describe 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 independently of each other, without reference to a common clock.