Autonomous search of real-life environments combining dynamical system-based path planning and unsupervised learning

• URL: http://arxiv.org/abs/2305.01834v3
• Date: Wed, 27 Nov 2024 16:07:12 GMT
• Title: Autonomous search of real-life environments combining dynamical system-based path planning and unsupervised learning
• Abstract summary: This study develops a novel applied framework for real-world applications of chaotic coverage path planners.<n>It provides techniques for effective obstacle avoidance, chaotic trajectory dispersal, and accurate real-time coverage calculation.<n>The performance of this application was comparable to that of a conventional optimal path planner.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years, advancements have been made towards the goal of using chaotic coverage path planners for autonomous search and traversal of spaces with limited environmental cues. However, the state of this field is still in its infancy as there has been little experimental work done. The existing experimental works have not developed robust methods to satisfactorily address the immediate set of problems a chaotic coverage path planner needs to overcome in order to scan realistic environments within reasonable coverage times. These immediate problems are as follows: (1) an obstacle avoidance technique that reduces halts or disruptions in continuous chaotic trajectories, (2) a means to spread chaotic trajectories across the environment (especially crucial for large and/or complex-shaped environments) that need to be covered, and (3) a real-time coverage calculation technique that is accurate and independent of cell size. This study addresses these problems by developing a novel applied framework for real-world applications of chaotic coverage path planners while providing techniques for effective obstacle avoidance, chaotic trajectory dispersal, and accurate real-time coverage calculation. These algorithms were created within the ROS framework and make up a newly developed chaotic path planning application. The performance of this application was comparable to that of a conventional optimal path planner. The performance tests were carried out in environments of various sizes, shapes, and obstacle densities, both in real-life and Gazebo simulations.

Related papers

• VikPath: A Vision Kansformer Framework for Effective Obstacle Avoidance in Self-Supervised Pathfinding [12.76109113310209]
  We propose a self-supervised pathfinding framework that considers obstacle proximity and path smoothness.<n>$Design$ achieves an average of 3.28% greater obstacle clearance and 87.07% lower latency while maintaining smooth path generation.
  arXiv  Detail & Related papers  (2026-08-24T00:23:57Z)
• AutoPath: Learning Transferable Goal-Conditioned Stochastic Path Prior for Safe Navigation Without Human Demonstrations [103.61864552260316]
  Real-time navigation in dynamic environments requires collision-free and dynamically feasible motion under limited perception.<n>We formulate navigation as learning a transferable goal-aligned path prior that models a reusable distribution over goal-aligned geometry-consistent local paths conditioned on local observations.<n>We develop a structured prior learning framework that parameterizes local paths using a geometry-aware polar action manifold and incorporates risk-sensitive utility shaping with multi-goal distributional rollouts for stable and safety-aware planning.
  arXiv  Detail & Related papers  (2026-07-13T16:00:41Z)
• Occluding the Solution Space: Planner-Agnostic Adversarial Attacks on Tolerance-Aware Manipulation [57.9825059129472]
  We propose a planner-agnostic attack framework for tolerance-aware manipulation.<n>Our approach shifts the evaluation paradigm to task-level feasibility over goal regions.<n>Online, we formulate the attack as a budgeted maximum-coverage optimization.
  arXiv  Detail & Related papers  (2026-07-04T08:14:44Z)
• Mind Your Steps: A General Learning Framework for Accurate Humanoid Foothold Tracking [78.30338456206984]
  We introduce a novel framework for training general-purpose 3D foothold-tracking policies.<n>By dynamically providing footstep support through a goal sampler, this method enables the learned policy to be agnostic to specific terrains.<n>Our new target representation effectively mitigates challenges arising in the real world, such as noisy and inaccurate pose estimation and foot contact estimation.
  arXiv  Detail & Related papers  (2026-06-06T16:44:56Z)
• Meridian: Metric-Semantic Primitive Matching for Cross-View Geo-Localization Beyond Urban Environments [47.53030013880309]
  Successful robot automation requires accurate global localization to support repeatability, task planning, goal specification, and safe operation.<n>We present Meridian, a method for matching high-level metric-semantic primitives across aerial images and ground robot RGB-D camera data.<n>We demonstrate that our algorithm can localize a ground robot across a wide variety of environments, including an autonomous driving dataset, a park and campus area, and a wilderness camp.
  arXiv  Detail & Related papers  (2026-06-04T15:52:40Z)
• Active Timepoint Selection for Learning Measure-Valued Trajectories [55.49809248697036]
  Inferring continuous probability paths from snapshots is a fundamental challenge in domains like single-cell biology.<n>We introduce a framework which extends active experimentation to the space of sparse measures.<n>This yields an acquisition policy that iteratively selects measurement times to minimize uncertainty.
  arXiv  Detail & Related papers  (2026-05-28T22:22:35Z)
