Performance Comparison of Classical and Neural Sampling Algorithms for Robotic Navigation

• URL: http://arxiv.org/abs/2605.25010v1
• Date: Sun, 24 May 2026 11:27:31 GMT
• Title: Performance Comparison of Classical and Neural Sampling Algorithms for Robotic Navigation
• Abstract summary: Three algorithms, namely RRT*, Neural RRT*, and Neural Informed RRT*, are implemented and evaluated.<n>Results indicate that neural-guided planners improve path quality, producing up to 14% shorter paths and 55--75% smoother trajectories.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Integrating artificial intelligence (AI) into sampling-based motion planning provides new possibilities for improving autonomous navigation efficiency. In this paper, three algorithms, namely RRT*, Neural RRT*, and Neural Informed RRT*, are implemented and evaluated on environments containing convex and concave obstacles with different obstacle densities. The obtained results indicate that neural-guided planners improve path quality, producing up to 14\% shorter paths and 55--75\% smoother trajectories compared with the conventional RRT* algorithm. Among the evaluated methods, Neural Informed RRT* achieves the best overall performance in terms of path length and trajectory smoothness. These results demonstrate the effectiveness of AI-guided sampling strategies for improving reliability and trajectory efficiency in robotic and UAV navigation, despite a slight increase in computation time. Overall, the study highlights the growing importance of artificial intelligence in real-time robotic path planning applications.

Related papers

• Invertible Neural Network Adapter for One-Step Flow Matching in Robot Manipulation [48.77928097573051]
  This paper presents an invertible neural network adapter for general robotic manipulation.<n>Built upon a flow-matching formulation, the proposed adapter constrains the action generation trajectory within an invertible latent space.<n>Experiments are conducted across a diverse set of simulation benchmarks and real-world robotic platforms to evaluate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2026-06-17T15:35:27Z)
• Convex-Neural RRT*: Fast and Reliable Learning-Guided Sampling for High-Quality Robot Path Planning [0.0]
  This paper proposes Convex-Neural RRT*, an enhanced RRT* variant that incorporates neural guidance to predict informative waypoint regions near high-quality paths.<n>The proposed algorithm is evaluated against Neural RRT*, Neural Informed RRT*, classical RRT*, and LTA* across three environment types and 18 benchmark maps.<n> Experimental results show that Convex-Neural RRT* reduces time by 30-75% compared to neural-guided variants and up to 88-98% relative to LTA*, with larger improvements observed in complex environments.
  arXiv  Detail & Related papers  (2026-05-24T11:17:57Z)
• GeNeRT: A Physics-Informed Approach to Intelligent Wireless Channel Modeling via Generalizable Neural Ray Tracing [40.29573574383523]
  We propose GeNeRT, a Generalizable Neural RT framework with enhanced generalization, accuracy and efficiency.<n>By incorporating Fresnel-inspired neural network design, it also achieves higher accuracy in multipath component (MPC) prediction.<n>Experiments conducted in outdoor scenarios demonstrate that GeNeRT generalizes well across untrained regions within a scenario and entirely unseen environments.
  arXiv  Detail & Related papers  (2025-06-23T05:17:01Z)
• Robust Evolutionary Multi-Objective Network Architecture Search for Reinforcement Learning (EMNAS-RL) [43.108040967674185]
  This paper introduces Evolutionary Multi-Objective Network Architecture Search (EMNAS) for the first time to optimize neural network architectures in large-scale Reinforcement Learning for Autonomous Driving (AD)<n> EMNAS uses genetic algorithms to automate network design, tailored to enhance rewards and reduce model size without compromising performance.
  arXiv  Detail & Related papers  (2025-06-10T07:52:35Z)
• Self-Supervised Learning-Based Path Planning and Obstacle Avoidance Using PPO and B-Splines in Unknown Environments [0.0]
  Smart BSP is an advanced self-supervised learning framework for real-time path planning and obstacle avoidance in autonomous robotics.<n>The proposed system integrates Proximal Policy Optimization (PPO) with Convolutional Neural Networks (CNN) and Actor-Critic architecture.<n>During the training process a nuanced cost function is minimized that accounts for path curvature, endpoint proximity, and obstacle avoidance.
  arXiv  Detail & Related papers  (2024-12-03T05:20:29Z)
