Skip to content

NeuralPathLite: Fast and Robust Diffusion-Based Path Planning for Autonomous Navigation

2026 · IEEE Transactions on Automation Science and Engineering · Vol 23, pp. 12471-12485 · 0 citations · 45 references
Computer Science

Abstract

The deployment of Artificial Intelligence (AI)-based autonomous mobile robots in high-stakes environments, such as defense swarms and large-scale warehouse logistics, demands path planners that are not only theoretically optimal but scalable. While traditional search-based methods like A* guarantee resolution optimality, they suffer from exponential complexity in high-resolution maps. Conversely, sampling-based algorithms like Rapidly-exploring Random Tree* (RRT*) efficiently explore large spaces but lack path smoothness. State-of-the-art diffusion planners predominantly rely on computationally intensive backbones, rendering them unsuitable for real-time deployment where bandwidth and compute are constrained. To bridge this gap, we introduce NeuralPathLite, a lightweight neural-network-based, image-conditioned diffusion planner specifically optimized for embedded and centralized swarm architectures. Unlike prior works that struggle with visual ambiguity, we introduce a Semantic Visual Anchoring mechanism that explicitly disentangles start-goal semantics from obstacle features, preventing mode collapse in multi-colored, cluttered environments. Furthermore, we demonstrate a novel Secure Copy Protocol (SCP)-based deployment framework, exploiting our model’s low latency to enable centralized path generation for distributed robot swarms. Evaluated on the Mobile Robot Local Planning Benchmark (MRPB) and deployed on a Husky A200, NeuralPathLite achieves an inference latency of 0.16 seconds, a $7.4\times $ speedup over competing state-of-the-art methods with a 96.12% success rate in out-of-distribution scenarios. This combination of algorithmic efficiency and robust visual conditioning establishes NeuralPathLite as a viable backbone for AI-based robotic automation. The source code and dataset will be publicly available. Note to Practitioners—This paper addresses the critical challenge of deploying high-performance path planning in real-time robotic systems where computational resources are limited or environment complexity is high. While modern learning-based planners offer sophisticated results, their high inference time often makes them impractical for real-world hardware. We introduce NeuralPathLite, a fast and robust planning method designed to bridge this gap by providing high-quality, smooth paths with minimal computational overhead. Beyond the algorithm, we present a scalable Server-Client Protocol (SCP) framework specifically engineered for high-risk or large-scale deployments, such as search and rescue in hazardous zones, warehouse automation, and monitoring of life-critical environments where human access is restricted. This architecture allows for the centralized management of multiple robots using SCP to offload heavy generative compute, effectively reducing the hardware cost per unit by enabling the use of low-power AI agents without dedicated high-end Graphics Processing Units (GPUs). The system has been validated using the Husky A200 differential drive robot, demonstrating its readiness for field applications. For practitioners, this work offers a ready-to-implement strategy for managing fleets of autonomous robots economically.

View source

Similar papers

Review Open access 2025

Graph Neural Network-Based Motion Planning for Mobile Robots

Motion planning is a fundamental challenge in autonomous mobile robotics, requiring robots to navigate efficiently in dynamic and uncertain environments. Traditional algorithms such as Dijkstra, A*, RRT, and PRM perform well in structured settings but often struggle with moving obstacles, high computational costs, and...

Ken Iverson, D. Parnas · 0 citations
Review Aug 2026

VIP: Variation-based Iterative-learning Planning for Robotic Navigation

Extensive simulations and real-world experiments demonstrate that the proposed framework can efficiently generate and iteratively improve motion plans for different planning objectives, robotic platforms, and swarm configurations, highlighting its effectiveness, computational efficiency, and scalability as a general pl...

Shu-Li Lv, Pengda Mao, Chen Min et al. · 0 citations
#artificial intelligence Open access Aug 2026

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

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.

Zhi-Tao Liu, Guang-Tong Xu, Zi-Han Wang et al. · 0 citations
Jul 2026

Self-Supervised Bio-Inspired Robotic Trajectory Planning with Obstacle Avoidance

This follow-up work tests the feasibility of the neuro-inspired self-supervised learning framework for trajectory planning that leverages forward and inverse models as the internal supervisory mechanism in an environment that contains an obstacle, and demonstrates the tendency of the planner to exploit the learning sig...

M. Krupa, Miroslav Cibula, Kristína Malinovská · 0 citations
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
Preprint Aug 2026

PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds

Autonomous robot navigation requires the rapid generation of obstacle-free regions for trajectory planning. However, existing corridor generators struggle to meet real-time, sensor-rate computational constraints. To resolve this bottleneck, we introduce PathCover, a framework driven by RISP; a novel randomized algorith...

K. S. Narkhede, A. M. Kulkarni, Guoquan Huang et al. · 0 citations

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