Towards Efficient Path Finding and Moving Stability-Focused Trajectory Planning for Mobile Robots

Nowadays, mobile robots play an important role in a variety of service scenarios. They need to plan and track trajectories to accomplish tasks such as delivery or guided tours. In such tasks, there are two remaining challenges: on one hand, the time and memory consumption of present path planners are still significant; on the other hand, service robots, which have a higher center of gravity, demand greater moving stability than that of current trajectory planners provide. To address these two challenges. Firstly, we propose a safety boundary first A* which fully utilizes environmental obstacle information to create a safety boundary and searches in it to quickly find an initial path. Secondly, we formulate the trajectory optimization problem as a nonlinear optimization problem, where the smoothness, safety, feasibility, and moving stability of the robot are taken into account. Furthermore, to constrain the robot's lateral acceleration, we design a time allocation algorithm based on non-uniform B-spline, enhancing the quality of the resulting trajectory. Simulations and real-world experiments demonstrate that our algorithms significantly improve path search efficiency, enhance moving stability, reduce the difficulty of tracking, and improve the quality of task completion.

Authors

Institutions

Publication Details

Published
2024-12-10
DOI
https://doi.org/10.1109/robio64047.2024.10907636
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Towards Efficient Path Finding and Moving Stability-Focused Trajectory Planning for Mobile Robots

Yong Wang, Z. H. Lei, Min Hou, Le Xie et al.
Robotic Path Planning Algorithms
article

Towards Efficient Path Finding and Moving Stability-Focused Trajectory Planning for Mobile Robots

Yong Wang, Z. H. Lei, Min Hou, Le Xie, Haidong Hu, Zhong Wang, Hesheng Wang
article en

Abstract

Nowadays, mobile robots play an important role in a variety of service scenarios. They need to plan and track trajectories to accomplish tasks such as delivery or guided tours. In such tasks, there are two remaining challenges: on one hand, the time and memory consumption of present path planners are still significant; on the other hand, service robots, which have a higher center of gravity, demand greater moving stability than that of current trajectory planners provide. To address these two challenges. Firstly, we propose a safety boundary first A* which fully utilizes environmental obstacle information to create a safety boundary and searches in it to quickly find an initial path. Secondly, we formulate the trajectory optimization problem as a nonlinear optimization problem, where the smoothness, safety, feasibility, and moving stability of the robot are taken into account. Furthermore, to constrain the robot's lateral acceleration, we design a time allocation algorithm based on non-uniform B-spline, enhancing the quality of the resulting trajectory. Simulations and real-world experiments demonstrate that our algorithms significantly improve path search efficiency, enhance moving stability, reduce the difficulty of tracking, and improve the quality of task completion.

Ministry of Education of the People's Republic of China (CN), Shanghai Jiao Tong University (CN), China University of Mining and Technology (CN)
National Natural Science Foundation of China
Sustainable cities and communities
Openalex Percentile: Top 72%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.