Combination framework of rendezvous algorithm for multi-agent systems with limited sensing ranges
From MaRDI portal
Publication:3018567
DOI10.1002/asjc.178zbMath1222.93008OpenAlexW2153000640MaRDI QIDQ3018567
Yuan Fan, Yong Wang, Gang Feng
Publication date: 27 July 2011
Published in: Asian Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/asjc.178
convex combinationgraph theorymulti-agent systemscooperative controldecentralized rendezvous algorithms
Related Items (17)
Consensus Problem with a Reference State for Fractional‐Order Multi‐Agent Systems ⋮ Decentralized Dynamic Coverage Control for Mobile Sensor Networks in a Non-convex Environment ⋮ Bio-entity network for analysis of protein-protein interaction networks ⋮ Consensus of data-sampled multi-agent systems with Markovian switching topologies ⋮ Formation control of multiple elliptic agents with limited sensing ranges ⋮ Fast distributed consensus seeking in large-scale and high-density multi-agent systems with connectivity maintenance ⋮ On the Role of Homogeneity When Controlling Single‐Leader Networks ⋮ An Adaptive Coverage Control for Deployment of Nonholonomic Mobile Sensor Networks Over Time‐Varying Sensory Functions ⋮ Continuous Action Generation of Q‐Learning in Multi‐Agent Cooperation ⋮ Adaptive Flocking Control with a Minority of Informed Agents ⋮ Consensus analysis of continuous‐time second‐order multi‐agent systems with nonuniform time‐delays and switching topologies ⋮ <scp>r</scp>‐consensus control for higher‐order multi‐agent systems with digraph ⋮ Quantized tracking control for a multi‐agent system with high‐order leader dynamics ⋮ Nonlinear Consensus Algorithms with Uncertain Couplings ⋮ Social Learning in Networks with Time‐Varying Topologies ⋮ Consensus for linear multi-agent system with intermittent information transmissions using the time-scale theory ⋮ UAV Path Planning in Mixed-Obstacle Environment via Artificial Potential Field Method Improved by Additional Control Force
Cites Work
- Fast linear iterations for distributed averaging
- Spatially-distributed coverage optimization and control with limited-range interactions
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Consensus and Cooperation in Networked Multi-Agent Systems
- Formation Reorganization by Primitive Operations on Directed Graphs
- Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
- Agreeing Asynchronously
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Stability analysis of M-dimensional asynchronous swarms with a fixed communication topology
- Local Control Strategies for Groups of Mobile Autonomous Agents
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
- Flocking in Fixed and Switching Networks
- On the Rendezvous Problem for Multiple Nonholonomic Agents
- Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots
- A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements
This page was built for publication: Combination framework of rendezvous algorithm for multi-agent systems with limited sensing ranges
