A decoupled time-optimized multi-robot path parameterization method

This paper presents a decoupled time-optimized path parameterization method for coordinating multiple robots with kinodynamic constraints in shared workspaces, where each robot follows a predefined geometric path. The proposed approach first computes time-optimal trajectories for individual robots using the Time-Optimal Path Parameterization (TOPP) algorithm, then resolves inter-robot collisions through strategically calculated start-time delays. By introducing the concept of Generalized Collision Regions (GCRs) in coordination space and developing an efficient algorithm to compute delay collision intervals, our method guarantees collision-free motion while minimizing the total operation time. The solution is formulated as a convex optimization problem with linear constraints, enabling efficient computation. Experimental validation using both robotic arms and car-like robots demonstrates the method’s effectiveness.

Authors

Institutions

Publication Details

Journal
Complex & Intelligent Systems
Published
2025-11-06
DOI
https://doi.org/10.1007/s40747-025-02110-5
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

A decoupled time-optimized multi-robot path parameterization method

Yongsheng Luo, Jie Zhao, Kaixuan Li, Xianchao Sun et al.
Complex & Intelligent Systems
Robotic Path Planning Algorithms
article

A decoupled time-optimized multi-robot path parameterization method

Yongsheng Luo, Jie Zhao, Kaixuan Li, Xianchao Sun, Gangfeng Liu
article en

Abstract

This paper presents a decoupled time-optimized path parameterization method for coordinating multiple robots with kinodynamic constraints in shared workspaces, where each robot follows a predefined geometric path. The proposed approach first computes time-optimal trajectories for individual robots using the Time-Optimal Path Parameterization (TOPP) algorithm, then resolves inter-robot collisions through strategically calculated start-time delays. By introducing the concept of Generalized Collision Regions (GCRs) in coordination space and developing an efficient algorithm to compute delay collision intervals, our method guarantees collision-free motion while minimizing the total operation time. The solution is formulated as a convex optimization problem with linear constraints, enabling efficient computation. Experimental validation using both robotic arms and car-like robots demonstrates the method’s effectiveness.

Complex & Intelligent SystemsVol. 12(1)
Harbin Institute of Technology (CN)
National Natural Science Foundation of China, National Defense Basic Scientific Research Program of China
Openalex Percentile: Top 67%
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.

A decoupled time-optimized multi-robot path parameterization method — Yongsheng Luo, Jie Zhao, et al. · Complex & Intelligent Systems (2025) | TGRS Research Map | TGRS