Second-order consensus protocols based on transformed d-path Laplacians
From MaRDI portal
Publication:2008188
DOI10.1016/J.AMC.2018.09.038zbMATH Open1428.93009OpenAlexW2896507458MaRDI QIDQ2008188FDOQ2008188
Authors: Mattia Frasca, Ernesto Estrada, Lucia Valentina Gambuzza 
Publication date: 22 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.09.038
Recommendations
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- The deformed consensus protocol
- Second-order consensus in multi-agent systems based on second-order neighbours’ information
- On the general consensus protocol in multiagent networks with double-integrator dynamics and coupling time delay
- Consensus of multiagent systems with directed topology and communication time delay bases on the Laplace transform
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Agent technology and artificial intelligence (68T42) Decentralized systems (93A14) Network protocols (68M12)
Cites Work
- Random Geometric Graphs
- Random Graphs
- Consensus and Cooperation in Networked Multi-Agent Systems
- Distributed Higher Order Consensus Protocols in Multiagent Dynamical Systems
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Finite-time consensus algorithm for multi-agent systems with double-integrator dynamics
- Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Consensus Algorithms for Double-Integrator Dynamics
- Complex networks: principles, methods and applications
- Delay robustness in consensus problems
- Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs
- Semi-global containment control of multi-agent systems with intermittent input saturation
- Distributed robust consensus control of multi-agent systems with heterogeneous matching uncertainties
- Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
- Encyclopedia of Distances
- Adaptive Consensus of Multi-Agent Systems With Unknown Identical Control Directions Based on A Novel Nussbaum-Type Function
- Finite-time consensus of second-order multi-agent systems via a structural approach
- Second-order consensus for multi-agent systems with switching topology and communication delay
- Consensus of Multi-Agent Systems With Diverse Input and Communication Delays
- Three-dimensional alpha shapes
- Adaptive synchronization of complex networks
- Random geometric graph diameter in the unit ball
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- On the consensus protocol of conspecific agents
- Consensus of a Class of Second-Order Multi-Agent Systems With Time-Delay and Jointly-Connected Topologies
- Wireless Sensor Networks
- Direct method for TDS stability analysis
- The internet of things: a survey
- Consensus conditions for general second-order multi-agent systems with communication delay
- Markov chain methods for analyzing urban networks
- Path Laplacian operators and superdiffusive processes on graphs. II. two-dimensional lattice
- Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case
- Consensus stability of a class of second-order multi-agent systems with nonuniform time-delays
- On the relation between graph distance and Euclidean distance in random geometric graphs
- Long-range interactions and network synchronization
Cited In (5)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- A generalization of the graph Laplacian with application to a distributed consensus algorithm
- Weight allocation in Laplacian matrix of random networks based on geodesic distances
- On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems
- Second-order min-consensus on switching topology
This page was built for publication: Second-order consensus protocols based on transformed \(d\)-path Laplacians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008188)
