Chao Sun

Chao Sun

Auto-generated profile, based on publicly available information

Chao Sun

School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 February 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
CSChao Sun
Chao Sun
MYMaojiao Ye
Maojiao Ye
GHGuoqiang Hu
Guoqiang Hu
This paper considers a class of distributed quadratic optimization problem under an undirected and connected graph. Different from most of the existing distributed optimization works that consider the optimal solutions to be constants, the optimal solution and the objective functions at the optimal solution are both assumed to be time varying. For the case where there is no constraint on the decision variables, gradient-based searching methods are proposed to track the unknown optimal solution. The tracking errors are proven to be asymptotically stable. For the case where there exists a local compact convex constraint set for each agent, projected gradient-based methods are proposed for both neighboring coupled and generally coupled objective functions, and the tracking errors are proven to be uniformly ultimately bounded with arbitrarily small bound.

11 December 2017 in IEEE Transactions on Control Systems Technology
Verified
Journal Article
Closed access
LBLu Bai
Lu Bai
MYMaojiao Ye
Maojiao Ye
CSChao Sun
Chao Sun
GHGuoqiang Hu
Guoqiang Hu
In this brief, a distributed control algorithm is proposed to solve the economic dispatch problem. Without a central control unit, the generators work collaboratively to minimize the generation cost while balancing the supply and demand. The proposed method is based on consensus protocols and the saddle point dynamics. The consensus protocols are employed to estimate the global information in a distributed fashion, and the saddle point dynamics are leveraged to search for the optimal solution of the economic dispatch problem. By utilizing Lyapunov stability analysis, exponential stability of the optimal solution is derived if the capacity limits of the generators are not considered; with the capacity limits, practical stability of the optimal solution is obtained. No global information is needed in the proposed method, and the requirement on initial conditions of the state variables is mild. Several case studies on the IEEE 9-bus and IEEE 118-bus systems are presented to demonstrate the effectiveness of the proposed algorithms.

11 March 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
CSChao Sun
Chao Sun
ZFZhi Feng
Zhi Feng
GHGuoqiang Hu
Guoqiang Hu
We investigate a distributed time-varying formation control problem for an uncertain Euler–Lagrange system. A time-varying optimization-based approach is proposed. Based on this approach, the robots can achieve the expected formation configuration and meanwhile optimize a global objective function using only neighboring and local information. We consider the time-varying optimization where the objective functions can change in real time. In this case, the consensus-based formation tracking control issues and formation containment tracking control issues in the literature can be solved by the proposed approach. By a penalty-based method, the robots’ states asymptotically converge to the estimated optimal solution to an equivalent time-varying optimization problem, whose optimal solution can achieve simultaneous formation and optimization. Furthermore, we consider two more general scenarios: 1) the local objective functions can have non-neighbor’s information and 2) the optimization problems can have inequality constraints.

24 April 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
CSChao Sun
Chao Sun
GHGuoqiang Hu
Guoqiang Hu
LXLihua Xie
Lihua Xie
This paper addresses the controllability of a class of antagonistic multiagent networks with both positive and negative edges. All the agents of the multiagent network run a consensus algorithm using a signed Laplacian. Based on the generalized equitable partition, we propose a graph-theoretic characterization of an upper bound on the controllable subspace. Then, we provide a necessary condition for the controllability of the system and give an algorithm to compute the partition. Furthermore, we prove that for a structurally balanced network, the controllability is equivalent to that of the corresponding all-positive network, if the leaders are chosen from the same vertex set. Several examples are given to illustrate these results.

24 November 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
CSChao Sun
Chao Sun
GHGuoqiang Hu
Guoqiang Hu
In this article, we propose centralized and distributed continuous-time penalty methods to find a Nash equilibrium for a generalized noncooperative game with shared inequality and equality constraints and private inequality constraints that depend on the player itself. By using the $\ell _{1}$ penalty function, we prove that the equilibrium of a differential inclusion is a normalized Nash equilibrium of the original generalized noncooperative game, and the centralized differential inclusion exponentially converges to the unique normalized Nash equilibrium of a strongly monotone game. Suppose that the players can communicate with their neighboring players only and the communication topology can be represented by a connected undirected graph. Based on a leader-following consensus scheme and singular perturbation techniques, we propose distributed algorithms by using the exact $\ell _{1}$ penalty function and the continuously differentiable squared $\ell _{2}$ penalty function, respectively. The squared $\ell _{2}$ penalty function method works for games with smooth constraints and the exact $\ell _{1}$ penalty function works for certain scenarios. The proposed two distributed algorithms converge to an $\eta$ -neighborhood of the unique normalized Nash equilibrium and an $\eta$ -neighborhood of an approximated Nash equilibrium, respectively, with $\eta$ being a positive constant. For each $\eta >0$ and each initial condition, there exists an $\varepsilon ^*$ such that for each $0< \varepsilon < \varepsilon ^*$ , the convergence can be guaranteed where $\varepsilon$ is a parameter in the algorithm.

17 April 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
CSChao Sun
Chao Sun
MYMaojiao Ye
Maojiao Ye
GHGuoqiang Hu
Guoqiang Hu
This article studies distributed optimization algorithms for heterogeneous multiagent systems under an undirected and connected communication graph. Two types of heterogeneities are discussed. First, we consider a class of multiagent systems composed of both continuous-time dynamic agents and discrete-time dynamic agents. The agents coordinate with each other to minimize a global objective function that is the sum of their local convex objective functions. A distributed subgradient method is proposed for each agent in the network. It is proved that driven by the proposed updating law, the agents' position states converge to an optimal solution of the optimization problem, provided that the subgradients of the objective functions are bounded, the step size is not summable but square summable, and the sampling period is bounded by some constant. Second, we consider a class of multiagent systems composed of both first-order dynamic agents and second-order dynamic agents. It is proved that the agents' position states converge to the unique optimal solution if the objective functions are strongly convex, continuously differentiable, and the gradients are globally Lipschitz. Numerical examples are given to verify the conclusions.