Distributed constraint optimization with flocking behavior
Summary: This paper studies distributed optimization having flocking behavior and local constraint set. Multiagent systems with continuous-time and second-order dynamics are studied. Each agent has a local constraint set and a local objective function, which are known to only one agent. The objective is for multiple agents to optimize a sum of the local functions with local interaction and information. First, a bounded potential function to construct the controller is given and a distributed optimization algorithm that makes a group of agents avoid collisions during the evolution is presented. Then, it is proved that all agents track the optimal velocity while avoiding collisions. The proof of the main result is divided into three steps: global set convergence, consensus analysis, and optimal set convergence. Finally, a simulation is included to illustrate the results.
- Distributed optimization for adaptive flocking of multi-agent systems
- Distributed velocity optimization of time-varying functions with flocking behavior
- Adaptive distributed convex optimization for multi-agent and its application in flocking behavior
- Distributed constrained optimization for multi-agent networks with nonsmooth objective functions
- Distributed model predictive control for multi-agent flocking via neighbor screening optimization
- A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements
- A Second-Order Multi-Agent Network for Bound-Constrained Distributed Optimization
- Adaptive distributed convex optimization for multi-agent and its application in flocking behavior
- Constrained Consensus and Optimization in Multi-Agent Networks
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Distributed constrained optimal consensus of multi-agent systems
- Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
- Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
- Distributed Continuous-Time Optimization: Nonuniform Gradient Gains, Finite-Time Convergence, and Convex Constraint Set
- Distributed Optimization for Linear Multiagent Systems: Edge- and Node-Based Adaptive Designs
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
- Distributed Subgradient Methods for Multi-Agent Optimization
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Flocking in Fixed and Switching Networks
- Flocking of multi-agents with nonlinear inner-coupling functions
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Adaptive distributed convex optimization for multi-agent and its application in flocking behavior
- Distributed velocity optimization of time-varying functions with flocking behavior
- A flocking-based approach for distributed stochastic optimization
- Distributed optimization for adaptive flocking of multi-agent systems
- Distributed model predictive control for multi-agent flocking via neighbor screening optimization
- Multi-agent flocking control with complex obstacles and adaptive distributed convex optimization
This page was built for publication: Distributed constraint optimization with flocking behavior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1723073)
