Precise and optimal trajectory planning for an AGV in narrow environments with concave polygonal obstacles based on safety perception rings

Optimization-based trajectory planning for automated guided vehicles (AGVs) in narrow environments containing concave polygonal obstacles remains challenging because of the computational burden associated with collision constraints and the geometric ambiguity of non-convex obstacle regions. To address these issues, this paper proposes an optimization-based trajectory-planning framework incorporating trajectory-relevance-based obstacle activation. The trajectory-planning problem is formulated as a nonlinear optimal control problem and solved using an hp-adaptive Legendre–Gauss–Radau (LGR) pseudospectral method. A Safety Perception Ring (SPR)-based screening mechanism identifies obstacles geometrically relevant to a nominal reference trajectory before optimization, thereby reducing redundant collision constraints in the resulting nonlinear programming problem. Convex obstacles are incorporated directly using area-based collision constraints, whereas concave obstacles are converted into conservative convex-compatible representations through concave-vertex detection and iterative removal. This treatment avoids directly applying a convex-polygon area criterion to geometrically incompatible concave polygons. Furthermore, an event-triggered local trajectory re-optimization mechanism is introduced for static map updates. When a newly introduced static obstacle invalidates part of a validated reference trajectory, only the affected future interval is re-optimized, while the executed and unaffected trajectory portions are preserved. Simulation results in progressively complex polygonal environments demonstrate that the proposed framework can generate collision-free trajectories satisfying the prescribed motion constraints while reducing the number of collision constraints included in the optimization.

Authors

Institutions

Publication Details

Journal
Proceedings of the Institution of Mechanical Engineers Part D Journal of Automobile Engineering
Published
2026-11-16
DOI
https://doi.org/10.1177/09544070261506106
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Precise and optimal trajectory planning for an AGV in narrow environments with concave polygonal obstacles based on safety perception rings

Duoyang Qiu, Chen Tao, Hao Yang, Wu Bing et al.
5 links
Proceedings of the Institution of Mechanical Engineers Part D Journal of Automobile Engineering
Robotic Path Planning Algorithms
article

Precise and optimal trajectory planning for an AGV in narrow environments with concave polygonal obstacles based on safety perception rings

Duoyang Qiu, Chen Tao, Hao Yang, Wu Bing, Cheng Song, Ruolun Zhou, Wenqiang Zhou, Cong Wang
article en

Abstract

Optimization-based trajectory planning for automated guided vehicles (AGVs) in narrow environments containing concave polygonal obstacles remains challenging because of the computational burden associated with collision constraints and the geometric ambiguity of non-convex obstacle regions. To address these issues, this paper proposes an optimization-based trajectory-planning framework incorporating trajectory-relevance-based obstacle activation. The trajectory-planning problem is formulated as a nonlinear optimal control problem and solved using an hp-adaptive Legendre–Gauss–Radau (LGR) pseudospectral method. A Safety Perception Ring (SPR)-based screening mechanism identifies obstacles geometrically relevant to a nominal reference trajectory before optimization, thereby reducing redundant collision constraints in the resulting nonlinear programming problem. Convex obstacles are incorporated directly using area-based collision constraints, whereas concave obstacles are converted into conservative convex-compatible representations through concave-vertex detection and iterative removal. This treatment avoids directly applying a convex-polygon area criterion to geometrically incompatible concave polygons. Furthermore, an event-triggered local trajectory re-optimization mechanism is introduced for static map updates. When a newly introduced static obstacle invalidates part of a validated reference trajectory, only the affected future interval is re-optimized, while the executed and unaffected trajectory portions are preserved. Simulation results in progressively complex polygonal environments demonstrate that the proposed framework can generate collision-free trajectories satisfying the prescribed motion constraints while reducing the number of collision constraints included in the optimization.

Proceedings of the Institution of Mechanical Engineers Part D Journal of Automobile Engineering
Hefei University of Technology (CN), Hefei University (CN)
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.

Laika access coming soon