OTO Planner: An Efficient Only Travelling Once Exploration Planner for Complex and Unknown Environments

• URL: http://arxiv.org/abs/2406.07294v2
• Date: Thu, 21 Nov 2024 06:45:41 GMT
• Title: OTO Planner: An Efficient Only Travelling Once Exploration Planner for Complex and Unknown Environments
• Abstract summary: "Only Travelling Once Planner" is an efficient exploration planner that reduces repeated paths in complex environments. It includes fast frontier updating, viewpoint evaluation and viewpoint refinement. It reduces the exploration time and movement distance by 10%-20% and improves the speed of frontier detection by 6-9 times.
• Score: 6.128246045267511
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Autonomous exploration in complex and cluttered environments is essential for various applications. However, there are many challenges due to the lack of global heuristic information. Existing exploration methods suffer from the repeated paths and considerable computational resource requirement in large-scale environments. To address the above issues, this letter proposes an efficient exploration planner that reduces repeated paths in complex environments, hence it is called "Only Travelling Once Planner". OTO Planner includes fast frontier updating, viewpoint evaluation and viewpoint refinement. A selective frontier updating mechanism is designed, saving a large amount of computational resources. In addition, a novel viewpoint evaluation system is devised to reduce the repeated paths utilizing the enclosed sub-region detection. Besides, a viewpoint refinement approach is raised to concentrate the redundant viewpoints, leading to smoother paths. We conduct extensive simulation and real-world experiments to validate the proposed method. Compared to the state-of-the-art approach, the proposed method reduces the exploration time and movement distance by 10%-20% and improves the speed of frontier detection by 6-9 times.

Related papers

• Dream-RSI: Recursive Self-Improvement through Evolving Worlds [61.888486670260306]
  textscDream-RSI is a framework for scalable self-improving exploration.<n>A lightweight orchestration layer makes exploration explicit and programmable.<n>By performing dreaming in the replay simulator constructed from historical discovery trees, textscDream-RSI secures immediate, low-cost off-policy feedback.
  arXiv  Detail & Related papers  (2026-09-14T00:10:47Z)
• SLIDER: Sparse History-Guided Aerial Robot Target Search using Sliding Local Maps [8.942263751725413]
  This paper presents SLIDER, a lightweight framework that avoids reliance on globally dense maps by combining a local sliding map with sparse global history information.<n>A novel observation quality evaluation method is proposed, leveraging historical poses and sensor models to assess point cloud data in real-time.<n>To support scalable and responsive planning, an incremental viewpoint clustering strategy dynamically adapts to local updates.<n>A sparse global topological map is incrementally maintained to assist global planning and cost evaluation.
  arXiv  Detail & Related papers  (2026-07-12T03:55:51Z)
• Semantic-Aware Autonomous Exploration for UAVs in Unknown Indoor Environments [2.379911867541422]
  This paper proposes a semantic-aware exploration framework that adds semantic information to a roadmap-based exploration strategy.<n>A semantic reward function is introduced to prioritize regions containing meaningful objects and structures, enabling the UAV to focus on areas with higher information value.<n> Experimental results in multiple simulated environments demonstrate that the proposed approach achieves exploration coverage rates between 90% and 94%.
  arXiv  Detail & Related papers  (2026-06-21T21:07:40Z)
• ReSPIRe: Informative and Reusable Belief Tree Search for Robot Probabilistic Search and Tracking in Unknown Environments [25.261065989248877]
  This paper proposes an informative trajectory planning approach, namely ReSPIRe, for target search and tracking (SAT)<n>We first develop a novel point-based approximation approach to fast and accurately estimate mutual information reward under non-Gaussian belief distributions.<n>To tackle significant uncertainty associated with inadequate prior target information, we propose the hierarchical particle structure in ReSPIRe.
  arXiv  Detail & Related papers  (2025-12-31T07:13:14Z)
