Jinglin Liang

Jinglin Liang

Auto-generated profile, based on publicly available information

Jinglin Liang

School of Mechanical Engineering and Automation, Fuzhou University, Fuzhou, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
3 May 2021 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
ZWZheng Wu
Zheng Wu
YCYanjie Chen
Yanjie Chen
JLJinglin Liang
Jinglin Liang
BHBingwei He
Bingwei He
YWYaonan Wang
Yaonan Wang
This article introduces a secure tunnel fast marching tree motion planning algorithm (ST-FMT*) to provide a secure and optimal path quickly for a mobile robot. The proposed ST-FMT* consists of preprocessing and exploring procedures, which are responsible for establishing a secure tunnel and optimizing the path, respectively. In the preprocessing process, the generalized Voronoi graph is adopted to build an equidistant roadmap and generates an initial collision-free solution rapidly. Then, a secure tunnel is established via the minimum distance from the obstacles to the initial solution to facilitate the concentration of sampling. In the exploration process, the FMT* with uniform sampling within the secure tunnel is utilized to find the optimal solution with high computational efficiency. The theoretical analyses of the ST-FMT* are provided. In a series of scenarios evaluation, the ST-FMT* exhibits fast convergence to the optimal solution in different environments. Besides, the effectiveness of the ST-FMT* is verified in a transportation experiment using a Turtlebot2 mobile robot.

1 January 2021 in Computers, Materials & Continua
Verified
Journal Article
Open access
QSQian Sun
Qian Sun
ZSZhiping Shen
Zhiping Shen
JLJinglin Liang
Jinglin Liang
XWXiaoyi Wang
Xiaoyi Wang
继许继平 许
继平 许
RWRuichao Wang
Ruichao Wang
Water quality sensor networks are promising tools for the exploration of oceans. Some key areas need to be monitored effectively. Water quality sensors are deployed randomly or uniformly, however, and understanding how to deploy sensor nodes reasonably and realize effective monitoring of key areas on the basis of monitoring the whole area is an urgent problem to be solved. Additionally, energy is limited in water quality sensor networks. When moving sensor nodes, we should extend the life cycle of the sensor networks as much as possible. In this study, sensor nodes in non-key monitored areas are moved to key areas. First, we used the concentric circle method to determine the mobile sensor nodes and the target locations. Then, we determined the relationship between the mobile sensor nodes and the target locations according to the energy matrix. Finally, we calculated the shortest moving path according to the Floyd algorithm, which realizes the redeployment of the key monitored area. The simulation results showed that, compared with the method of direct movement, the proposed method can effectively reduce the energy consumption and save the network adjustment time based on the effective coverage of key areas.