Distributed constraint optimization with flocking behavior (Q1723073): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2018/1579865 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2905198848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Subgradient Methods for Multi-Agent Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization for Linear Multiagent Systems: Edge- and Node-Based Adaptive Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive distributed convex optimization for multi-agent and its application in flocking behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Consensus and Optimization in Multi-Agent Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distributed Convex Optimization Under Inequality and Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed constrained optimal consensus of multi-agent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Continuous-Time Optimization: Nonuniform Gradient Gains, Finite-Time Convergence, and Convex Constraint Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second-Order Multi-Agent Network for Bound-Constrained Distributed Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flocking in Fixed and Switching Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flocking of multi-agents with nonlinear inner-coupling functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank

Latest revision as of 07:47, 18 July 2024

scientific article
Language Label Description Also known as
English
Distributed constraint optimization with flocking behavior
scientific article

    Statements

    Distributed constraint optimization with flocking behavior (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 February 2019
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references