A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
A projection-based continuous-time algorithm for distributed optimization over multi-agent systems
2021
Complex & Intelligent Systems
Preserved Fulltext
This paper presents a projection-based continuous-time algorithm for solving convex distributed optimization problem with equality and inequality constraints over multi-agent systems. ...
Recently, distributed optimization problem over multi-agent systems has drawn much attention because of its extensive applications. ...
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long ...
doi:10.1007/s40747-020-00265-x
fatcat:z6mk5n6qp5e47cnliurdw3fbeq
Improving Rate of Convergence via Gain Adaptation in Multi-Agent Distributed ADMM Framework
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, the alternating direction method of multipliers (ADMM) is investigated for distributed optimization problems in a networked multi-agent system. ...
In particular, a new adaptive-gain ADMM algorithm is derived in a closed form and under the standard convex property in order to greatly speed up convergence of ADMM-based distributed optimization. ...
In such a multi-agent setting, distributed algorithm for network optimization becomes lucrative and practical since it is not always efficient to gather all the information for a centralized computation ...
arXiv:2002.10515v1
fatcat:x7akk6mneradvo4cqecamn7fz4
Fixed-time Distributed Optimization: Consistent Discretization, Time-Varying Topology and Non-Convex Functions
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This paper presents a fixed-time convergent and distributed optimization algorithm for first-order multi-agent systems over a time-varying communication topology. ...
The proposed optimization algorithm combines a fixed-time convergent distributed parameter estimation scheme with a fixed-time distributed consensus scheme as its solution methodology. ...
CONCLUSIONS In this paper, we presented a scheme to solve a distributed convex optimization problem for continuous time multi-agent systems with fixed-time convergence guarantees under various conditions ...
arXiv:1905.10472v4
fatcat:imyb6ow5jnfxjnv7uczuxdgxzi
On Distributed Convex Optimization Under Inequality and Equality Constraints
2012
IEEE Transactions on Automatic Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider a general multi-agent convex optimization problem where the agents are to collectively minimize a global objective function subject to a global inequality constraint, a global equality constraint ...
These algorithms can be implemented over networks with dynamically changing topologies but satisfying a standard connectivity property, and allow the agents to asymptotically agree on optimal solutions ...
Index Terms-Cooperative control, distributed optimization, multi-agent systems.
I. ...
doi:10.1109/tac.2011.2167817
fatcat:vmrzevhrhvgcdfv3tccpel7bpu
Improving Rate of Convergence via Gain Adaptation in Multi-Agent Distributed ADMM Framework
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, the Alternating Direction Method of Multipliers (ADMM) is investigated for distributed optimization problems in a networked multi-agent system. ...
In particular, a new adaptive-gain ADMM algorithm is derived in a closed form and under the standard convex property in order to greatly speed up convergence of ADMM-based distributed optimization. ...
In such a multi-agent setting, distributed algorithm for network optimization becomes lucrative and practical since it is not always efficient to gather all the information for a centralized computation ...
doi:10.1109/access.2020.2989402
fatcat:7ssklo3qzrbmzioouo67hvcjsi
Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
2013
IEEE Transactions on Automatic Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, multi-agent systems minimizing a sum of objective functions, where each component is only known to a particular node, is considered for continuous-time dynamics with time-varying interconnection ...
By a simple distributed control rule, the considered multi-agent system with continuous-time dynamics achieves not only a consensus, but also an optimal agreement within the optimal solution set of the ...
ACKNOWLEDGMENT The authors would like to thank the Associate Editor and the anonymous reviewers for their valuable suggestions. ...
doi:10.1109/tac.2012.2215261
fatcat:zsejmsffvjc2vmibbtakurswsy
Distributed optimization for multi-agent systems with time delay
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The distributed optimization for multi-agent systems with time delay and first-order is investigated in this paper. ...
Firstly, a distributed algorithm for time-delay systems is proposed to solve the optimization problem that each agent depends on its own state and the state between itself and its neighbors. ...
In Section 3, a new optimization algorithm for the multi-agent system with time delay caused by communication is presented and we proved that all agents would asymptotically track to the optimal which ...
doi:10.1109/access.2020.3007731
fatcat:3tzbw4iq2jhqxd5bqbp2dbxgyq
Averaging approach to distributed convex optimization for continuous-time multi-agent systems
2017
Kybernetika (Praha)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
distributed algorithm for convex optimization problem. ...
The algorithm for distributed convex optimization in continuous-time was firstly proposed in [23, 24] , but they were second order. ...
doi:10.14736/kyb-2016-6-0898
fatcat:csph7qlvejhd3otfwcz3glg3im
Leader selection in multi-agent systems for smooth convergence via fast mixing
2012
2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In a leader-follower multi-agent system (MAS), a set of leader nodes receive state updates directly from the network operator. ...
In this paper, we study the problem of selecting a set of leader nodes in order to minimize the time required for the distributed coordination law used by the MAS to converge. ...
CONCLUSIONS In this paper, we studied leader selection in multi-agent systems in order to minimize the time required for the follower agents to converge to their desired states. ...
doi:10.1109/cdc.2012.6426323
dblp:conf/cdc/ClarkABP12
fatcat:rgvgjv3lvbgnrn6athiyxapq24
Push-sum Distributed Dual Averaging for Convex Optimization in Multi-agent Systems with Communication Delays
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The distributed convex optimization problem over the multi-agent system is considered in this paper, and it is assumed that each agent possesses its own cost function and communicates with its neighbours ...
over a sequence of time-varying directed graphs. ...
convex optimization algorithms which are caused by communication delays in multi-agent systems. ...
arXiv:2112.01731v2
fatcat:kesmx5ra2vajfel3ykwo5xy6dm
A consensus-based algorithm for multi-objective optimization and its mean-field description
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We present a multi-agent algorithm for multi-objective optimization problems, which extends the class of consensus-based optimization methods and relies on a scalarization strategy. ...
We show that those dynamics are described by a mean-field model, which is suitable for a theoretical analysis of the algorithm convergence. Numerical results show the validity of the proposed method. ...
In the context of interacting multi-agent systems, the update rule of Algorithm 1 typically originates as a simulation of the a continuous-in-time dynamics of N agents [7] . ...
arXiv:2203.16384v1
fatcat:r7ggx2zc2reb5gywlnnug6kjiy
A Jacobi Decomposition Algorithm for Distributed Convex Optimization in Distributed Model Predictive Control * *Support by the Alexander von Humboldt Foundation, by EU via ERC-HIGHWIND (259 166), ITN-TEMPO (607 957), and ITN-AWESCO (642 682) and by DFG via the project Numerische Methoden zur optimierungsbasierten Regelung zyklischer Prozesse is gratefully acknowledged
2017
IFAC-PapersOnLine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper we introduce an iterative distributed Jacobi algorithm for solving convex optimization problems, which is motivated by distributed model predictive control (MPC) for linear time-invariant ...
Abstract In this paper we introduce an iterative distributed Jacobi algorithm for solving convex optimization problems, which is motivated by distributed model predictive control (MPC) for linear time-invariant ...
This is a known barrier in distributed convex optimization for years. ...
doi:10.1016/j.ifacol.2017.08.744
fatcat:epnm5k5k7jhvxeu255ctundmhe
Consensus Algorithm with Steady-State Optimization for Continuous-Time Multi-Agent Systems
2014
SICE Journal of Control Measurement and System Integration
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, the authors propose a consensus algorithm for continuous-time multi-agent systems. ...
Using the proposed algorithm, the states of all agents converge to solutions of a convex optimization problem. ...
In [11] and [12] , a discrete-time distributed algorithm is presented for optimizing the sum of local objective functions. ...
doi:10.9746/jcmsi.7.69
fatcat:qtffstutwjctjix6pcb66wfrwe
Distributed Subgradient-based Multi-agent Optimization with More General Step Sizes
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A wider selection of step sizes is explored for the distributed subgradient algorithm for multi-agent optimization problems, for both time-invariant and time-varying communication topologies. ...
Then the optimal convergence of the agents' estimates follows because consensus is reached in both cases. ...
For any pair of points x and y in R m , we have P X (x) − P X (y) ≤ x − y .
III. PROBLEM STATEMENT For a multi-agent system with n agents, we regard each agent as a vertex. ...
arXiv:1602.00048v1
fatcat:727g4w2o4vb2jfwjis3e4fth7i
On decentralized negotiation of optimal consensus
2008
Automatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a negotiation algorithm that computes an optimal consensus point for agents modeled as linear control systems subject to convex input constraints and linear state constraints. ...
A consensus problem consists of finding a distributed control strategy that brings the state or output of a group of agents to a common value, a consensus point. ...
Acknowledgments The authors wish to thank Tamás Keviczky for helpful discussions and the anonymous reviewers for their helpful comments. ...
doi:10.1016/j.automatica.2007.09.003
fatcat:ln6bn2eenfbjvlvy3gndslntai
« Previous
Showing results 1 — 15 out of 10,799 results