Jiayuan Yan

Jiayuan Yan

Auto-generated profile, based on publicly available information

Jiayuan Yan

School of Artificial Intelligence, Henan University, Zhengzhou, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
19 September 2024 in ISA Transactions
Verified
Journal Article
Closed access
DZDehua Zhang
Dehua Zhang
YWYuchen Wang
Yuchen Wang
LMLei Meng
Lei Meng
JYJiayuan Yan
Jiayuan Yan
Chunbin QinChunbin Qin
Chunbin Qin

12 July 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
LZLin Zhou
Lin Zhou
MZMeng Zhang
Meng Zhang
QWQian Wei
Qian Wei
YJYong JIN
Yong JIN
SWSaidi Wang
Saidi Wang
JYJiayuan Yan
Jiayuan Yan
In wireless sensor networks (WSNs), conventional clustering routing algorithms often lead to uneven distribution of cluster heads (CHs), resulting in imbalanced and high energy consumption. Addressing these challenges, this study introduces a novel algorithm, termed the energy distance function-based improved K-Means algorithm (EDFIKM). This algorithm synthesizes the principles of the low energy adaptive clustering hierarchy (LEACH) with the K-Means clustering methodology. Key to this approach is the formulation of an adaptive weighted energy distance function that accounts for nodes’ residual energy, their proximity to cluster centers, and dynamic weights for energy and distance factors. This function strategically mitigates the randomness in CH selection. Incorporating this function into the K-Means clustering process achieves a more uniform distribution of CHs and an equitable allocation of nodes across clusters. Importantly, this contributes to a balanced energy load and a reduction in overall network energy consumption. Simulation studies validate that the EDFIKM algorithm efficiently lowers network energy demands and extends the network lifespan, without adding to the time complexity.

9 February 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JYJiayuan Yan
Jiayuan Yan
BHBin Hu
Bin Hu
ZGZhi-Hong Guan
Zhi-Hong Guan
In this paper, the controllability is investigated for nonlinear impulsive and switching systems with input delay. Using the fixed point method, two controllability conditions are developed for such systems under different nonlinear constraints. First, a Lipschitz nonlinearity is considered. A control mapping is constructed based on the input matrix condition, and a nonlinear operator is introduced to convert the controllability into the existence of a fixed point. A sufficient controllability condition is obtained under the Banach's contraction mapping principle. Secondly, a linear growth condition is imposed on the nonlinearity. A switched control mapping is constructed using the inverse of controllability matrix, and a corresponding nonlinear operator is introduced. An alternative controllability condition is then developed by resorting to the Rothe's fixed point theorem. It is shown that the system controllability can be influenced by the impulsive and switching factors, beyond the delayed part and the nonlinearity. Two numerical examples are given to verify the two controllability conditions.

28 December 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
QXQiyang Xiao
Qiyang Xiao
MYMaolin Yang
Maolin Yang
JYJiayuan Yan
Jiayuan Yan
Wentao ShiWentao Shi
Wentao Shi
In real engineering scenarios, the complex and variable operating conditions of mechanical equipment lead to distributional differences between the collected fault data and the training data. This distribution difference can lead to the failure of deep learning-based diagnostic models. Extracting generalized diagnostic knowledge from the source domain in scenarios where the target domain is not visible is the key to solving this problem. To this end, in this paper, we propose a domain generalization network for diagnosing bearing faults under unknown operating conditions, i.e., Feature Decoupled Integrated Domain Generalization Network (FDIDG). First, we propose a “feature decoupling” algorithm to uncover generalized representations of fault features from multiple source domains. The algorithm aims to explore the generalized representations of fault features by shrinking the distribution of data from multiple source domains and further generalize the fault features to unknown domains to reduce the coupling between fault features and operating conditions. Second, the diagnostic accuracy of the model under unknown operating conditions is further improved by adopting a multi-expert integration strategy in the decision-making stage and utilizing domain-private features to reduce the negative impact of edge samples on diagnosis. We conducted several sets of cross-domain experiments on both public and private datasets, and the results show that FDIDG has excellent generalization capabilities.

12 June 2025 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
ZCZhenquan Chen
Zhenquan Chen
ZZZhiheng Zhang
Zhiheng Zhang
JYJiayuan Yan
Jiayuan Yan
MZMaiying Zhong
Maiying Zhong
LLLingling Lv
Lingling Lv
YHYandong Hou
Yandong Hou
This article investigates the problem of fault estimation in nonlinear uncertain manipulator systems with time-delay. A novel fault estimation scheme is proposed, which optimizes the iterative learning (IL) estimator performance using a neural network (NN)-based reinforcement learning (RL) approach. Specifically, first, with the purpose of enhancing robustness and adaptability of RL, a new adaptive exponential reward function is designed. Then, to improve the performance of fault estimation, speed and accuracy are designed as optimization objectives. Simultaneously, by leveraging the IL estimator, the NN is continuously optimized in each iteration process to mitigate the issues of gradient vanishing and explosion. Further, by incorporating the H$\mathrm{\infty }$ performance index into the observer, an asymptotically convergent estimated error can be attained. Finally, numerical simulations are conducted to demonstrate the effectiveness of our method.

7 March 2025 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
LSLei Shi
Lei Shi
YZYi Zhou
Yi Zhou
LFLe Fu
Le Fu
NNnianwen ning
nianwen ning
JYJiayuan Yan
Jiayuan Yan
QQQian Qiu
Qian Qiu
Consensus is a common opinion evolution phenomenon in social networks. Existing studies generally believe that opinion consensus is easy to reach when the network is connected and only trust relationships exist among agents. Distinguishing from existing studies, this paper aims to explore how to reach opinion consensus on leader-follower signed social networks with both trust and distrust relationships among agents. With the help of theoretical tools including binary relation composition and products of nonnegative matrices, the inequality constraints for trust and distrust degrees are established, which ensures that trust relationships can counteract the negative effects of distrust relationships on opinion consensus. In addition, further analysis is conducted on the factors that affect the convergence rate of opinion consensus, including the longest positive distance from leader to the followers as well as the upper bound of communication delays. At last, numerical examples are provided to validate the results.