Jianying Zheng

Jianying Zheng

Auto-generated profile, based on publicly available information

Jianying Zheng

School of Automation Science and Electrical Engineering, Beihang University, Beijing, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
31 July 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
CYChao Yang
Chao Yang
JZJiangying Zheng
Jiangying Zheng
XRXiaoqiang Ren
Xiaoqiang Ren
WYWen Yang
Wen Yang
HSHongbo Shi
Hongbo Shi
LSLing Shi
Ling Shi
In this paper, we extend the stability theory on Kalman filtering with intermittent measurements from the scenario of one single sensor to the one of multiple sensors. Consider that a group of sensors take measurement of the states of a process and then send the data to a remote estimator. The estimator receives the measurements intermittently, which may be caused by the fact that the channels have packet dropouts or that the sensors schedule the data transmission stochastically. Based on the received measurements, the estimator computes the estimates of the process states by multi-sensor Kalman filtering. Because of the intermittent measurements, the estimator may be unstable. This stability issue is mainly investigated in this paper. A notion of transmission capacity, which is related to the communication rates of sensors, is proposed. It is shown that the expected estimation error covariance diverges for all feasible communication rates collections of the sensors when the transmission capacity is below a certain value; meanwhile, when the transmission capacity is above another certain value, there exists a feasible communication rates collection such that the expected estimation error covariance is bounded.

12 June 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JZJianying Zheng
Jianying Zheng
LXLiang Xu
Liang Xu
LXLihua Xie
Lihua Xie
KYKeyou You
Keyou You
In this paper, we study the mean-square consensusability problem of discrete-time linear multi-agent systems over directed networks with constant communication delay and packet dropouts. When the packet dropouts in different communication channels are identical, the consensusability problem is transformed into a simultaneous mean-square stabilization problem of systems with constant time delay and packet dropout. When the packet dropouts are non-identical, we build the dynamics over edges based on the notion of compressed edge Laplacian for directed graphs to separate the packet dropouts from the network topology. Sufficient consensusability conditions are obtained for both cases in terms of the communication delay, the packet dropout rates, the communication network topology and the agent dynamics.

29 September 2023 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
XCXuning Chen
Xuning Chen
JZJianying Zheng
Jianying Zheng
QHQinglei Hu
Qinglei Hu
This article investigates the autonomous exploration problem of an unmanned aerial vehicle (UAV) in a fully unknown three-dimensional (3D) space, subject to the constraints of collision avoidance, energy-saving, and computation consumption. To tackle this problem, a hybrid planning algorithm named FSHP is proposed. The algorithm consists of a novel local planner designed to explore unknown space within the onboard camera’s field of view (FoV) faster and less computationally. The local planner is a combination of the frontier-based and sampling-based methods, overcoming the bottlenecks of high computational time for the former and non-heuristics for the latter. Furthermore, the algorithm incorporates a global planner based on historical information to enhance performance in larger and more complex scenarios. The global planner includes a historical road map (HRM) using the rapidly-exploring random tree (RRT) and a historical tree (HST) based on the k-dimension (k-d) tree, built simultaneously. When no informative viewpoints are nearby, the planner replans trajectories globally to unexplored space. Finally, the proposed approach is evaluated in both simulations and real-world experiments, demonstrating the effectiveness and efficiency of the FSHP. Note to Practitioners —The motivation of this paper stems from the need to develop a fast and efficient autonomous exploration algorithm for a UAV for practical applications such as 3D reconstruction, search-and-rescue and military reconnaissance. Frontier-based and sampling-based methods are widely used to solve this problem due to their heuristics and low computational effort, respectively. However, either method can not meet the requirements related to exploration efficiency arising from increasingly complex and diverse tasks. To speed up the exploration process, reduce the exploration time and shorten the exploration path length, we propose this new method FSHP. It combines the advantages of global exploration (frontier-based methods) and local exploration (sampling-based methods) with random sampling in the frontiers. Furthermore, the replanning target selection and waypoints optimization schemes helps in reducing the path. Overall, this novel framework, FSHP, enables efficient and effective autonomous exploration tasks.

29 January 2024 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
ZLZhigang Luo
Zhigang Luo
BZBing Zhu
Bing Zhu
JZJianying Zheng
Jianying Zheng
ZZZewei Zheng
Zewei Zheng
This letter proposes a robust distributed model predictive control (MPC) strategy for formation tracking of a group of wheeled vehicles subject to constraints and disturbances. Formation control has attracted significant interest because of its applications in searching and exploration [1], [2]. The objective of formation tracking is to achieve the reference formation via interactions among agents. In formation tracking, MPC can be applied to treat constrains. In [3], by sharing predictive information with neighbors, each agent uses distributed MPC strategy to generate the desired trajectory without any collision. Based on the leader-follower structure, a distributed MPC is proposed in [4] to mitigate effects caused by replay attacks. In [5], distributed MPC is applied to optimize energy scheduling.

12 May 2023 in Aerospace Science and Technology
Verified
Journal Article
Closed access
HWHan Wu
Han Wu
QHQinglei Hu
Qinglei Hu
YSYongxia Shi
Yongxia Shi
JZJianying Zheng
Jianying Zheng
KSKaipeng Sun
Kaipeng Sun
JWJiawen Wang
Jiawen Wang

4 March 2025 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
HWHan Wu
Han Wu
QHQinglei Hu
Qinglei Hu
JZJianying Zheng
Jianying Zheng
FDFei Dong
Fei Dong
ZOZhenchao Ouyang
Zhenchao Ouyang
DLDongyu Li
Dongyu Li
Linear quadratic control with unknown value functions and dynamics is extremely challenging, and most of the existing studies have focused on the regulation problem, incapable of dealing with the tracking problem. To solve both linear quadratic regulation and tracking problems for continuous-time systems with unknown value functions, this article develops a discounted inverse reinforcement learning (DIRL) method that inherits the model-independent property of reinforcement learning (RL). More specifically, we first formulate a standard paradigm for solving linear quadratic control using DIRL. To recover the value function and the target control gain, an error metric is elaborately constructed, and a quasi-Newton algorithm is adopted to minimize it. Furthermore, three DIRL algorithms, including model-based, model-free off-policy, and model-free on-policy algorithms, are proposed. The latter two rely on the expert’s demonstration data or the online observed data, requiring no prior knowledge of the system dynamics and value function. The stability, convergence, and existence conditions of multiple solutions are thoroughly analyzed. Finally, numerical simulations demonstrate the effectiveness of the theoretical results.