Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions

By Salar Rahili, Wei Ren. IEEE Transactions on Automatic Control, 2015

336 citations recorded by the source corpus.

In this paper, a time-varying distributed convex optimization problem is studied for continuous-time multi-agent systems. The objective is to minimize the sum of local time-varying cost functions, each of which is known to only an individual agent, through local interaction. Here, the optimal point is time varying and creates an optimal trajectory. Control algorithms are designed for the cases of single-integrator and double-integrator dynamics. In both cases, a centralized approach is first introduced to solve the optimization problem. Then, this problem is solved in a distributed manner and a discontinuous algorithm based on the signum function is proposed in each case. In the case of single-integrator (respectively, double-integrator) dynamics, each agent relies only on its own position and the relative positions (respectively, positions and velocities) between itself and its neighbors. A gain adaption scheme is introduced in both algorithms to eliminate certain global information requirement. To relax the restricted assumption imposed on feasible cost functions, an estimator based algorithm using the signum function is proposed, where each agent uses dynamic average tracking as a tool to estimate the centralized control input. As a tradeoff, the estimator-based algorithm necessitates communication between neighbors. Then, in the case of double-integrator dynamics, the proposed algorithms are further extended. Two continuous algorithms based on, respectively, a time-varying and a fixed boundary layer are proposed as continuous approximations of the signum function. To account for interagent collision for physical agents, a distributed convex optimization problem with swarm tracking behavior is introduced for both single-integrator and double-integrator dynamics. It is shown that the center of the agents tracks the optimal trajectory, the connectivity of the agents is maintained, and interagent collision is avoided.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Control and Systems Engineering

View Paper: https://www.semanticscholar.org/paper/dcd1cbd31ee058defe04dccc1993a1b92d28627b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Qing-Long Han
  2. Shengyuan Xu
  3. James Lam
  4. Xianming Zhang

In Computer Networks and Communications

  1. Boda Ning
  2. Qing-Long Han
  3. Zongyu Zuo
  4. Xianming Zhang
  5. Xiaohua Ge
  6. Dong Yue
  7. James Lam
  8. Qing-Long Han

In Control and Systems Engineering

  1. Boda Ning
  2. Qing-Long Han
  3. Zongyu Zuo
  4. Xianming Zhang
  5. Xiaohua Ge
  6. Qing-Long Han
  7. James Lam
  8. Shengyuan Xu

Citations in the corpus