EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Kinematic Constrained RRT Algorithm with Post Waypoint Shift for the Shortest Path Planning of Wheeled Mobile Robots

Sisi Liu iD, Zhan Zhao iD, Jun Wei, Qianqian Zhou

Sensors · 29.10.2024 · 24 (21) · 6948

DOI: 10.3390/s24216948 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 29.10.2024. Verfasst von Sisi Liu und 3 weiteren Autor:innen. Beteiligte Einrichtung: School of Agricultural Engineering, Jiangsu University, Zhenjiang 212013, China. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: the National Natural Science Foundation of China, the National Key Research and Development Program of China, National Natural Science Foundation of China.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper presents a rapidly exploring random tree (RRT) algorithm with an effective post waypoint shift, which is suitable for the path planning of a wheeled mobile robot under kinematic constraints. In the growth of the exploring tree, the nearest node that satisfies the kinematic constraints is selected as the parent node. Once the distance between the new node and the target is within a certain threshold, the tree growth stops and a target connection based on minimum turning radius arc is proposed to generate an initial complete random path. The most significant difference from traditional RRT-based methods is that the proposed method optimizes the path based on Dubins curves through a post waypoint shift after a random path is generated, rather than through parent node selection and rewiring during the exploring tree growth. Then, it is proved that the method can obtain an optimal path in terms of the shortest length. The optimized path has good convergence and almost does not depend on the state of the initial random path. The comparative test results show that the proposed method has significant advantages over traditional RRT-based methods in terms of the sampling point number, the tree node number, and the path node number. Subsequently, an efficient method is further proposed to avoid unknown obstacles, which utilizes the original path information and thus effectively improves the new path planning efficiency. Simulations and real-world tests are carried out to demonstrate the effectiveness of this method.

Schlagwörter

Stichwörter der Autor:innen

kinematic constraintspost waypoint shiftrapidly exploring random treeshortest path planningwheeled mobile robots

Autor:innen und Institutionen

  • School of Agricultural Engineering, Jiangsu University, Zhenjiang 212013, China.

ORCID-Profile: Sisi Liu, Zhan Zhao

Förderung

  • the National Natural Science Foundation of China
  • the National Key Research and Development Program of China
  • National Natural Science Foundation of China
  • National Key Research and Development Program of China
  • Priority Academic Program Development of Jiangsu Higher Education Institutions

Zitieren

APA

Liu, S., Zhao, Z., Wei, J., & Zhou, Q. (2024). Kinematic Constrained RRT Algorithm with Post Waypoint Shift for the Shortest Path Planning of Wheeled Mobile Robots. Sensors, 24(21), 6948. https://doi.org/10.3390/s24216948

Vancouver

Liu S, Zhao Z, Wei J, Zhou Q. Kinematic Constrained RRT Algorithm with Post Waypoint Shift for the Shortest Path Planning of Wheeled Mobile Robots. Sensors. 2024;24(21):6948. doi:10.3390/s24216948

BibTeX
@article{Liu2024,
  author = {Liu, Sisi and Zhao, Zhan and Wei, Jun and Zhou, Qianqian},
  title = {Kinematic Constrained RRT Algorithm with Post Waypoint Shift for the Shortest Path Planning of Wheeled Mobile Robots},
  journal = {Sensors},
  year = {2024},
  volume = {24},
  number = {21},
  pages = {6948},
  doi = {10.3390/s24216948}
}
Kostenlos starten →