Jiahao Dai

Jiahao Dai

Auto-generated profile, based on publicly available information

Jiahao Dai

School of Automation and Electrical Engineering, Zhejiang University of Science and Technology, Hangzhou, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
26 April 2022 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
JDJiahao Dai
Jiahao Dai
JYJing-Wen Yi
Jing-Wen Yi
LCLi Chai
Li Chai
Consensus overmulti-agent networks can be accelerated by utilizing agent’s memory to the control protocol. In this paper, a general protocol with memory information from the node and its neighbors is designed. We aim to provide an optimal memory scheme to accelerate consensus. The contributions of this paper include: (i) For the one-tap memory scheme, we prove that the memory information of neighbors is unnecessary for the optimal convergence. (ii) It is proved that in the worst-case scenario, one-tap node memory is sufficient to achieve the optimal convergence rate, that is, adding more taps of past information from neighbors can not improve the rate further. (iii) It is found that the convergence rate with two-tap memory can be further improved on star networks. Numerical examples are presented to illustrate the validity and correctness of the obtained results.

5 December 2022 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
JDJiahao Dai
Jiahao Dai
JYJing-Wen Yi
Jing-Wen Yi
LCLi Chai
Li Chai
In this paper, the fast consensus problem of high-order multi-agent systems (MASs) under undirected topologies is considered. The direct link between the consensus convergence rate and the control gains is established. A gradient descent based algorithm is proposed to optimize the convergence rate. By applying the Routh-Hurwitz stability criterion, the lower bound on the convergence rate is derived, and explicit control gains are derived as conditions to achieve the optimal convergence rate. Moreover, a protocol with time-varying control gains is designed to achieve the finite-time consensus. Explicit formulas for the time-varying control gains and the final consensus state are given. Numerical examples and simulation results are presented to illustrate the obtained theoretical results.

22 June 2024 in Measurement
Verified
Journal Article
Closed access
WLWei Liu
Wei Liu
PZPengwei Zhao
Pengwei Zhao
YZYunbo Zhao
Yunbo Zhao
YFYuqiang Fu
Yuqiang Fu
JDJiahao Dai
Jiahao Dai
LZLe Zhou
Le Zhou

29 July 2025 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
ZZZhenyi Zhang
Zhenyi Zhang
JDJiahao Dai
Jiahao Dai
DLDongfang Li
Dongfang Li
GLGuanghong Liu
Guanghong Liu
XXXin Xu
Xin Xu
EQEdmond Qwu
Edmond Qwu
This article addresses the cooperative control of behavior-based nonholonomic mobile vehicles (NMVs). Null-space-based behavioral control (NSBC) has limitations in the particle model and mission centralization. A novel underactuated reinforcement learning behavioral control (URLBC) approach is proposed in this article to address these limitations. An underactuated mission paradigm is prepared to replace the particle model and prevent nonholonomic constraint violations of the behavioral command. Subsequently, a distributed reinforcement learning mission supervisor is developed to determine behavioral priorities without any centralized unit, intelligently generating behavioral commands while achieving expected priority switching. Furthermore, an identifier–actor–critic behavioral controller is formulated to track behavioral commands without exact models, thus effectively reducing control costs and model dependencies. Simulation shows that URLBC has fewer unsatisfactory priority switching instances and lower cumulative control costs than existing NSBC methods. URLBC is implemented on JetAuto robots to validate its practicality.

6 August 2025 in ISA Transactions
Verified
Journal Article
Closed access
ZZZhenyi Zhang
Zhenyi Zhang
SXShuzong Xie
Shuzong Xie
ZMZhibin Mo
Zhibin Mo
JDJiahao Dai
Jiahao Dai

29 July 2024 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
JDJiahao Dai
Jiahao Dai
JYJing-Wen Yi
Jing-Wen Yi
LCLi Chai
Li Chai
Consensus, as one of the most fundamental tasks of multi-agent systems, can be accelerated by introducing the memory term into the control protocol. It has been demonstrated that on any given network, the one-tap node memory can accelerate the convergence rate, while the two-tap node memory cannot. Then, a problem arises: can the rate of consensus be further improved by adding more taps of memory? By using a novel method based on the Routh stability criterion, this paper shows that more taps of memory can further accelerate the convergence rate on special networks with star or bipartite structure. Specially, explicit formulas for the convergence rate and control parameters are derived to prove that three-tap and five-tap node memory can accelerate the convergence rate, but four-tap node memory cannot. In addition, it is found by extensive simulations that six-tap memory cannot accelerate the rate, but seven-tap memory can. Finally, a conjecture is proposed that the optimal convergence rate can be further improved when the memory taps progress from 2k to 2k+1, where kN.