Distributed continuous-time approximate projection protocols for shortest distance optimization problems

DOI10.1016/J.AUTOMATICA.2016.02.019zbMATH Open1338.93026OpenAlexW2963074062MaRDI QIDQ286313FDOQ286313

Authors: Youcheng Lou, Yiguang Hong, Shouyang Wang 

Publication date: 20 May 2016

Published in: Automatica (Search for Journal in Brave)

Abstract: In this paper, we investigate the distributed shortest distance optimization problem for a multi-agent network to cooperatively minimize the sum of the quadratic distances from some convex sets, where each set is only associated with one agent. To deal with the optimization problem with projection uncertainties, we propose a distributed continuous-time dynamical protocol based on a new concept of approximate projection. Here each agent can only obtain an approximate projection point on the boundary of its convex set, and communicate with its neighbors over a time-varying communication graph. First, we show that no matter how large the approximate angle is, the system states are always bounded for any initial condition, and uniformly bounded with respect to all initial conditions if the inferior limit of the stepsize is greater than zero. Then, in the two cases, nonempty intersection and empty intersection of convex sets, we provide stepsize and approximate angle conditions to ensure the optimal convergence, respectively. Moreover, we give some characterizations about the optimal solutions for the empty intersection case and also present the convergence error between agents' estimates and the optimal point in the case of constant stepsizes and approximate angles.

Full work available at URL: https://arxiv.org/abs/1503.04904

Recommendations

• A new algorithm for distributed control problem with shortest-distance constraints
• Distributed optimization with closed convex set for multi-agent networks over directed graphs
• Distributed constrained optimal consensus of multi-agent systems
• Continuous-time distributed optimization with strictly pseudoconvex objective functions
• Distributed optimization for continuous-time multi-agent systems with external disturbance and discrete-time communication

zbMATH Keywords

approximate projectionconvex intersectiondistributed optimizationshortest distance optimization

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Agent technology and artificial intelligence (68T42) Decentralized systems (93A14)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
• Approximate Projected Consensus for Convex Intersection Computation: Convergence Analysis and Critical Error Angle
• Constrained Consensus and Optimization in Multi-Agent Networks
• Convergence of random sleep algorithms for optimal consensus
• Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication
• Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
• Distributed Subgradient Methods for Multi-Agent Optimization
• Distributed convergence to Nash equilibria in two-network zero-sum games
• Gossip Algorithms for Convex Consensus Optimization Over Networks
• Handbook of global optimization. Vol. 2
• Randomized optimal consensus of multi-agent systems
• Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
• Robust consensus for continuous-time multiagent dynamics
• State Constraints in Convex Control Problems of Bolza
• The Theory of Max-Min, with Applications
• The method of projections for finding the common point of convex sets
• Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case

Cited In (16)

• Distributed second-order multi-agent constrained optimization algorithm with time-varying cost function
• Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
• Distributed optimisation based on multi-agent system for resource allocation with communication time-delay
• Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks
• Distributed resource allocation of second‐order nonlinear multiagent systems
• A new algorithm for distributed control problem with shortest-distance constraints
• Distributed dual averaging algorithm for multi-agent optimization with coupled constraints.
• Distributed formation-aggregation control algorithm for a cluster of quadrotors
• A multi-scale method for distributed convex optimization with constraints
• Distributed optimization of general linear multi-agent systems with external disturbance
• Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
• Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
• Adaptive distributed convex optimization for multi-agent and its application in flocking behavior
• Distributed optimization with hybrid linear constraints for multi‐agent networks
• Distributed constrained optimization via continuous-time mirror design
• Distributed continuous-time algorithm for nonsmooth optimal consensus without sharing local decision variables

This page was built for publication: Distributed continuous-time approximate projection protocols for shortest distance optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286313)