A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm
From MaRDI portal
Publication:2059483
DOI10.1016/J.SYSCONLE.2021.105045OpenAlexW3206347113MaRDI QIDQ2059483
Publication date: 14 December 2021
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2021.105045
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Lifelong planning \(\text{A}^*\)
- Opinion consensus under external influences
- Finite-Time Connectivity-Preserving Consensus of Networked Nonlinear Agents With Unknown Lipschitz Terms
- Small Gain Theorems for Large Scale Systems and Construction of ISS Lyapunov Functions
- On a routing problem
- Decomposition techniques for large-scale systems with nonadditive interactions: Stability and stabilizability
- Distributed Biased Min-Consensus With Applications to Shortest Path Planning
- Stochastic Online Shortest Path Routing: The Value of Feedback
- Analysis of Max-Consensus Algorithms in Wireless Channels
- Asynchronous Max-Consensus Protocol With Time Delays: Convergence Results and Applications
- Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds
- Passivity as a Design Tool for Group Coordination
- Consensus in Directed Networks of Agents With Nonlinear Dynamics
- Control of Minimally Persistent Leader-Remote-Follower and Coleader Formations in the Plane
- A Beamlet-Based Graph Structure for Path Planning Using Multiscale Information
This page was built for publication: A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm
