Distributed linear programming with event-triggered communication
From MaRDI portal
distributed algorithmsevent-triggered communicationhybrid systemslinear programmingmultiagent systems
Numerical optimization and variational techniques (65K10) Distributed systems (68M14) Linear programming (90C05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Discrete event control/observation systems (93C65)
Abstract: We consider a network of agents whose objective is for the aggregate of their states to converge to a solution of a linear program in standard form. Each agent has limited information about the problem data and can communicate with other agents at discrete time instants of their choosing. Our main contribution is the synthesis of a distributed dynamics and a set of state-based rules, termed triggers, that individual agents use to determine when to opportunistically broadcast their state to neighboring agents to ensure asymptotic convergence to a solution of the linear program. Our technical approach to the algorithm design and analysis overcomes a number of challenges, including establishing convergence in the absence of a common smooth Lyapunov function, ensuring that the triggers are detectable by agents using only local information, accounting for asynchronism in the state broadcasts, and ruling out various causes of arbitrarily fast state broadcasting. Various simulations illustrate our results.
Recommendations
- Stateless distributed gradient descent for positive linear programs
- A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
- Event-triggered discrete-time distributed consensus optimization over time-varying graphs
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
Cites work
- A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
- An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
- Asymptotic convergence of constrained primal-dual dynamics
- Decentralized Event-Triggered Control Over Wireless Sensor/Actuator Networks
- Distributed algorithms for reaching consensus on general functions
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Distributed Subgradient Methods for Multi-Agent Optimization
- Event-Triggering in Distributed Networked Control Systems
- scientific article; zbMATH DE number 6508162 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- Hybrid dynamical systems
- Hybrid dynamical systems. Modeling, stability, and robustness
- Matrix Analysis
- Nonlinear Perturbation of Linear Programs
- Parallel synchronous and asynchronous implementations of the auction algorithm
- Robust Distributed Linear Programming
- Stability of primal-dual gradient dynamics and applications to network optimization
- Switching in systems and control
- Uniform Stability of Switched Linear Systems: Extensions of LaSalle's Invariance Principle
Cited in
(8)- A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
- Noise-induced consensus of leader-following multi-agent systems
- Event-triggered communication and control of networked systems for multi-agent consensus
- Opportunistic robot control for interactive multiobjective optimization under human performance limitations
- Stateless distributed gradient descent for positive linear programs
- Dynamic Event-Triggered Leader-Follower Consensus Control for MultiAgent Systems
- Distributed event-triggered algorithm for unconstrained convex optimisation over weight-balanced directed networks
- Distributed gradient descent method with edge-based event-driven communication for non-convex optimization
This page was built for publication: Distributed linear programming with event-triggered communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178441)
