Songsong Cheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Songsong Cheng has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Yuan Fan
Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Electrical Engineering and Automation, Anhui University, Hefei, China
19 shared publications - Yong Wang
Department of Automation, University of Science and Technology of China, Hefei, China
7 shared publications - Shu Liang
Department of Control Science and Engineering, Tongji University, Shanghai, China
6 shared publications - Yiheng Wei
Southeast University
6 shared publications - Qing Huang
Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Electrical Engineering and Automation, Anhui University, Hefei, Anhui, China
4 shared publications - Xin Yu
Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Electrical Engineering and Automation, Anhui University, Hefei, China
3 shared publications
Latest Publications
- 26 September 2026
- Published by Springer Nature in Journal of Systems Science and Complexity
- p. 1-12
Faster Distributed Subgradient for Constrained Non-Smooth Optimization with Hölderian Growth
- 26 September 2026
- Published by Springer Nature in Journal of Systems Science and Complexity
- p. 1-12
Faster Distributed Subgradient for Constrained Non-Smooth Optimization with Hölderian Growth
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 8178-8194
Dynamic Event-Triggered Critic Neural Network Optimal Control of Euler–Lagrange Systems With Full-State Constraints
This paper presents an optimal control strategy for Euler–Lagrange systems subject to full-state constraints, based on a dynamic event-triggered critic neural network. To handle the constraints, an error transformation technique is introduced to convert the constrained error dynamics into an unconstrained form. Leveraging the transformed system, a critic neural network is utilized to approximate the performance index and derive the corresponding optimal control law. The specific update mechanism is formulated for the weight matrix of the neural network. To alleviate computational load, a dynamic event-triggered condition is designed to limit the frequency of weight updates, thereby mitigating unnecessary computations while effectively eliminating Zeno behavior. Comprehensive stability analysis proves the proposed approach is feasible and ensures that the approximation error of the critic neural network remains uniformly ultimately bounded. Numerical simulations on a robotic manipulator demonstrate the effectiveness of the proposed method and further verify its disturbance rejection capability under parametric perturbations and external disturbances.
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 8178-8194
Dynamic Event-Triggered Critic Neural Network Optimal Control of Euler–Lagrange Systems With Full-State Constraints
This paper presents an optimal control strategy for Euler–Lagrange systems subject to full-state constraints, based on a dynamic event-triggered critic neural network. To handle the constraints, an error transformation technique is introduced to convert the constrained error dynamics into an unconstrained form. Leveraging the transformed system, a critic neural network is utilized to approximate the performance index and derive the corresponding optimal control law. The specific update mechanism is formulated for the weight matrix of the neural network. To alleviate computational load, a dynamic event-triggered condition is designed to limit the frequency of weight updates, thereby mitigating unnecessary computations while effectively eliminating Zeno behavior. Comprehensive stability analysis proves the proposed approach is feasible and ensures that the approximation error of the critic neural network remains uniformly ultimately bounded. Numerical simulations on a robotic manipulator demonstrate the effectiveness of the proposed method and further verify its disturbance rejection capability under parametric perturbations and external disturbances.
- 2 April 2026
- Published by Elsevier in Control Engineering Practice
- Vol. 173
Fully distributed routing scheme for traffic congestion: A correlated equilibrium perspective
- 2 April 2026
- Published by Elsevier in Control Engineering Practice
- Vol. 173
Fully distributed routing scheme for traffic congestion: A correlated equilibrium perspective
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (2) , 848-860
Exact Penalty Design for Distributed Projection-Free Optimization With Event-Triggered Communication
This paper investigates distributed convex nonsmooth optimization problems with different feasible constraint sets. To address these types of problems, we develop a projection-free algorithm that employs an exact penalty technique, which outperforms existing methods in the same category, such as the renowned Frank-Wolfe algorithm, in handling different feasible constraint sets. The proposed algorithm not only avoids the prohibitive computation involved in projecting subgradients, but also eliminates the projection of variables in the exact penalty function, unlike conventional exact penalty algorithms. Moreover, we employ an event-triggered scheme for the distributed projection-free algorithm to effectively save communication resources. Furthermore, we demonstrate that the proposed algorithm converges to its optimal solution through nonsmooth Lyapunov analysis and the Filippov solution, and we illustrate its effectiveness by two numerical examples.
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (2) , 848-860
Exact Penalty Design for Distributed Projection-Free Optimization With Event-Triggered Communication
This paper investigates distributed convex nonsmooth optimization problems with different feasible constraint sets. To address these types of problems, we develop a projection-free algorithm that employs an exact penalty technique, which outperforms existing methods in the same category, such as the renowned Frank-Wolfe algorithm, in handling different feasible constraint sets. The proposed algorithm not only avoids the prohibitive computation involved in projecting subgradients, but also eliminates the projection of variables in the exact penalty function, unlike conventional exact penalty algorithms. Moreover, we employ an event-triggered scheme for the distributed projection-free algorithm to effectively save communication resources. Furthermore, we demonstrate that the proposed algorithm converges to its optimal solution through nonsmooth Lyapunov analysis and the Filippov solution, and we illustrate its effectiveness by two numerical examples.
- 10 January 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 156
Regularization-based distributed bilevel nonsmooth optimization over unbalanced graphs
- 10 January 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 156
Regularization-based distributed bilevel nonsmooth optimization over unbalanced graphs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (1) , 4-16
Angular Acceleration Transient Damping VSG for Paralleled Inverters in Islanded Microgrid With Constrained RoCoF and Suppressed Power Oscillation
Paralleled VSGs can collect resources from multiple devices, forming a large virtual inertia to stabilize an islanded microgrid. This enables an independent way for flexible utilization of renewable energy. Paralleled VSGs often suffer from active power oscillation when countering disturbances. Many efforts have been devoted to solving the problem, however, improved VSG control may have a high rate of change of frequency (RoCoF), leading to load shedding, relay misoperation, and cascaded collapse. Nevertheless, RoCoF constraint is barely discussed in existing literature. This paper proposes an angular acceleration transient damping VSG control for paralleled inverters, to constrain RoCoF and suppress power oscillation simultaneously. This is achieved by adding a negative feedback loop of angular acceleration into existing transient damping VSG, increasing virtual moment of inertia to constrain RoCoF. The side effect of virtual moment increment is a possible enlargement of power oscillation, this is further solved by utilizing an inertial element within the feedback loop to provide an extra damping effect, sustaining good oscillation suppression. Simulation experiments indicate that the proposed method has a much lower RoCoF and slightly better oscillation suppression than transient damping VSG, and holds an overall performance much better than traditional method.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (1) , 4-16
Angular Acceleration Transient Damping VSG for Paralleled Inverters in Islanded Microgrid With Constrained RoCoF and Suppressed Power Oscillation
Paralleled VSGs can collect resources from multiple devices, forming a large virtual inertia to stabilize an islanded microgrid. This enables an independent way for flexible utilization of renewable energy. Paralleled VSGs often suffer from active power oscillation when countering disturbances. Many efforts have been devoted to solving the problem, however, improved VSG control may have a high rate of change of frequency (RoCoF), leading to load shedding, relay misoperation, and cascaded collapse. Nevertheless, RoCoF constraint is barely discussed in existing literature. This paper proposes an angular acceleration transient damping VSG control for paralleled inverters, to constrain RoCoF and suppress power oscillation simultaneously. This is achieved by adding a negative feedback loop of angular acceleration into existing transient damping VSG, increasing virtual moment of inertia to constrain RoCoF. The side effect of virtual moment increment is a possible enlargement of power oscillation, this is further solved by utilizing an inertial element within the feedback loop to provide an extra damping effect, sustaining good oscillation suppression. Simulation experiments indicate that the proposed method has a much lower RoCoF and slightly better oscillation suppression than transient damping VSG, and holds an overall performance much better than traditional method.
- 9 December 2025
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 48 (14) , 4227-4239
Fully distributed ADMM design for constrained nonconvex optimization
This paper investigates a distributed nonconvex optimization problem constrained by a global coupled linear equality and nonidentical local feasible sets. To solve this problem, we propose a fully distributed alternating direction method of multiplier (ADMM) with a distributed dynamic average consensus for dual variables. Moreover, we demonstrate that the proposed algorithm converges to an approximately stationary solution of the considered problem using Lyapunov theory. Finally, we illustrate the effectiveness of the proposed algorithm by two simulation examples.
- 9 December 2025
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 48 (14) , 4227-4239
Fully distributed ADMM design for constrained nonconvex optimization
This paper investigates a distributed nonconvex optimization problem constrained by a global coupled linear equality and nonidentical local feasible sets. To solve this problem, we propose a fully distributed alternating direction method of multiplier (ADMM) with a distributed dynamic average consensus for dual variables. Moreover, we demonstrate that the proposed algorithm converges to an approximately stationary solution of the considered problem using Lyapunov theory. Finally, we illustrate the effectiveness of the proposed algorithm by two simulation examples.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 1515-1526
Distributed Zeroth-Order Gradient Tracking for Weakly Convex Optimization Over Unbalanced Graphs
Distributed weakly convex optimization is a significant class of problems in signal and information processing, with wide-ranging applications such as sparse dictionary learning, low-rank matrix completion, and robust phase retrieval. Most existing distributed algorithms for solving this type of problem are designed based on exact gradient information. However, it is challenging to obtain this information as closed-form analytical expressions are often unavailable in certain circumstances. In this article, we propose a gradient estimation scheme for distributed weakly convex optimization problems, estimating the gradient information using finite differences in orthogonal random directions. This approach is more general and has better estimation effectiveness than existing methods based on stochastic vectors. Furthermore, we design a projected zeroth-order gradient tracking algorithm, which effectively solves the considered problem over an unbalanced communication topology. We also demonstrate that the proposed algorithm converges to a stationary point with a rate of ${\mathcal {O}}(\ln K/{\sqrt{K}})$ from the perspective of the Moreau envelope. Finally, we provide two examples to verify the effectiveness of our algorithm.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 1515-1526
Distributed Zeroth-Order Gradient Tracking for Weakly Convex Optimization Over Unbalanced Graphs
Distributed weakly convex optimization is a significant class of problems in signal and information processing, with wide-ranging applications such as sparse dictionary learning, low-rank matrix completion, and robust phase retrieval. Most existing distributed algorithms for solving this type of problem are designed based on exact gradient information. However, it is challenging to obtain this information as closed-form analytical expressions are often unavailable in certain circumstances. In this article, we propose a gradient estimation scheme for distributed weakly convex optimization problems, estimating the gradient information using finite differences in orthogonal random directions. This approach is more general and has better estimation effectiveness than existing methods based on stochastic vectors. Furthermore, we design a projected zeroth-order gradient tracking algorithm, which effectively solves the considered problem over an unbalanced communication topology. We also demonstrate that the proposed algorithm converges to a stationary point with a rate of ${\mathcal {O}}(\ln K/{\sqrt{K}})$ from the perspective of the Moreau envelope. Finally, we provide two examples to verify the effectiveness of our algorithm.