• Asymptotically Optimal Ergodic Coverage on Generalized Motion Fields [6.330592680829195]
  Autonomous robotic exploration in remote and extreme environments allows scientists to model complex phenomena.<n>Most adaptive search methods assume static environments and fail to provide adequate coverage.<n>We show that our method generalizes to diverse processes including ocean exploration, and tracking human and cattle movement.
  arXiv  Detail & Related papers  (2026-05-13T12:37:27Z)
• Coverage First Next Best View for Inspection of Cluttered Pipe Networks Using Mobile Manipulators [3.0472973584577923]
  Robotic inspection of radioactive areas enables operators to be removed from hazardous environments.<n>These systems must autonomously reconstruct the unknown environment and cover its surfaces.<n>We propose a new planning approach based on next-best-view that enables simultaneous exploration and exploitation of the environment.
  arXiv  Detail & Related papers  (2026-03-17T12:59:26Z)
• Adapting Reinforcement Learning for Path Planning in Constrained Parking Scenarios [6.734318562862061]
  We introduce a Deep Reinforcement Learning framework for real-time path planning in parking scenarios.<n>Unlike classical planners, our solution does not require ideal and structured perception.<n>At test time, the policy generates actions through a single forward pass at each step, which is lightweight enough for real-time deployment.
  arXiv  Detail & Related papers  (2026-01-30T04:35:49Z)
• Real-Time Sampling-based Online Planning for Drone Interception [18.340019191662957]
  We propose a sampling-based online planning algorithm that leverages neural network inference to replace time-consuming nonlinear trajectory optimization. The proposed method is applied to the drone interception problem, where a defense drone must intercept a target while avoiding collisions and handling imperfect target predictions.
  arXiv  Detail & Related papers  (2025-02-20T03:48:38Z)
• Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models [57.45019514036948]
  Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics. This work proposes a novel approach that integrates constrained optimization with diffusion models for MAPF in continuous spaces.
  arXiv  Detail & Related papers  (2024-12-23T21:27:19Z)
• A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements [51.54559117314768]
  Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem. We propose a general and open-source framework for modeling and benchmarking TAMP problems. We introduce an innovative meta-technique to solve TAMP problems involving moving agents and multiple task-state-dependent obstacles.
  arXiv  Detail & Related papers  (2024-08-11T14:57:57Z)
• LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning [91.95362946266577]
  Path planning is a fundamental scientific problem in robotics and autonomous navigation. Traditional algorithms like A* and its variants are capable of ensuring path validity but suffer from significant computational and memory inefficiencies as the state space grows. We propose a new LLM based route planning method that synergistically combines the precise pathfinding capabilities of A* with the global reasoning capability of LLMs. This hybrid approach aims to enhance pathfinding efficiency in terms of time and space complexity while maintaining the integrity of path validity, especially in large-scale scenarios.
  arXiv  Detail & Related papers  (2024-06-20T01:24:30Z)
• Sim-to-Real Transfer of Deep Reinforcement Learning Agents for Online Coverage Path Planning [22.077058792635313]
  Coverage path planning is the problem of finding a path that covers the entire free space of a confined area.<n>We investigate the suitability of continuous-space reinforcement learning for this challenging problem.<n>We show that our approach surpasses the performance of both previous RL-based approaches and highly specialized methods.
  arXiv  Detail & Related papers  (2024-06-07T13:24:19Z)
• AI planning in the imagination: High-level planning on learned abstract search spaces [68.75684174531962]
  We propose a new method, called PiZero, that gives an agent the ability to plan in an abstract search space that the agent learns during training. We evaluate our method on multiple domains, including the traveling salesman problem, Sokoban, 2048, the facility location problem, and Pacman.
  arXiv  Detail & Related papers  (2023-08-16T22:47:16Z)
• Learning Coverage Paths in Unknown Environments with Deep Reinforcement Learning [17.69984142788365]
  Coverage path planning ( CPP) is the problem of finding a path that covers the entire free space of a confined area. We investigate how suitable reinforcement learning is for this challenging problem. We propose a computationally feasible egocentric map representation based on frontiers, and a novel reward term based on total variation.
  arXiv  Detail & Related papers  (2023-06-29T14:32:06Z)
• Planning to Practice: Efficient Online Fine-Tuning by Composing Goals in Latent Space [76.46113138484947]
  General-purpose robots require diverse repertoires of behaviors to complete challenging tasks in real-world unstructured environments. To address this issue, goal-conditioned reinforcement learning aims to acquire policies that can reach goals for a wide range of tasks on command. We propose Planning to Practice, a method that makes it practical to train goal-conditioned policies for long-horizon tasks.
  arXiv  Detail & Related papers  (2022-05-17T06:58:17Z)
