Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qingyuan Qi

dblp:175/9566 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
1since 2021 · last 2021
0000-0002-8741-6273ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 88% Algorithms and data structures · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › control theory › optimal control
linear quadratic control
0.312017
Time-inconsistent stochastic linear quadratic control for discrete-time systems · Sci. China Inf. Sci. 2017
Mathematical optimization › control theory › optimal control
stochastic control
0.312017
Time-inconsistent stochastic linear quadratic control for discrete-time systems · Sci. China Inf. Sci. 2017
Mathematical optimization › dynamical systems
discrete-time systems
0.112017
Time-inconsistent stochastic linear quadratic control for discrete-time systems · Sci. China Inf. Sci. 2017
Algorithms and data structures
dynamic programming
0.112017
Time-inconsistent stochastic linear quadratic control for discrete-time systems · Sci. China Inf. Sci. 2017

Methods — techniques the papers use, named apart from their topics

stochastic control · 0.3
YearPublicationVenuePosition
2021 The Complexity in Complete Graphic Characterizations of Multiagent Controllability
abstract
Establishing the graph-based criterion for the selection of any location and any number of leaders is the main difficulty in the complete graphic characterization of multiagent controllability. This greatly increases the complexity of the study, compared with the results derived for only one or several classes of leaders. Through a detailed analysis of graphs of six nodes, this article presents a systematic design and identification process for the complete graphic characterization by taking advantage of controllability destructive nodes. The topologies obtained by the proposed method allow directly determining controllability at the network topology level. The results are not only applicable to any leader's selection but also reveal the difficulty and complexity in the study of complete controllability graphic characterizations. Moreover, by comparing graphs composed of five and six nodes, the results reveal the graph-theory-based controllability complexity caused by adding only one node. Finally, results are derived to show how to design topology structures to ensure the controllability under any selection of leaders.
Zhijian Ji, Hai Lin 0002, Shaobin Cao, Qingyuan Qi, Huizi Ma
IEEE Trans. Cybern.4
2020 Learning in multi-agent systems with asymmetric information structure
Cheng Tan 0001, Qingyuan Qi, Wing Shing Wong
Neurocomputing2
2018 Output Feedback Control and Stabilization for Multiplicative Noise Systems With Intermittent Observations
abstract
This paper mainly focuses on the optimal output feedback control and stabilization problems for discrete-time multiplicative noise system with intermittent observations. The main contributions of this paper can be concluded as follows. First, different from the previous literatures, this paper overcomes the barrier of the celebrated separation principle for stochastic control problems of multiplicative noise systems. Based on the measurement process, the optimal estimation is presented, and by using dynamic programming principle, the optimal output feedback controller is designed with feedback gain based on the given coupled Riccati equations. Second, the necessary and sufficient stabilization conditions for multiplicative noise system with intermittent observation in the mean square sense are developed for the first time. Finally, the novel results developed in this paper can be applied to solve the output feedback control and stabilization problems for general networked control system of user datagram protocol network case. The range of packet losses rate and the allowable maximum packet losses rate are presented explicitly.
Qingyuan Qi, Huanshui Zhang
IEEE Trans. Cybern.1
2017 Time-inconsistent stochastic linear quadratic control for discrete-time systems
Qingyuan Qi, Huanshui Zhang
Sci. China Inf. Sci.1
2017 Output Feedback Control and Stabilization for Networked Control Systems With Packet Losses
abstract
This paper mainly considers the optimal measurement feedback control and stabilization for networked control systems (NCSs) with packet losses. The problems are involved with fundamental difficulties of separation principle and optimal estimation (conditional expectation) for multiplicative noise stochastic systems. First, the optimal estimator (conditional expectation) for NCSs with packet losses is derived and the optimal measurement feedback controller is obtained by using the maximum principle. The sufficient and necessary solvability condition of finite horizon measurement feedback control problem is first presented. Moreover, the asymptotic stability of the optimal estimator is studied. Finally, for the infinite horizon case, based on the introduction of a new Lyapunov function, which is defined with the optimal cost function, it is shown that the system is stabilizable in the mean square sense if and only if an algebraic Riccati equation admits a unique positive definite solution.
Qingyuan Qi, Huanshui Zhang
IEEE Trans. Cybern.1