Finite-time connectivity preservation rendezvous with disturbance rejection
From MaRDI portal
Publication:313166
DOI10.1016/J.AUTOMATICA.2016.04.032zbMATH Open1343.93005OpenAlexW2416726102MaRDI QIDQ313166FDOQ313166
Publication date: 9 September 2016
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2016.04.032
Recommendations
- Finite-time rendezvous control of multi-agent networks with preserving topology connectivity
- A connectivity preserving rendezvous for unicycle agents with heterogenous input disturbances
- Connectivity preservation for multi-agent rendezvous with link failure
- Leader-following rendezvous with connectivity preservation and disturbance rejection via internal model approach
- Connectivity-preserving rendezvous of heterogeneous multi-agent systems under denial-of-service attacks
Applications of graph theory (05C90) Sensitivity (robustness) (93B35) Agent technology and artificial intelligence (68T42) Decentralized systems (93A14)
Cites Work
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Finite-Time Stability of Continuous Autonomous Systems
- On the Rendezvous Problem for Multiple Nonholonomic Agents
- Coordination and Geometric Optimization via Distributed Dynamical Systems
- Rendezvous of multiple mobile agents with preserved network connectivity
- A calculus for computing Filippov's differential inclusion with application to the variable structure control of robot manipulators
- Stability and Stabilization of Discontinuous Systems and Nonsmooth Lyapunov Functions
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
- Connectivity preservation for multi-agent rendezvous with link failure
- Finite-Time Consensus With Disturbance Rejection by Discontinuous Local Interactions in Directed Graphs
- Leader-Following Connectivity Preservation Rendezvous of Multiple Double Integrator Systems Based on Position Measurement Only
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- Finite-Time Rendezvous Algorithms for Mobile Autonomous Agents
- A novel approach to coordination of multiple robots with communication failures via proximity graph
- Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
Cited In (10)
- Robust fixed-time connectivity-preserving consensus for second-order multi-agent systems with external disturbances
- Rendezvous of multiple mobile agents with preserved network connectivity
- Robust finite-time connectivity preserving coordination of second-order multi-agent systems
- Connectivity-preserving-based distributed adaptive asymptotically synchronised tracking of networked uncertain nonholonomic mobile robots with actuator failures and unknown control directions
- Global regulation of large‐scale nonlinear systems via decentralized output‐feedback switching control
- Connectivity-preserving approximation-free design for synchronized tracking of uncertain networked nonaffine nonlinear multi-agent systems
- Connectivity-preserving flocking for networked Lagrange systems with time-varying actuator faults
- Connectivity-maintaining and collision-avoiding performance function approach for robust leader-follower formation control of multiple uncertain underactuated surface vessels
- Connectivity-preserving rendezvous of heterogeneous multi-agent systems under denial-of-service attacks
- Guaranteed-connectivity-based distributed robust event-triggered tracking of multiple underactuated surface vessels with uncertain nonlinear dynamics
This page was built for publication: Finite-time connectivity preservation rendezvous with disturbance rejection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313166)
