Skip to content

Neural-Primitive: An Efficient End-to-End Local Planner With Primitive-Based Imitation Learning for Autonomous Flight

Aug 2026 · IEEE Transactions on Industrial Informatics · 0 citations · 36 references
Computer Science

TL;DR

A lightweight offline-primitive-based dataset collection framework is designed to produce safe and high-quality trajectory primitives in non-convex environments and demonstrates superiority in both planning latency and target-reaching progress quality.

Abstract

Autonomous flight in unknown cluttered environments is hindered by the computation-quality-memory trilemma of onboard trajectory generation. In this paper, we propose an efficient end-to-end local planner via imitation learning. A lightweight offline-primitive-based dataset collection framework is designed to produce safe and high-quality trajectory primitives in non-convex environments. A compact neural network directly maps sensory inputs to polynomial coefficients that inherently encode higher-order dynamical information. The learned policy generates smooth, empirically collision-free and dynamically feasible trajectories in real time without back-end solving. It achieves ultra-fast computation (below 1ms on a standard desktop and average 3.68ms during onboard flight), while maintaining low onboard memory requirements (less than 1.5MiB). Extensive simulation benchmarks demonstrate superiority in both planning latency and target-reaching progress quality. Zero-shot deployment in real-world experiments further validates the robust sim-to-real transfer capability of the proposed method.

Read PDF

Similar papers

Preprint Aug 2026

Some Modifications to Our End-to-End UAV Planner

This report adopts a two-piece MINCO parameterization, trading time for smoothness without altering the trajectory's spatial profile, and replaces score regression with a ranking loss, preventing small score errors from reordering the candidate set.

Jun-Jie Lu, Bailing Tian · 0 citations
Oct 2026

Differentiable End-to-End UAV Navigation Using Time-of-Arrival Fields and Control Barrier Functions

Quadrotor UAVs are increasingly deployed in complex missions that demand reliable autonomous navigation and robust obstacle avoidance. Traditional modular pipelines suffer from cumulative latency, motivating a shift toward end-to-end learning-based methods. However, this paradigm still faces two fundamental challenges....

Yan-Jie Liu, Teng-Da Yang, Zi-Han Li et al. · 1 citation

EA-SAC: ENERGY-AWARE: reinforcement learning for ski-steer local navigation

Energy-efficient local navigation on skid-steer mobile robots (SSMRs) in dense environments is constrained by a structural trade-off: the low-curvature, low-power manoeuvres that minimise locomotion energy conflict with the high-curvature, high-yaw-rate corrections required to weave through dense obstacle fields withou...

Octavio Eduardo Aguila Rigordi · 0 citations
Open access Aug 2024

LSTP-Nav: Lightweight Spatiotemporal Policy for Map-Free Multi-Agent Navigation With LiDAR

This paper proposes LSTP-Nav, a lightweight, decentralized navigation framework built on LSTP-Net that maps stacked 2D LiDAR observations, goal information, and velocity feedback directly to action and introduces an HS reward to provide smooth, heading-aware safety feedback, and develops PhysReplay-SimLab to improve tr...

Xingrong Diao, Zhi-Qiang Sun, Jian-Wei Peng et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Beyond Waypoint Regression: Query-Based Cost Learning over Reachable Ego Futures for End-to-End Driving

End-to-end planners based on waypoint regression achieve strong open-loop accuracy, but they primarily learn to mimic expert geometry and remain difficult to adapt to deployment-time safety constraints. We propose a query-based cost-learning framework that estimates bounded costs for dynamically reachable ego trajector...

Ahmed Abouelazm, Rupert Polley, Qing-Yuan Zhang et al. · 0 citations
Nov 2026

Uncertainty-Calibrated Hamilton-Jacobi Value Learning for Safe Crowd Navigation

Safe navigation in human crowds requires efficiency and reliability. Learning-based policies run fast but can fail under distribution shift, whereas Hamilton–Jacobi (HJ) reachability offers principled safety guarantees but is computationally expensive. We propose a prediction-conditioned reachability framework that bri...

I. Winata, Junghyun Oh · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.