Kuankuan Qi
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
Kuankuan Qi has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Fuxiao Tan
2 shared publications- Erchao Li
Lanzhou University of Technology
1 shared publication - Fuxiao Tan
College of Logistics Engineering, Shanghai Maritime University, Shanghai, China
1 shared publication
Latest Publications
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 19 (3) , 927-938
Cooperative Game-Based Distributed Optimal Synchronization Control via Multistep Distributed Value Iteration in Discrete- Time Multiagent Systems
Distributed policy iteration (DPI) and distributed value iteration (DVI) are the two main algorithms of distributed reinforcement learning (DRL), which are used to solve distributed cooperative game (DCG) problems derived from distributed cooperative consensus control. The convergence speed of DPI is fast, but the initial control strategy must be admissible. The DVI algorithm avoids the shortcomings of the DPI algorithm, but its convergence speed is slow. To find a method to balance the DPI algorithm and DVI algorithm to solve the DCG problem in discrete-time linear (DTL) multiagent systems (MASs), a model-based multistep DVI RL algorithm is proposed in this article. First, the distributed leader-follower tracking control in general DTL MASs is transformed into a DCG problem. The Nash equilibrium solution of the DCG is obtained by using the proposed algorithm to solve the Bellman equation. Then, based on the analysis of the DVI and DPI algorithms, a multistep DVI algorithm with the advantages of these two iterative algorithms is proposed. Second, we demonstrate the convergence of the proposed algorithm and design a universal stability criterion to ensure that the obtained control strategy is admissible. Finally, the feasibility and effectiveness of the proposed algorithm were verified through numerical simulation experiments.
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 19 (3) , 927-938
Cooperative Game-Based Distributed Optimal Synchronization Control via Multistep Distributed Value Iteration in Discrete- Time Multiagent Systems
Distributed policy iteration (DPI) and distributed value iteration (DVI) are the two main algorithms of distributed reinforcement learning (DRL), which are used to solve distributed cooperative game (DCG) problems derived from distributed cooperative consensus control. The convergence speed of DPI is fast, but the initial control strategy must be admissible. The DVI algorithm avoids the shortcomings of the DPI algorithm, but its convergence speed is slow. To find a method to balance the DPI algorithm and DVI algorithm to solve the DCG problem in discrete-time linear (DTL) multiagent systems (MASs), a model-based multistep DVI RL algorithm is proposed in this article. First, the distributed leader-follower tracking control in general DTL MASs is transformed into a DCG problem. The Nash equilibrium solution of the DCG is obtained by using the proposed algorithm to solve the Bellman equation. Then, based on the analysis of the DVI and DPI algorithms, a multistep DVI algorithm with the advantages of these two iterative algorithms is proposed. Second, we demonstrate the convergence of the proposed algorithm and design a universal stability criterion to ensure that the obtained control strategy is admissible. Finally, the feasibility and effectiveness of the proposed algorithm were verified through numerical simulation experiments.
- 26 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (8) , 3843-3856
Distributed Non-Cooperative Games and Distributed Learning in Linear and Nonlinear Systems: An Overview
As an important research direction of distributed intelligence, distributed non-cooperative game (DNCG) mainly involves algebraic graph theory, distributed learning, multi-agent system (MAS) and distributed control theory, which has been received more and more attention. Although significant progress has been made in solving DNCGs, DNCGs in linear and nonlinear systems based on distributed learning methods have not been fully summarized. Therefore, based on distributed learning methods, this paper provides a recent review of distributed zero-sum games (DZSGs) in linear and nonlinear systems. First, the classical directed communication graphs widely used in DZSGs with a fixed topological structure have been investigated. Second, this paper details the four types of MASs suitable for DZSGs, which are prepared for the introduction of DZSGs below. Then, a table summarizes the 12 types of classical MASs that have been widely used in DZSGs. Moreover, the DZSG problems in four types of linear and nonlinear systems have also been investigated, which established a foundation for the subsequent distributed algorithms. Furthermore, this article simultaneously studied the existing classic distributed algorithms for DZSG problems under four different system types, which presented the research status of DZSG problems for 12 systems in the form of a table. Finally, the further research directions of DNCGs have been summarized and the promising and challenging research directions for the future have also been proposed in the paper.
- 26 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (8) , 3843-3856
Distributed Non-Cooperative Games and Distributed Learning in Linear and Nonlinear Systems: An Overview
As an important research direction of distributed intelligence, distributed non-cooperative game (DNCG) mainly involves algebraic graph theory, distributed learning, multi-agent system (MAS) and distributed control theory, which has been received more and more attention. Although significant progress has been made in solving DNCGs, DNCGs in linear and nonlinear systems based on distributed learning methods have not been fully summarized. Therefore, based on distributed learning methods, this paper provides a recent review of distributed zero-sum games (DZSGs) in linear and nonlinear systems. First, the classical directed communication graphs widely used in DZSGs with a fixed topological structure have been investigated. Second, this paper details the four types of MASs suitable for DZSGs, which are prepared for the introduction of DZSGs below. Then, a table summarizes the 12 types of classical MASs that have been widely used in DZSGs. Moreover, the DZSG problems in four types of linear and nonlinear systems have also been investigated, which established a foundation for the subsequent distributed algorithms. Furthermore, this article simultaneously studied the existing classic distributed algorithms for DZSG problems under four different system types, which presented the research status of DZSG problems for 12 systems in the form of a table. Finally, the further research directions of DNCGs have been summarized and the promising and challenging research directions for the future have also been proposed in the paper.
- 7 February 2023
- Published by Springer Nature in Journal of Shanghai Jiaotong University (Science)
- Vol. 28 (1) , 86-99
Ant Colony Algorithm for Path Planning Based on Grid Feature Point Extraction
- 7 February 2023
- Published by Springer Nature in Journal of Shanghai Jiaotong University (Science)
- Vol. 28 (1) , 86-99
Ant Colony Algorithm for Path Planning Based on Grid Feature Point Extraction