Dictionary-Labeled A*: Optimal Path-and-Posture Planning for Mobile Robots With Turning Radius Constraints

In this letter, we introduce an algorithm called Dictionary-Labeled A* (DL-A*), which addresses the critical problem of path-and-posture planning for mobile robots with turning radius constraints. DL-A* utilizes a dictionary to store and process multi-element information within an enhanced topological map. The algorithm categorizes the edges in the map into forward driving and reverse driving states, and constructs sets of successive states that adhere to road segment constraints through map pre-processing. Subsequently, the A* algorithm is employed to find an optimal path to reach the endpoint while satisfying the end posture constraint, with the objective of minimizing the total travelling cost. Simulation results demonstrate that, in comparison to other popular algorithms, our algorithm offers the capability to adapt the robot's forward and reverse driving postures to minimize total cost, and exhibits exceptional searching efficiency.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2024-10-09
DOI
https://doi.org/10.1109/lra.2024.3477097
Citations
3
Primary Topic
Robotic Mechanisms and Dynamics
Type
article
Field-Weighted Citation Impact
0.98

Funders

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

Dictionary-Labeled A*: Optimal Path-and-Posture Planning for Mobile Robots With Turning Radius Constraints

Zhiyun Lin, Yang Chen
3 citations
IEEE Robotics and Automation Letters
Robotic Mechanisms and Dynamics
0.98
article

Dictionary-Labeled A*: Optimal Path-and-Posture Planning for Mobile Robots With Turning Radius Constraints

Zhiyun Lin, Yang Chen
article en
3 citations

Abstract

In this letter, we introduce an algorithm called Dictionary-Labeled A* (DL-A*), which addresses the critical problem of path-and-posture planning for mobile robots with turning radius constraints. DL-A* utilizes a dictionary to store and process multi-element information within an enhanced topological map. The algorithm categorizes the edges in the map into forward driving and reverse driving states, and constructs sets of successive states that adhere to road segment constraints through map pre-processing. Subsequently, the A* algorithm is employed to find an optimal path to reach the endpoint while satisfying the end posture constraint, with the objective of minimizing the total travelling cost. Simulation results demonstrate that, in comparison to other popular algorithms, our algorithm offers the capability to adapt the robot's forward and reverse driving postures to minimize total cost, and exhibits exceptional searching efficiency.

IEEE Robotics and Automation LettersVol. 9(12)
Southern University of Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 23%
Robotic Mechanisms and Dynamics
0.98
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.

Dictionary-Labeled A*: Optimal Path-and-Posture Planning for Mobile Robots With Turning Radius Constraints — Zhiyun Lin, Yang Chen · IEEE Robotics and Automation Letters (2024) | TGRS Research Map | TGRS