Geometric Path Planning and Synchronization for Multiple Vehicles

In known environments, vehicles plan paths to the target and take precautions to minimize risks. Due to limited dynamics, bounded turning radii, and unfavorable initial conditions, they may be momentarily exposed to threats. In this study, we propose multi-objective real-time optimization based on Dubins paths for multiple vehicles. They synchronize target arrival by reasonably changing speeds and selecting paths of similar lengths. The closer the threats are to the robots and the target, the more path options are available. Risk is reduced in path planning by minimizing the duration of exposure to threats. Vehicles strike a balance between exposure to threats and travel time to targets. We use a probability-based approach to reduce the computation burden and select satisfactory paths such that vehicles synchronize target arrival reasonably far away from threats. The performances of the proposed methods are verified in several simulation examples.

Authors

Institutions

Publication Details

Journal
Robotics
Published
2025-04-11
DOI
https://doi.org/10.3390/robotics14040047
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

Geometric Path Planning and Synchronization for Multiple Vehicles

Hongjun Yu, Lanyong Zhang
Robotics
Robotic Path Planning Algorithms
article

Geometric Path Planning and Synchronization for Multiple Vehicles

Hongjun Yu, Lanyong Zhang
article en

Abstract

In known environments, vehicles plan paths to the target and take precautions to minimize risks. Due to limited dynamics, bounded turning radii, and unfavorable initial conditions, they may be momentarily exposed to threats. In this study, we propose multi-objective real-time optimization based on Dubins paths for multiple vehicles. They synchronize target arrival by reasonably changing speeds and selecting paths of similar lengths. The closer the threats are to the robots and the target, the more path options are available. Risk is reduced in path planning by minimizing the duration of exposure to threats. Vehicles strike a balance between exposure to threats and travel time to targets. We use a probability-based approach to reduce the computation burden and select satisfactory paths such that vehicles synchronize target arrival reasonably far away from threats. The performances of the proposed methods are verified in several simulation examples.

RoboticsVol. 14(4)
The University of Sydney (AU), Harbin Engineering University (CN), Australian Centre for Robotic Vision (AU)
National Natural Science Foundation of China
Openalex Percentile: Top 94%
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.