The multi-agent rendezvous problem - The asynchronous case

Proceedings of the IEEE Conference on Decision and Control

Volumn 2, Issue , 2004, Pages 1926-1931

  Lin, J ^a   Morse, A S ^a   Andersen, B D O ^b  

^a YALE UNIVERSITY   (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; CONSTRAINT THEORY; DISCRETE TIME CONTROL SYSTEMS; MATHEMATICAL MODELS; MULTI AGENT SYSTEMS; SET THEORY;

ASYNCHRONOUS AGENT SYSTEM; DISTRIBUTED CONTROL ALGORITHMS; MOBILE AUTONOMOUS AGENTS; SYNCHRONOUS DISCRETE-TIME DYNAMICAL SYSTEM;

PROBLEM SOLVING;

EID: 14344251954     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1430329     Document Type: Conference Paper

References (3)

1. H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita. Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation, pages 818-828, oct 1999.
2. J. Lin, A. S. Morse, and B. D. O. Anderson. The multi-agent rendezvous problem. In Proc 2003 CDC, pages 1508-1513, dec 2003.
3. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation. Prentics Hall, 1989.