• FrontierNet: Learning Visual Cues to Explore [54.8265603996238]
  This work aims at leveraging 2D visual cues for efficient autonomous exploration, addressing the limitations of extracting goal poses from a 3D map. We propose a image-only frontier-based exploration system, with FrontierNet as a core component developed in this work. Our approach provides an alternative to existing 3D-dependent exploration systems, achieving a 16% improvement in early-stage exploration efficiency.
  arXiv  Detail & Related papers  (2025-01-08T16:25:32Z)
• 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)
• Reducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks [10.698553177585973]
  We propose new learning-based methods for reducing collision checking to accelerate motion planning. We train graph neural networks (GNNs) that perform path exploration and path smoothing. Experimental results show that the learned components can significantly reduce collision checking and improve overall planning efficiency.
  arXiv  Detail & Related papers  (2022-10-17T09:02:04Z)
• Incremental 3D Scene Completion for Safe and Efficient Exploration Mapping and Planning [60.599223456298915]
  We propose a novel way to integrate deep learning into exploration by leveraging 3D scene completion for informed, safe, and interpretable mapping and planning. We show that our method can speed up coverage of an environment by 73% compared to the baselines with only minimal reduction in map accuracy. Even if scene completions are not included in the final map, we show that they can be used to guide the robot to choose more informative paths, speeding up the measurement of the scene with the robot's sensors by 35%.
  arXiv  Detail & Related papers  (2022-08-17T14:19:33Z)
• MADE: Exploration via Maximizing Deviation from Explored Regions [48.49228309729319]
  In online reinforcement learning (RL), efficient exploration remains challenging in high-dimensional environments with sparse rewards. We propose a new exploration approach via textitmaximizing the deviation of the occupancy of the next policy from the explored regions. Our approach significantly improves sample efficiency over state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-18T17:57:00Z)
• MRDet: A Multi-Head Network for Accurate Oriented Object Detection in Aerial Images [51.227489316673484]
  We propose an arbitrary-oriented region proposal network (AO-RPN) to generate oriented proposals transformed from horizontal anchors. To obtain accurate bounding boxes, we decouple the detection task into multiple subtasks and propose a multi-head network. Each head is specially designed to learn the features optimal for the corresponding task, which allows our network to detect objects accurately.
  arXiv  Detail & Related papers  (2020-12-24T06:36:48Z)
• BeBold: Exploration Beyond the Boundary of Explored Regions [66.88415950549556]
  In this paper, we propose the regulated difference of inverse visitation counts as a simple but effective criterion for intrinsic reward (IR) The criterion helps the agent explore Beyond the Boundary of explored regions and mitigates common issues in count-based methods, such as short-sightedness and detachment. The resulting method, BeBold, solves the 12 most challenging procedurally-generated tasks in MiniGrid with just 120M environment steps, without any curriculum learning.
  arXiv  Detail & Related papers  (2020-12-15T21:26:54Z)
• Autonomous UAV Exploration of Dynamic Environments via Incremental Sampling and Probabilistic Roadmap [0.3867363075280543]
  We propose a novel dynamic exploration planner (DEP) for exploring unknown environments using incremental sampling and Probabilistic Roadmap (PRM) Our method safely explores dynamic environments and outperforms the benchmark planners in terms of exploration time, path length, and computational time.
  arXiv  Detail & Related papers  (2020-10-14T22:52:37Z)
• Congestion-aware Evacuation Routing using Augmented Reality Devices [96.68280427555808]
  We present a congestion-aware routing solution for indoor evacuation, which produces real-time individual-customized evacuation routes among multiple destinations. A population density map, obtained on-the-fly by aggregating locations of evacuees from user-end Augmented Reality (AR) devices, is used to model the congestion distribution inside a building.
  arXiv  Detail & Related papers  (2020-04-25T22:54:35Z)
• Dynamic Subgoal-based Exploration via Bayesian Optimization [7.297146495243708]
  Reinforcement learning in sparse-reward navigation environments is challenging and poses a need for effective exploration. We propose a cost-aware Bayesian optimization approach that efficiently searches over a class of dynamic subgoal-based exploration strategies. An experimental evaluation demonstrates that the new approach outperforms existing baselines across a number of problem domains.
  arXiv  Detail & Related papers  (2019-10-21T04:24:29Z)

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.