Nana Yang
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
Nana Yang has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Suoping Li
School of Electrical and Information Engineering and the School of Science, Lanzhou University of Technology, Lanzhou, China
6 shared publications - Jiaxi Chen
School of Mathematics and Statistics Xidian University Xi'an China
2 shared publications - Jinshu Chen
School of Science, Lanzhou University of Technology, Lanzhou 730050, Gansu, P. R. China
2 shared publications - Junmin Li
School of Mathematics and Statistics Xidian University Xi'an China
2 shared publications - Michael Small
University of Western Australia
2 shared publications Jiaxi Chen
1 shared publication
Latest Publications
- 13 June 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 215
Neuro-learning coordination for uncertain time-varying multi-agent systems with unknown dead-zone inputs
- 13 June 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 215
Neuro-learning coordination for uncertain time-varying multi-agent systems with unknown dead-zone inputs
- 9 September 2025
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 23 (9) , 2514-2528
Distributed Adaptive Learning Tracking for Nonlinear Time-varying Multi-agent Systems With Unknown Control Directions and Dead-zone Inputs
- 9 September 2025
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 23 (9) , 2514-2528
Distributed Adaptive Learning Tracking for Nonlinear Time-varying Multi-agent Systems With Unknown Control Directions and Dead-zone Inputs
- 28 February 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 23 (04)
W-Entropy of quantum Markov semigroups in terms of quantum Bernoulli noises
In this study, we first deal with the canonical anti-commutation relation algebra in which the Bernoulli creation and annihilation operators generate the structure of ultra hyperfinite C[ ]-algebra. This observation simplifies the construction of the minimal quantum Markov semigroup construct from quantum Bernoulli noises by taking a filter through the family gamma of finite subsets of the natural numbers. As a result, we obtain a Feller quantum Markov semigroup defined on the C[ ]-algebra, which in turn is extended to the entire algebra of bounded operators. Then, one condition for us to obtain a faithful normal invariant state of this semigroup is an equilibrium state (it satisfies the detailed balance conditions). Finally, we use the quantum Wasserstein distance to discuss the W-entropy rate of this invariant state.
- 28 February 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 23 (04)
W-Entropy of quantum Markov semigroups in terms of quantum Bernoulli noises
In this study, we first deal with the canonical anti-commutation relation algebra in which the Bernoulli creation and annihilation operators generate the structure of ultra hyperfinite C[ ]-algebra. This observation simplifies the construction of the minimal quantum Markov semigroup construct from quantum Bernoulli noises by taking a filter through the family gamma of finite subsets of the natural numbers. As a result, we obtain a Feller quantum Markov semigroup defined on the C[ ]-algebra, which in turn is extended to the entire algebra of bounded operators. Then, one condition for us to obtain a faithful normal invariant state of this semigroup is an equilibrium state (it satisfies the detailed balance conditions). Finally, we use the quantum Wasserstein distance to discuss the W-entropy rate of this invariant state.
- Open Access
- 26 November 2024
- Published by Springer Nature in Research Square
Fully distributed robust adaptive xed-time consensus for uncertaintime-varying multi-agent systems with/without unknown control directions
This paper investigates the problem of fully distributed fixed-time consensus for an uncertaintime-varying multi-agent systems with/without unknown control directions. In accordance with the characteristicsof time-varying parameters and fixed-time consensus theory, fractional power parameter adaptive updatinglaws are designed to tackle with time-varying issue and avoid the singularity of protocols. Combine the adaptivecontrol and congelation of variables method, a new robust adaptive control scheme is proposed. Simultaneously, a novel weighted Lyapunov function and positive constant are introduced such that the estimation of settingtime is irrespective of any global information. The fully distributed fixed-time consensus has been realized, and the signals involved are all bounded. Two simulation examples illustrate the effectiveness of the presented strategy.
- 26 November 2024
- Published by Springer Nature in Research Square
Open AccessFully distributed robust adaptive xed-time consensus for uncertaintime-varying multi-agent systems with/without unknown control directions
This paper investigates the problem of fully distributed fixed-time consensus for an uncertaintime-varying multi-agent systems with/without unknown control directions. In accordance with the characteristicsof time-varying parameters and fixed-time consensus theory, fractional power parameter adaptive updatinglaws are designed to tackle with time-varying issue and avoid the singularity of protocols. Combine the adaptivecontrol and congelation of variables method, a new robust adaptive control scheme is proposed. Simultaneously, a novel weighted Lyapunov function and positive constant are introduced such that the estimation of settingtime is irrespective of any global information. The fully distributed fixed-time consensus has been realized, and the signals involved are all bounded. Two simulation examples illustrate the effectiveness of the presented strategy.
- Open Access
- 28 September 2022
- Published by MDPI AG in Future Internet
- Vol. 14 (10) , 279
Modelling Analysis of a Novel Frameless Slotted-ALOHA Protocol Based on the Number of Detectable Conflicting Users
To solve the conflict when multi-user packets are transmitted in a shared wireless link, a novel frameless slotted-ALOHA protocol is proposed. Signature codes are used to help the receiver identify the set of transmitting users, and successive interference cancellation technology is employed to recover conflicting packets. Thus, the information in the conflicting slot can be reused to reduce the number of retransmissions. Taking the number of backlogged users in each slot as a system state, a Markov chain model is established to analyze the protocol, in which the state transition probabilities are obtained based on the binomial distribution of packets sent in a slot. Under the maximum number of detectable conflicting users, the best value is taken, traffic balance equations are obtained, and the expressions of throughput, average number of backlogged users, average successful transmission probability and average memory size are derived. Finally, a numerical simulation is carried out to accurately analyze the influence of the first transmission probability of the packets on various performance indexes and the effectiveness of the theoretical analysis is further verified by the simulation results.
- 28 September 2022
- Published by MDPI AG in Future Internet
- Vol. 14 (10) , 279
Open AccessModelling Analysis of a Novel Frameless Slotted-ALOHA Protocol Based on the Number of Detectable Conflicting Users
To solve the conflict when multi-user packets are transmitted in a shared wireless link, a novel frameless slotted-ALOHA protocol is proposed. Signature codes are used to help the receiver identify the set of transmitting users, and successive interference cancellation technology is employed to recover conflicting packets. Thus, the information in the conflicting slot can be reused to reduce the number of retransmissions. Taking the number of backlogged users in each slot as a system state, a Markov chain model is established to analyze the protocol, in which the state transition probabilities are obtained based on the binomial distribution of packets sent in a slot. Under the maximum number of detectable conflicting users, the best value is taken, traffic balance equations are obtained, and the expressions of throughput, average number of backlogged users, average successful transmission probability and average memory size are derived. Finally, a numerical simulation is carried out to accurately analyze the influence of the first transmission probability of the packets on various performance indexes and the effectiveness of the theoretical analysis is further verified by the simulation results.
- Open Access
- 1 January 2022
- Published by Wiley in Complexity
- Vol. 2022 (1)
Distributed Coordination for a Class of High‐Order Multiagent Systems Subject to Actuator Saturations by Iterative Learning Control
This paper investigates a distributed coordination control for a class of high‐order uncertain multiagent systems. Under the framework of iterative learning control, a novel fully distributed learning protocol is devised for the coordination problem of MASs including time‐varying parameter uncertainties as well as actuator saturations. Meanwhile, the learning updating laws of various parameters are proposed. Utilizing Lyapunov theory and combining with Graph theory, the proposed algorithm can make each follower track a leader completely over a limited time interval even though each follower is without knowing the dynamics of the leader. Moreover, the extension to formation control is made. The validity and feasibility of the algorithm are verified conclusively by two examples.
- 1 January 2022
- Published by Wiley in Complexity
- Vol. 2022 (1)
Open AccessDistributed Coordination for a Class of High‐Order Multiagent Systems Subject to Actuator Saturations by Iterative Learning Control
This paper investigates a distributed coordination control for a class of high‐order uncertain multiagent systems. Under the framework of iterative learning control, a novel fully distributed learning protocol is devised for the coordination problem of MASs including time‐varying parameter uncertainties as well as actuator saturations. Meanwhile, the learning updating laws of various parameters are proposed. Utilizing Lyapunov theory and combining with Graph theory, the proposed algorithm can make each follower track a leader completely over a limited time interval even though each follower is without knowing the dynamics of the leader. Moreover, the extension to formation control is made. The validity and feasibility of the algorithm are verified conclusively by two examples.
- Open Access
- 6 November 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (21) , 10433
Two-Stage Adaptive Relay Selection and Power Allocation Strategy for Cooperative CR-NOMA Networks in Underlay Spectrum Sharing
In this paper, we consider a novel cooperative underlay cognitive radio network based on non-orthogonal multiple access (CR-NOMA) with adaptive relay selection and power allocation. In secondary networks, dedicated relay assistance and user assistance are used to achieve communication between the base station and the far (and near) user. Here, a two-stage adaptive relay selection and power allocation strategy is proposed to maximize the achievable data rate of the far user while ensuring the service quality of near user. Furthermore, the closed-form expressions of outage probability of two secondary users are derived, respectively, under interference power constraints, revealing the impact of transmit power, number of relays, interference threshold and target data rate on system outage probability. Numerical results and simulations validate the advantages of the established cooperation and show that the proposed adaptive relay selection and power allocation strategy has better outage performance.
- 6 November 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (21) , 10433
Open AccessTwo-Stage Adaptive Relay Selection and Power Allocation Strategy for Cooperative CR-NOMA Networks in Underlay Spectrum Sharing
In this paper, we consider a novel cooperative underlay cognitive radio network based on non-orthogonal multiple access (CR-NOMA) with adaptive relay selection and power allocation. In secondary networks, dedicated relay assistance and user assistance are used to achieve communication between the base station and the far (and near) user. Here, a two-stage adaptive relay selection and power allocation strategy is proposed to maximize the achievable data rate of the far user while ensuring the service quality of near user. Furthermore, the closed-form expressions of outage probability of two secondary users are derived, respectively, under interference power constraints, revealing the impact of transmit power, number of relays, interference threshold and target data rate on system outage probability. Numerical results and simulations validate the advantages of the established cooperation and show that the proposed adaptive relay selection and power allocation strategy has better outage performance.
- 14 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Artificial Neural Networks Modeling Technology for Substrate Integrated Suspended Line
A new method for parameter modeling of self-packaged Substrate Integrated Suspended Line (SISL) devices based on artificial neural network is proposed. The method only uses the input and output signals of self-packaged SISL devices, and does not need to establish the internal structure information of the model. The cost of modeling is greatly reduced and the design cycle of microwave passive devices is shortened. In addition, an improved training method is proposed based on the neural network to learn the relationship between electromagnetic response and geometric parameters, so that the proposed model can efficiently and accurately match the characteristics of SISL devices. The model takes geometric parameters as variables. It can provide the exact and rapid prediction for the electromagnetic response of SISL devices. The validity and accuracy of the parameter modeling technique based on an artificial neural network are verified by a modeling example of a wideband Yagi antenna.
- 14 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Artificial Neural Networks Modeling Technology for Substrate Integrated Suspended Line
A new method for parameter modeling of self-packaged Substrate Integrated Suspended Line (SISL) devices based on artificial neural network is proposed. The method only uses the input and output signals of self-packaged SISL devices, and does not need to establish the internal structure information of the model. The cost of modeling is greatly reduced and the design cycle of microwave passive devices is shortened. In addition, an improved training method is proposed based on the neural network to learn the relationship between electromagnetic response and geometric parameters, so that the proposed model can efficiently and accurately match the characteristics of SISL devices. The model takes geometric parameters as variables. It can provide the exact and rapid prediction for the electromagnetic response of SISL devices. The validity and accuracy of the parameter modeling technique based on an artificial neural network are verified by a modeling example of a wideband Yagi antenna.
- 26 March 2020
- Published by Wiley in Asian Journal of Control
- Vol. 23 (4) , 1748-1761
Fully distributed coordination learning control of second‐order nonlinear multi‐agent systems with input saturation
This paper develops the coordination learning control of second‐order non‐linear multi‐agent systems with input saturation. Fully distributed learning consensus protocols with fully saturated parameter adaptive updating laws are designed. Although there exists input saturation in the dynamics of each follower agent, the global perfect consensus tracking can be realized over a finite time interval. Meanwhile, an extension to formation control has been made, and two illustrative examples certify the validness of the presented algorithms.
- 26 March 2020
- Published by Wiley in Asian Journal of Control
- Vol. 23 (4) , 1748-1761
Fully distributed coordination learning control of second‐order nonlinear multi‐agent systems with input saturation
This paper develops the coordination learning control of second‐order non‐linear multi‐agent systems with input saturation. Fully distributed learning consensus protocols with fully saturated parameter adaptive updating laws are designed. Although there exists input saturation in the dynamics of each follower agent, the global perfect consensus tracking can be realized over a finite time interval. Meanwhile, an extension to formation control has been made, and two illustrative examples certify the validness of the presented algorithms.