The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
From MaRDI portal
Publication:3544229
DOI10.1137/040620552zbMath1149.93023OpenAlexW4241000863MaRDI QIDQ3544229
Jie Lin, A. Stephen Morse, Brian D. O. Anderson
Publication date: 5 December 2008
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040620552
Discrete-time control/observation systems (93C55) Automated systems (robots, etc.) in control theory (93C85) Discrete event control/observation systems (93C65)
Related Items (33)
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ Finite-time tracking control of multiple nonholonomic mobile robots ⋮ Finite-time connectivity preservation rendezvous with disturbance rejection ⋮ An internal model approach for multi-agent rendezvous and connectivity preservation with nonlinear dynamics ⋮ Event-triggered control for multi-agent network with limited digital communication ⋮ Asymptotic behaviour of coupled systems in discrete and continuous time ⋮ A discrete and continuous study of the \textsc{Max-Chain-Formation} problem ⋮ Gathering problems for autonomous mobile robots with lights ⋮ On bifurcations in nonlinear consensus networks ⋮ Rendezvous of Asynchronous Mobile Robots with Lights ⋮ Ten Open Problems in Rendezvous Search ⋮ Connectivity preservation for multi-agent rendezvous with link failure ⋮ A novel approach to coordination of multiple robots with communication failures via proximity graph ⋮ Distributed algorithms for reaching consensus on general functions ⋮ Computing by Mobile Robotic Sensors ⋮ Problems and methods of network control ⋮ Arbitrary pattern formation by asynchronous, anonymous, oblivious robots ⋮ Combination framework of rendezvous algorithm for multi-agent systems with limited sensing ranges ⋮ Visibility maintenance via controlled invariance for leader-follower vehicle formations ⋮ Nonlinear Consensus Algorithms with Uncertain Couplings ⋮ Rendezvous of multiple mobile agents with preserved network connectivity ⋮ Finite-time semistability, Filippov systems, and consensus protocols for nonlinear dynamical networks with switching topologies ⋮ Observer design via immersion and invariance for vision-based leader-follower formation control ⋮ Unnamed Item ⋮ Gathering in dynamic rings ⋮ Rendezvous with constant memory ⋮ Distributed Tree Rearrangements for Reachability and Robust Connectivity ⋮ Near-gathering of energy-constrained mobile agents ⋮ Event-Triggered Control for Multi-Agent Systems with General Directed Topology and Time Delays ⋮ Delay Robustness of Nonlinear Consensus Protocols: Analytic Criteria ⋮ Practical multiagent rendezvous through modified circumcenter algorithms ⋮ On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous ⋮ Rendezvous of Two Robots with Constant Memory
This page was built for publication: The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
