Faster response in bounded-update-rate, discrete-time linear networks using delayed self-reinforcement
From MaRDI portal
Publication:5157939
Abstract: The response speed of a network impacts the efficacy of its actions to external stimuli. However, for a given bound on the update rate, the network-response speed is limited by the need to maintain stability. This work increases the network-response speed without having to increase the update rate by using delayed self-reinforcement (DSR), where each agent uses its already available information from the network to strengthen its individual update law. Example simulation results are presented that show more than an order of magnitude improvement in the response speed (quantified using the settling time) with the proposed DSR approach.
Recommendations
- Cohesive networks using delayed self reinforcement
- Impact of noise structure and network topology on tracking speed of neural networks
- On fast-slow consensus networks with a dynamic weight
- Accelerating average consensus by using the information of second-order neighbours with communication delays
- On the model-based control of networked systems
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 4067100 (Why is no real title available?)
- A new class of consensus protocols for agent networks with discrete time dynamics
- Communication constraints in the average consensus problem
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Consensus-based distributed cooperative learning control for a group of discrete-time nonlinear multi-agent systems using neural networks
- Consensusability of discrete-time linear multi-agent systems over analog fading networks
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Fastest Mixing Markov Chain on a Graph
- Fault detection and isolation of discrete-time Markovian jump linear systems with application to a network of multi-agent systems having imperfect communication channels
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Flocking of networked mechanical systems on directed topologies: a new perspective
- Global Exponential Stability for Discrete-Time Networks With Applications to Traffic Networks
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems
- Quantised consensus by using the PD-like protocols in directed networks
- Robust cooperative output tracking of networked high-order power integrators systems
- Robust pinning control of heterogeneous complex networks with jointly connected topologies and time-varying parametric uncertainty
- Robust two-mode-dependent controller design for networked control systems with random delays modelled by Markov chains
- Supervisory Control of Networked Timed Discrete Event Systems and Its Applications to Power Distribution Networks
- Synthesis of Distributed Robust H-Infinity Controllers for Interconnected Discrete Time Systems
- Transcale average consensus of directed multi-vehicle networks with fixed and switching topologies
This page was built for publication: Faster response in bounded-update-rate, discrete-time linear networks using delayed self-reinforcement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157939)
