A Gradient-Free and Parallel Hierarchical Motion Planning Framework for Quadrotor Swarm

Quadrotor swarm with advanced coordination capabilities has garnered widespread attention, yet efficient and reliable motion planning remains a challenge. This paper presents a hierarchical motion planning framework for quadrotor swarm autonomous navigation in unknown, cluttered scenes. Specifically, we take a step forward sampling of multiple neighbors in the lattice graph and generate a group of paths. The infeasible paths are excluded and the one with the minimum cost is chosen from the remaining. Taking it as a guiding path, a gradient-free trajectory optimization method based on model predictive path integral (MPPI) is developed to produce the execution trajectory. Compared to gradient-descent approaches, it is capable of dealing with non-continuous and non-convex constraints. Additionally, the proposed method is deployed on GPUs in parallel to enhance efficiency. Extensive simulations demonstrate the robustness and effectiveness of the proposed motion planning framework.

Authors

Institutions

Publication Details

Published
2024-12-12
DOI
https://doi.org/10.1109/icarcv63323.2024.10821567
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
article

A Gradient-Free and Parallel Hierarchical Motion Planning Framework for Quadrotor Swarm

Bailing Tian, Qingzhao Liu, Xuewei Zhang, Hongyu Cao
Robotic Path Planning Algorithms
article

A Gradient-Free and Parallel Hierarchical Motion Planning Framework for Quadrotor Swarm

Bailing Tian, Qingzhao Liu, Xuewei Zhang, Hongyu Cao
article en

Abstract

Quadrotor swarm with advanced coordination capabilities has garnered widespread attention, yet efficient and reliable motion planning remains a challenge. This paper presents a hierarchical motion planning framework for quadrotor swarm autonomous navigation in unknown, cluttered scenes. Specifically, we take a step forward sampling of multiple neighbors in the lattice graph and generate a group of paths. The infeasible paths are excluded and the one with the minimum cost is chosen from the remaining. Taking it as a guiding path, a gradient-free trajectory optimization method based on model predictive path integral (MPPI) is developed to produce the execution trajectory. Compared to gradient-descent approaches, it is capable of dealing with non-continuous and non-convex constraints. Additionally, the proposed method is deployed on GPUs in parallel to enhance efficiency. Extensive simulations demonstrate the robustness and effectiveness of the proposed motion planning framework.

Tianjin University (CN)
Climate action, Sustainable cities and communities
Openalex Percentile: Top 75%
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.