• SCoTT: Strategic Chain-of-Thought Tasking for Wireless-Aware Robot Navigation in Digital Twins [78.53885607559958]
  We propose SCoTT, a wireless-aware path planning framework.<n>We show that SCoTT achieves path gains within 2% of DP-WA* while consistently generating shorter trajectories.<n>We also show the practical viability of our approach by deploying SCoTT as a ROS node within Gazebo simulations.
  arXiv  Detail & Related papers  (2024-11-27T10:45:49Z)
• Deep Heuristic Learning for Real-Time Urban Pathfinding [0.0]
  This paper introduces a novel approach to urban pathfinding by transforming traditional algorithms into deep learning models that leverage real-time contextual data, such as traffic and weather conditions. We propose two methods: an enhanced A* algorithm that dynamically adjusts routes based on current environmental conditions, and a neural network model that predicts the next optimal path segment using historical and live data.
  arXiv  Detail & Related papers  (2024-11-07T00:22:04Z)
• A Novel Feature Learning-based Bio-inspired Neural Network for Real-time Collision-free Rescue of Multi-Robot Systems [5.478000072204037]
  A bio-inspired neural network is proposed to generate a rescue path in complex and dynamic environments. The proposed FLBBINN aims to reduce the computational complexity of the neural network-based approach. The results show that the proposed FLBBINN would significantly improve the speed, efficiency, and optimality for rescue operations.
  arXiv  Detail & Related papers  (2024-03-13T04:43:10Z)
• Confidence-Controlled Exploration: Efficient Sparse-Reward Policy Learning for Robot Navigation [72.24964965882783]
  Reinforcement learning (RL) is a promising approach for robotic navigation, allowing robots to learn through trial and error.<n>Real-world robotic tasks often suffer from sparse rewards, leading to inefficient exploration and suboptimal policies.<n>We introduce Confidence-Controlled Exploration (CCE), a novel method that improves sample efficiency in RL-based robotic navigation without modifying the reward function.
  arXiv  Detail & Related papers  (2023-06-09T18:45:15Z)
• CBAGAN-RRT: Convolutional Block Attention Generative Adversarial Network for Sampling-Based Path Planning [0.0]
  We propose a novel image-based learning algorithm using a Convolutional Block Attention Generative Adrial Network (CBAGAN-RRT)<n>Our algorithm outperforms the previous state-of-the-art algorithms using both the image quality generation metrics and path planning metrics.
  arXiv  Detail & Related papers  (2023-05-13T20:06:53Z)
• Improved Algorithms for Neural Active Learning [74.89097665112621]
  We improve the theoretical and empirical performance of neural-network(NN)-based active learning algorithms for the non-parametric streaming setting. We introduce two regret metrics by minimizing the population loss that are more suitable in active learning than the one used in state-of-the-art (SOTA) related work.
  arXiv  Detail & Related papers  (2022-10-02T05:03:38Z)
• Path Design and Resource Management for NOMA enhanced Indoor Intelligent Robots [58.980293789967575]
  A communication enabled indoor intelligent robots (IRs) service framework is proposed. Lego modeling method is proposed, which can deterministically describe the indoor layout and channel state. The investigated radio map is invoked as a virtual environment to train the reinforcement learning agent.
  arXiv  Detail & Related papers  (2020-11-23T21:45:01Z)
• DrNAS: Dirichlet Neural Architecture Search [88.56953713817545]
  We treat the continuously relaxed architecture mixing weight as random variables, modeled by Dirichlet distribution. With recently developed pathwise derivatives, the Dirichlet parameters can be easily optimized with gradient-based generalization. To alleviate the large memory consumption of differentiable NAS, we propose a simple yet effective progressive learning scheme.
  arXiv  Detail & Related papers  (2020-06-18T08:23:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.