Real-Time Trajectory Planning Framework for UAV in Unknown and Dynamic Environment

This paper introduces a novel trajectory planning framework for unmanned aerial vehicles (UAV) navigating in unknown and dynamic environments. Our approach uses an enhanced Simple Online and Realtime Tracking (SORT) algorithm adapted for three-dimensional space to track dynamic obstacles in real time. Future trajectories of these obstacles are predicted by Bezier curves, with an analytical solution obtained through the Lagrange multiplier method. This allows for fast computations, making the method well-suited for scenarios with multiple dynamic obstacles. The framework also extends traditional path planning and trajectory optimization techniques to handle dynamic collisions effectively. A key feature is its ability to detect and respond to hazardous areas created by blind spots, enabling proactive avoidance of potential collisions with unseen dynamic obstacles. Both simulations and real-world experiments validate the effectiveness of our approach, demonstrating its ability to navigate complex and dynamic environments efficiently and safely.

Authors

Institutions

Publication Details

Published
2024-12-10
DOI
https://doi.org/10.1109/robio64047.2024.10907509
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

Real-Time Trajectory Planning Framework for UAV in Unknown and Dynamic Environment

Zheyuan Mei
Robotic Path Planning Algorithms
article

Real-Time Trajectory Planning Framework for UAV in Unknown and Dynamic Environment

Zheyuan Mei
article en

Abstract

This paper introduces a novel trajectory planning framework for unmanned aerial vehicles (UAV) navigating in unknown and dynamic environments. Our approach uses an enhanced Simple Online and Realtime Tracking (SORT) algorithm adapted for three-dimensional space to track dynamic obstacles in real time. Future trajectories of these obstacles are predicted by Bezier curves, with an analytical solution obtained through the Lagrange multiplier method. This allows for fast computations, making the method well-suited for scenarios with multiple dynamic obstacles. The framework also extends traditional path planning and trajectory optimization techniques to handle dynamic collisions effectively. A key feature is its ability to detect and respond to hazardous areas created by blind spots, enabling proactive avoidance of potential collisions with unseen dynamic obstacles. Both simulations and real-world experiments validate the effectiveness of our approach, demonstrating its ability to navigate complex and dynamic environments efficiently and safely.

Shanghai Jiao Tong University (CN), State Key Laboratory of Mechanical System and Vibration
Sustainable cities and communities
Openalex Percentile: Top 72%
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.