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.
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 limited adaptability. Recent advances in Artificial Intelligence, particularly Graph Neural Networks (GNNs), provide a more effective solution by representing robotic environments as graphs, where nodes denote robot states or waypoints and edges represent feasible movements. Through message passing and graph-based learning, GNNs capture both local and global spatial relationships, enabling efficient path planning, obstacle avoidance, and trajectory optimization in complex environments. This paper reviews major GNN architectures, including Graph Convolutional Networks (GCNs), Graph Attention Networks (GATs), GraphSAGE, and Message Passing Neural Networks (MPNNs), and discusses their applications in warehouse automation, autonomous vehicles, service robots, drones, and search-and-rescue missions. It also highlights current challenges such as limited interpretability, high training costs, insufficient benchmark datasets, and real-time deployment constraints. Overall, GNNs represent a promising direction for scalable, adaptive, and intelligent robotic motion planning.
Ken Iverson, D. Parnas· International Journal of Int...· 0 citations
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 planning methodology.
Shuli Lv, Pengda Mao, Chen Min et al.· 0 citations
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.
Zhitao Liu, Guangtong Xu, Zihan Wang et al.· 0 citations
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 signal provided by the forward and inverse models.
M. Krupa, Miroslav Cibula, Kristína Malinovská· arXiv.org· 0 citations
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 training effectiveness through local replay of near-failure interactions.
Xingrong Diao, Zhi-Qiang Sun, Jianwei Peng et al.· IEEE Transactions on Automat...· 0 citations
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 algorithm that constructs convex polytopes directly from raw point cloud data in expected linear time under a mild probabilistic elimination condition. PathCover generates sequences of overlapping, obstacle-free polytopes that safely constrain downstream MPC and trajectory optimization. We mathematically guarantee that the algorithm terminates in finite steps while ensuring continuous progress along any obstacle-free reference path. Extensive benchmarks on synthetic and real-world LiDAR datasets demonstrate an order-of-magnitude speedup over state-of-the-art methods while maintaining comparable corridor volumes. The complete pipeline is validated via high-fidelity quadrotor simulations and physical deployment on a quadrupedal robot navigating constrained environments using live LiDAR perception.
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.