• Learning Robust Policy against Disturbance in Transition Dynamics via State-Conservative Policy Optimization [63.75188254377202]
  Deep reinforcement learning algorithms can perform poorly in real-world tasks due to discrepancy between source and target environments. We propose a novel model-free actor-critic algorithm to learn robust policies without modeling the disturbance in advance. Experiments in several robot control tasks demonstrate that SCPO learns robust policies against the disturbance in transition dynamics.
  arXiv  Detail & Related papers  (2021-12-20T13:13:05Z)
• Reinforcement Learning-Based Coverage Path Planning with Implicit Cellular Decomposition [5.2424255020469595]
  This paper provides a systematic analysis of the coverage problem and formulates it as an optimal stopping time problem. We show that reinforcement learning-based algorithms efficiently cover realistic unknown indoor environments.
  arXiv  Detail & Related papers  (2021-10-18T05:18:52Z)
• SABER: Data-Driven Motion Planner for Autonomously Navigating Heterogeneous Robots [112.2491765424719]
  We present an end-to-end online motion planning framework that uses a data-driven approach to navigate a heterogeneous robot team towards a global goal. We use model predictive control (SMPC) to calculate control inputs that satisfy robot dynamics, and consider uncertainty during obstacle avoidance with chance constraints. recurrent neural networks are used to provide a quick estimate of future state uncertainty considered in the SMPC finite-time horizon solution. A Deep Q-learning agent is employed to serve as a high-level path planner, providing the SMPC with target positions that move the robots towards a desired global goal.
  arXiv  Detail & Related papers  (2021-08-03T02:56:21Z)
• Learning-based Preference Prediction for Constrained Multi-Criteria Path-Planning [12.457788665461312]
  Constrained path-planning for Autonomous Ground Vehicles (AGV) is one such application. We leverage knowledge acquired through offline simulations by training a neural network model to predict the uncertain criterion. We integrate this model inside a path-planner which can solve problems online.
  arXiv  Detail & Related papers  (2021-08-02T17:13:45Z)
• Online search of unknown terrains using a dynamical system-based path planning approach [0.0]
  This study introduces a new scalable technique that helps a robot to steer away from the obstacles and cover the entire space in a short period of time. Using this technique resulted in 49% boost, on average, in the robot's performance compared to the state-of-the-art planners.
  arXiv  Detail & Related papers  (2021-03-22T14:00:04Z)
• Generative Adversarial Network based Heuristics for Sampling-based Path Planning [34.368519009432426]
  We present a novel image-based path planning algorithm to overcome limitations of sampling-based path planning. Specifically, a generative adversarial network (GAN) is designed to take the environment map as the input without other preprocessing works. We conduct a number of simulation experiments to validate the effectiveness of the proposed method, and the results demonstrate that our method performs much better in terms of the quality of initial solution and the convergence speed to the optimal solution.
  arXiv  Detail & Related papers  (2020-12-07T07:29:57Z)
• Reinforcement Learning for Low-Thrust Trajectory Design of Interplanetary Missions [77.34726150561087]
  This paper investigates the use of reinforcement learning for the robust design of interplanetary trajectories in presence of severe disturbances. An open-source implementation of the state-of-the-art algorithm Proximal Policy Optimization is adopted. The resulting Guidance and Control Network provides both a robust nominal trajectory and the associated closed-loop guidance law.
  arXiv  Detail & Related papers  (2020-08-19T15:22:15Z)
• Jump Operator Planning: Goal-Conditioned Policy Ensembles and Zero-Shot Transfer [71.44215606325005]
  We propose a novel framework called Jump-Operator Dynamic Programming for quickly computing solutions within a super-exponential space of sequential sub-goal tasks. This approach involves controlling over an ensemble of reusable goal-conditioned polices functioning as temporally extended actions. We then identify classes of objective functions on this subspace whose solutions are invariant to the grounding, resulting in optimal zero-shot transfer.
  arXiv  Detail & Related papers  (2020-07-06T05:13:20Z)
• Deep R-Learning for Continual Area Sweeping [41.832987254467284]
  Non-uniform coverage planning is a well-studied problem in robotics. This paper considers the variant of non-uniform coverage in which the robot does not know the distribution of relevant events beforehand. We propose a novel approach based on reinforcement learning in a Semi-Markov Decision Process.
  arXiv  Detail & Related papers  (2020-05-31T19:15:28Z)

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.