Aggressive Collision-Inclusive Motion Planning

Traditional drone systems typically prioritize collision avoidance as a fundamental tenet of their motion planning paradigms. Nevertheless, in some narrow scenarios, collisions might be inevitable. Notably, collisions can be strategically employed to minimize task duration and energy consumption. This article delves into the intriguing realm of actively and reasonably utilizing collisions for aggressive motion planning. To generate aggressive collision-utilized primitives, we design a sample-based front-end called improved collision-inclusive rapidly-exploring random trees, which solves linear quadratic minimum time problems. Unlike traditional derivative rapidly-exploring random trees, the generated primitives undergo deformation when collisions are detected rather than being discarded. To achieve better collision actions, a collision-utilized trajectory optimization is constructed, with the core being the design of a maneuverability constraint and a collision relaxation constraint. The corresponding constraint elimination and transcription methods are proposed to accelerate the solving process. Finally, the constrained trajectory optimization is transformed into an unconstrained optimization problem that can be solved within <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\text{6}\,\text{ms}$</tex-math></inline-formula>. To determine whether to implement collisions, we propose a receding horizon decision strategy where the decision between collision-utilized and collision-free trajectories is made by minimizing the time cost within each horizon. The integrated collision-inclusive planning system enables robots to judiciously weigh the risks and benefits of collisions, allowing them to autonomously decide whether and how to engage in such interactions. Extensive experiments verify the effectiveness, capability, advancement, and robustness of our proposed method, showing that the strategic utilization of collisions can enhance aggressiveness in narrow environments, opening up a new perspective for motion planning.

Authors

Institutions

Publication Details

Journal
IEEE/ASME Transactions on Mechatronics
Published
2024-10-16
DOI
https://doi.org/10.1109/tmech.2024.3423419
Citations
3
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.75
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Aggressive Collision-Inclusive Motion Planning

Zhi Zheng, Guodong Lu, Jie Tu, Fei Gao et al.
3 citations
IEEE/ASME Transactions on Mechatronics
Robotic Path Planning Algorithms
0.75
article

Aggressive Collision-Inclusive Motion Planning

Zhi Zheng, Guodong Lu, Jie Tu, Fei Gao, Jingjing Li, Jin Wang, Huan Yu, C. Hu
article en
3 citations

Abstract

Traditional drone systems typically prioritize collision avoidance as a fundamental tenet of their motion planning paradigms. Nevertheless, in some narrow scenarios, collisions might be inevitable. Notably, collisions can be strategically employed to minimize task duration and energy consumption. This article delves into the intriguing realm of actively and reasonably utilizing collisions for aggressive motion planning. To generate aggressive collision-utilized primitives, we design a sample-based front-end called improved collision-inclusive rapidly-exploring random trees, which solves linear quadratic minimum time problems. Unlike traditional derivative rapidly-exploring random trees, the generated primitives undergo deformation when collisions are detected rather than being discarded. To achieve better collision actions, a collision-utilized trajectory optimization is constructed, with the core being the design of a maneuverability constraint and a collision relaxation constraint. The corresponding constraint elimination and transcription methods are proposed to accelerate the solving process. Finally, the constrained trajectory optimization is transformed into an unconstrained optimization problem that can be solved within <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\text{6}\,\text{ms}$</tex-math></inline-formula>. To determine whether to implement collisions, we propose a receding horizon decision strategy where the decision between collision-utilized and collision-free trajectories is made by minimizing the time cost within each horizon. The integrated collision-inclusive planning system enables robots to judiciously weigh the risks and benefits of collisions, allowing them to autonomously decide whether and how to engage in such interactions. Extensive experiments verify the effectiveness, capability, advancement, and robustness of our proposed method, showing that the strategic utilization of collisions can enhance aggressiveness in narrow environments, opening up a new perspective for motion planning.

IEEE/ASME Transactions on MechatronicsVol. 30(2)
State Key Laboratory of Industrial Control Technology (CN), Zhejiang University (CN)
Openalex Percentile: Top 27%
Robotic Path Planning Algorithms
0.75
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.