Kinematic Constrained RRT Algorithm with Post Waypoint Shift for the Shortest Path Planning of Wheeled Mobile Robots
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...
Saved in:
| Main Authors: | Sisi Liu, Zhan Zhao, Jun Wei, Qianqian Zhou |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-10-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1424-8220/24/21/6948 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm
by: Yijie Zhang, et al.
Published: (2025-06-01) -
A graph algorithm for the time constrained shortest path
by: Pan Liu, et al.
Published: (2022-12-01) -
An Algorithm to Find the Shortest Path through Obstacles of Arbitrary Shapes and Positions in 2D
by: Gilles Labonté
Published: (2024-09-01) -
Control scheme for waypoint navigation of an underactuated hovercraft
by: Ricardo Y. Almazan-Arvizu, et al.
Published: (2025-12-01) -
The Shortest Path Problem for a Multiple Graph
by: Alexander V. Smirnov
Published: (2017-12-01)