Lihua Dou

Lihua Dou


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
24 February 2015 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
JHJie Huang
Jie Huang
LDLihua Dou
Lihua Dou
HFHao Fang
Hao Fang
JCJie Chen
Jie Chen
Qingkai YangQingkai Yang
Qingkai Yang

16 March 2018 in Sensors
Verified
Journal Article
Open access
PDF file
XZXu Zhao
Xu Zhao
LDLihua Dou
Lihua Dou
ZSzhong su
zhong su
NLNing Liu
Ning Liu
A snake robot is a type of highly redundant mobile robot that significantly differs from a tracked robot, wheeled robot and legged robot. To address the issue of a snake robot performing self-localization in the application environment without assistant orientation, an autonomous navigation method is proposed based on the snake robot’s motion characteristic constraints. The method realized the autonomous navigation of the snake robot with non-nodes and an external assistant using its own Micro-Electromechanical-Systems (MEMS) Inertial-Measurement-Unit (IMU). First, it studies the snake robot’s motion characteristics, builds the kinematics model, and then analyses the motion constraint characteristics and motion error propagation properties. Second, it explores the snake robot’s navigation layout, proposes a constraint criterion and the fixed relationship, and makes zero-state constraints based on the motion features and control modes of a snake robot. Finally, it realizes autonomous navigation positioning based on the Extended-Kalman-Filter (EKF) position estimation method under the constraints of its motion characteristics. With the self-developed snake robot, the test verifies the proposed method, and the position error is less than 5% of Total-Traveled-Distance (TDD). In a short-distance environment, this method is able to meet the requirements of a snake robot in order to perform autonomous navigation and positioning in traditional applications and can be extended to other familiar multi-link robots.

15 July 2021 in Sensors
Verified
Journal Article
Open access
PDF file
CTChao Tang
Chao Tang
CHChengyang He
Chengyang He
LDLihua Dou
Lihua Dou
In this article, a multisensor joint localization system is proposed based on modified cubature Kalman filtering, which aims to improve the accuracy of state estimation under a moderate computational burden in the presence of high process noise. Specifically, first, the covariance of process noise is matched based on adaptive filtering. The inertial measurement unit (IMU), odometer (ODM), and ultra-wideband (UWB) information acquired by the associated sensors is then employed to augment the system state and are fused to lower the influence of process noise. In the presented localization setting, all sensors (IMU/ODM/UWB) are set to work in parallel under the federated Kalman filter (FKF) framework, which can correct the cumulative error of the internal sensor and and can improve the computational efficiency. Two sets of numerical simulations were performed to show that the proposed method can obtain accurate state estimation with a slightly increased computational burden.

29 September 2020 in Sensors
Verified
Journal Article
Open access
PDF file
CTChao Tang
Chao Tang
LDLihua Dou
Lihua Dou
In this article, an improved game theory-based co-localization algorithm is proposed to precisely and cooperatively locate the multi-robot system in the wireless sensor network and efficiently eliminate the information conflict caused by multi-sensor. Specifically, the extended Kalman filter in the original algorithm is replaced by the unscented Kalman filter in the optimized algorithm, which contributes to lower linearization errors and higher localization precision. Then, the computational complexity is analyzed, and the derivative method is introduced to reduce the extra computation burden brought by the unscented Kalman filter. Subsequently, the stability issue resulting from the derivative method is addressed by introducing the singular value decomposition (SVD). In this context, the optimized algorithm is capable of precisely locating the multi-robot system, while maintaining the stability and not increasing the computational burden. Moreover, as demonstrated by the simulation results, the optimized algorithm has greater localization precision than the original algorithm, while they have similar computational burdens.

19 December 2022 in Electronics
Verified
Journal Article
Open access
PDF file
RZRuowei Zhang
Ruowei Zhang
LDLihua Dou
Lihua Dou
QWQing Wang
Qing Wang
BXBin Xin
Bin Xin
YDYulong Ding
Yulong Ding
For indoor multi-task planning problems of small unmanned aerial vehicles (UAVs) with different abilities, task assignment and path planning play a crucial role. The multi-dimensional requirements of reconnaissance tasks bring great difficulties to the task execution of multi-UAV cooperation. Meanwhile, the complex internal environment of buildings has a great impact on the path planning of UAVs. In this paper, the ability-restricted indoor reconnaissance task-planning (ARIRTP) problem is solved by a bi-level problem-solving framework. In the upper level, an iterative search algorithm is used to solve the task assignment problem. According to the characteristics of the problem, a solution-space compression mechanism (SSCM) is proposed to exclude solutions that do not satisfy the task requirements. In the lower level, based on a topological map, the nearest neighbor (NN) algorithm is used to quickly construct the path sequence of a UAV. Finally, the genetic algorithm (GA) and simulated annealing (SA) algorithm are applied to the upper level of the framework as iterative search algorithms, which produces two hybrid algorithms named the GA-NN and SA-NN, respectively. ARIRTP instances of different scales are designed to verify the effectiveness of the SSCM and the performance of the GA-NN and SA-NN methods. It is demonstrated that the SSCM can significantly compress the solution space and effectively improve the performance of the algorithms. The proposed bi-level problem-solving framework provides a methodology for the cooperation of multi-UAV to perform reconnaissance tasks in indoor environments. The experimental results show that the GA-NN and SA-NN methods can quickly and efficiently solve the ARIRTP problem. The performance of the GA-NN method is similar to that of the SA-NN method. The GA-NN method runs slightly faster. In large-scale instances, the performance of the SA-NN method is slightly better than that of the GA-NN method.

1 July 2023 in Chinese Journal of Electronics
Verified
Journal Article
Closed access
CTChao Tang
Chao Tang
YXYinqiu Xia
Yinqiu Xia
LDLihua Dou
Lihua Dou
This paper investigates the multi-sensor fused localization of moving targets in a wireless sensor network. Each ultra-wide band (UWB) sensor is assigned a stability weight according to its survival time prediction. The measurement accuracy of each sensor into the constraints of the weight distribution based on the interactive multi-model method, a double weight distribution algorithm that considers measurement accuracy and stability is proposed. Based on the double weight algorithm, the measurement information of each UWB sensor, the inertial measurement unit (IMU)-based state vector and the UWB-based state vector by federated Kalman filter are integrated to realize the correction of the IMU. Finally, several numerical simulations are performed to show that the proposed algorithm can effectively suppress the measurement dropout when tracking moving targets in a wireless sensor network, and it can also automatically adjust the weight of each sensor based on the measurement error covariance to improve the tracking accuracy.