The multi-agent rendezvous problem - The asynchronous case

J. Lin; A. S. Morse; B. D.O. Andersen

doi:10.1109/cdc.2004.1430329

The multi-agent rendezvous problem - The asynchronous case

J. Lin^*, A. S. Morse, B. D.O. Andersen

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

90 Citations (Scopus)

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 a family of asynchronously functioning strategies for solving the problem. Correctness is established appealing to the concept of "analytic synchronization.".

Original language	English
Article number	WeB03.3
Pages (from-to)	1926-1931
Number of pages	6
Journal	Proceedings of the IEEE Conference on Decision and Control
Volume	2
DOIs	https://doi.org/10.1109/cdc.2004.1430329
Publication status	Published - 2004
Event	2004 43rd IEEE Conference on Decision and Control (CDC) - Nassau, Bahamas Duration: 14 Dec 2004 → 17 Dec 2004

Access to Document

10.1109/cdc.2004.1430329

Cite this

@article{26ce5d00515b491aad2ece139c68df15,

title = "The multi-agent rendezvous problem - The asynchronous case",

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 a family of asynchronously functioning strategies for solving the problem. Correctness is established appealing to the concept of {"}analytic synchronization.{"}.",

author = "J. Lin and Morse, {A. S.} and Andersen, {B. D.O.}",

year = "2004",

doi = "10.1109/cdc.2004.1430329",

language = "English",

volume = "2",

pages = "1926--1931",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0743-1546",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2004 43rd IEEE Conference on Decision and Control (CDC) ; Conference date: 14-12-2004 Through 17-12-2004",

}

TY - JOUR

T1 - The multi-agent rendezvous problem - The asynchronous case

AU - Lin, J.

AU - Morse, A. S.

AU - Andersen, B. D.O.

PY - 2004

Y1 - 2004

N2 - 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 a family of asynchronously functioning strategies for solving the problem. Correctness is established appealing to the concept of "analytic synchronization.".

AB - 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 a family of asynchronously functioning strategies for solving the problem. Correctness is established appealing to the concept of "analytic synchronization.".

UR - http://www.scopus.com/inward/record.url?scp=14344251954&partnerID=8YFLogxK

U2 - 10.1109/cdc.2004.1430329

DO - 10.1109/cdc.2004.1430329

M3 - Conference article

AN - SCOPUS:14344251954

SN - 0743-1546

VL - 2

SP - 1926

EP - 1931

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

M1 - WeB03.3

T2 - 2004 43rd IEEE Conference on Decision and Control (CDC)

Y2 - 14 December 2004 through 17 December 2004

ER -

The multi-agent rendezvous problem - The asynchronous case

Abstract

Access to Document

Other files and links

Fingerprint

Cite this