Peng Zhang

Peng Zhang

Auto-generated profile, based on publicly available information

Peng Zhang

College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 July 2019 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
PZPeng Zhang
Peng Zhang
YYYuan Yuan
Yuan Yuan
LGLei Guo
Lei Guo
This paper investigates the dynamic event-triggered fault-tolerant optimal control strategy for a class of output feedback nonlinear discrete-time systems subject to actuator faults and input saturations. To save the communication resources between the sensor and the controller, the so-called dynamic event-triggered mechanism is adopted to schedule the measurement signal. A neural network-based observer is first designed to provide both the system states and fault information. Then, with consideration of the actuator saturation phenomenon, the adaptive dynamic programming (ADP) algorithm is designed based on the estimates provided by the observer. To reduce the computational burden, the optimal control strategy is implemented via the single network adaptive critic architecture. The sufficient conditions are provided to guarantee the boundedness of the overall closed-loop systems. Finally, the numerical simulations on a two-link flexible manipulator system are provided to verify the validity of the proposed control strategy.

10 January 2023 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
Zixuan ZhengZixuan Zheng
Zixuan Zheng
PZPeng Zhang
Peng Zhang
JYJianping Yuan
Jianping Yuan
In this paper, the nonzero-sum pursuit-evasion (PE) game control problem is studied for a class of linear spacecraft control systems subject to the complete information case and incomplete information case. The incomplete information includes the cost functions and the control inputs. In practical confrontation situations, due to the incomplete information constraints, it is impossible for the pursuer and the evader to build up the exact opposite cost function. Hence, a nonzero-sum game framework is utilized to describe the PE game problem of the double-spacecraft system. First of all, under the complete information case, the nonzero-sum PE game control strategy is designed by solving the coupled Riccati recursions. Then, aiming at the incomplete information case, a control gain estimator is established, which lays the foundation for the control strategy design of the pursuit spacecraft. On the basis of the estimated control gain, the pursuit control strategy is solved by using the standard discrete-time Riccati recursion. In order to further get rid of the system information, a Q-learning-based control gain is designed for the pursuit spacecraft. Finally, a numerical example on the PE spacecraft system is provided to verify the effectiveness of the proposed PE game control strategies.

2 April 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
HYHongjiu Yang
Hongjiu Yang
MSMin Shi
Min Shi
YXYuanqing Xia
Yuanqing Xia
PZPeng Zhang
Peng Zhang
In this paper, a countermeasure for wireless networked control systems suffering from jamming attacks is studied by a variable sampling approach. A Stackelberg game framework is utilized to analyze interactions between a smart jammer and a legitimate user. The variable sampling approach is exploited to deal with data packets dropout between a sensor and a controller. Moreover, a resilient variable sampling controller is designed by a delta operator method. Besides, stability conditions are provided for systems with proposed controller. Finally, a numerical simulation is provided to validate the effectiveness of the proposed method.

15 May 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
YYYuan Yuan
Yuan Yuan
ZWZidong Wang
Zidong Wang
PZPeng Zhang
Peng Zhang
HDHongli Dong
Hongli Dong
In this paper, the near-optimal nonfragile consensus control design problem is investigated for a class of discrete time-varying multiagent systems (MASs) with controland state-dependent noises. A decentralized observer-based control protocol is proposed by using the relative output measurements. The gain perturbations/variations of the controller as well as the stateand control-dependent noises are simultaneously taken into consideration, which could better reflect the complexities in reality. The corresponding time-varying observer-based nonfragile near-optimal consensus protocol is designed for the underlying MASs over a finite horizon. To be specific, a certain upper bound is first derived for the associate cost function for the MASs. Then, such an upper bound is minimized by using the completingthe-square technique and Moore-Penrose pseudo inverse. The parameters of the time-varying observer/controller are obtained in terms of the solutions to the Riccati-like recursion. In virtue of the matrix partitioning technique, the explicit expressions of the control/observer parameters are presented. Finally, based on the derived consensus protocol, an upper bound of the associate cost function is provided as time goes to infinity. Some numerical simulations are conducted to demonstrate the validity of the proposed methodology.

2 July 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
YYYuan Yuan
Yuan Yuan
ZWZidong Wang
Zidong Wang
PZPeng Zhang
Peng Zhang
HLHongjian Liu
Hongjian Liu
In this paper, the near-optimal resilient control strategy design problem is investigated for a class of discrete time-varying system in simultaneous presence of stochastic communication protocols (SCPs), gain perturbations, state saturations, and additive nonlinearities. In the sensor-to-controller network, only one sensor is permitted to get access to the communication media so as to avoid possible data collisions. Described by a Markov chain, the SCP is employed to determine which sensor should obtain the access to the network at a certain time. Furthermore, two kinds of well-recognized complexities (i.e., state saturations and additive nonlinearities) are considered in the system model and the phenomenon of controller gain perturbation is also taken into special consideration. Accordingly, the resilient control strategy is designed by: 1) deriving a certain upper bound on the associate cost function of underlying systems and 2) minimizing such an upper bound through the utilization of the completing-the-square technique and the Moore-Penrose pseudo inverse. The resilient control strategy is obtained in an iterative manner by solving a set of coupled backward Riccati-like recursions. Furthermore, based on the proposed control strategies, the infinite horizon case is considered and the corresponding upper bound of the cost function is explicitly provided. Finally, numerical simulations are carried out on power systems in order to verify the validity of the proposed resilient control algorithms.

13 March 2019 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
YYYuan Yuan
Yuan Yuan
PZPeng Zhang
Peng Zhang
ZWZidong Wang
Zidong Wang
YCYun Chen
Yun Chen
In this paper, the noncooperative optimal control problem is investigated for a class of discrete time-varying networked control systems subject to exogenous nonlinear disturbances. To relive the transmission burden in the sensor-to-controller channel, the Round-Robin protocol is adopted to schedule the sensor transmissions. On the other hand, the controller operates in an event-triggered manner so as to reduce the transmission frequency and thereby preserving the energy in the controller-to-actuator channel. In the presence of the underlying scheduling and triggering mechanism, it is literally impossible to acquire the accurate value of the individual cost function for each controller and, as an effective alternative, a certain upper bound is derived on the individual cost function. Then, in virtue of the completing-the-square technique and the Moore-Penrose pseudo inverse, such an upper bound is minimized at each time instant. Furthermore, a sufficient condition is established to guarantee the boundedness of the derived upper bound over the infinite horizon. Finally, a numerical example on the power grid is provided to verify the validity of the proposed methodology.