The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
From MaRDI portal
Publication:3544229
DOI10.1137/040620552zbMATH Open1149.93023OpenAlexW4241000863MaRDI QIDQ3544229FDOQ3544229
Authors: 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
Recommendations
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- On the Rendezvous Problem for Multiple Nonholonomic Agents
- scientific article; zbMATH DE number 2102782
- On deterministic rendezvous at a node of agents with arbitrary velocities
- An Approach to Multi-agent Systems as a Generalized Multi-synchronization Problem
- Practical multiagent rendezvous through modified circumcenter algorithms
- Résolution du problème du multi-rendezvous à l'aide d'un modèle d'algorithme distribué
- Space-optimal rendezvous of mobile agents in asynchronous trees
- Self-stabilizing rendezvous of synchronous mobile agents in graphs
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Discrete-time control/observation systems (93C55) Discrete event control/observation systems (93C65) Automated systems (robots, etc.) in control theory (93C85)
Cited In (43)
- Gathering in dynamic rings
- State Agreement for Continuous‐Time Coupled Nonlinear Systems
- Delay robustness of nonlinear consensus protocols: analytic criteria
- On bifurcations in nonlinear consensus networks
- Computing by mobile robotic sensors
- Distributed Tree Rearrangements for Reachability and Robust Connectivity
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Observer design via immersion and invariance for vision-based leader-follower formation control
- Title not available (Why is that?)
- Rendezvous with constant memory
- Synchronization of beads on a ring by feedback control
- Rendezvous of two robots with constant memory
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- Rendezvous of multiple mobile agents with preserved network connectivity
- Connectivity preservation for multi-agent rendezvous with link failure
- Asymptotic behaviour of coupled systems in discrete and continuous time
- Event-triggered control for multi-agent systems with general directed topology and time delays
- Combination framework of rendezvous algorithm for multi-agent systems with limited sensing ranges
- Finite-time connectivity preservation rendezvous with disturbance rejection
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Near-gathering of energy-constrained mobile agents
- Practical multiagent rendezvous through modified circumcenter algorithms
- A novel approach to coordination of multiple robots with communication failures via proximity graph
- Rendezvous of multi-agent double integrator systems with noise disturbed observations
- Event-triggered control for multi-agent network with limited digital communication
- Finite-time semistability, Filippov systems, and consensus protocols for nonlinear dynamical networks with switching topologies
- Asynchronous rendezvous analysis via set-valued consensus theory
- Ten Open Problems in Rendezvous Search
- Title not available (Why is that?)
- A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
- Title not available (Why is that?)
- Résolution du problème du multi-rendezvous à l'aide d'un modèle d'algorithme distribué
- Distributed algorithms for reaching consensus on general functions
- Visibility maintenance via controlled invariance for leader-follower vehicle formations
- An internal model approach for multi-agent rendezvous and connectivity preservation with nonlinear dynamics
- Gathering problems for autonomous mobile robots with lights
- Rendezvous analysis and control design for multiple mobile agents with preserved network connectivity on hyperboloid
- Nonlinear consensus algorithms with uncertain couplings
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- Rendezvous of Asynchronous Mobile Robots with Lights
- Problems and methods of network control
- Asymptotic behaviour in the robot rendezvous problem
- Finite-time tracking control of multiple nonholonomic mobile robots
This page was built for publication: The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544229)
