Deep R-Learning for Continual Area Sweeping

• URL: http://arxiv.org/abs/2006.00589v1
• Date: Sun, 31 May 2020 19:15:28 GMT
• Title: Deep R-Learning for Continual Area Sweeping
• Authors: Rishi Shah, Yuqian Jiang, Justin Hart, Peter Stone
• Abstract summary: 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.
• Score: 41.832987254467284
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Coverage path planning is a well-studied problem in robotics in which a robot must plan a path that passes through every point in a given area repeatedly, usually with a uniform frequency. To address the scenario in which some points need to be visited more frequently than others, this problem has been extended to non-uniform coverage planning. This paper considers the variant of non-uniform coverage in which the robot does not know the distribution of relevant events beforehand and must nevertheless learn to maximize the rate of detecting events of interest. This continual area sweeping problem has been previously formalized in a way that makes strong assumptions about the environment, and to date only a greedy approach has been proposed. We generalize the continual area sweeping formulation to include fewer environmental constraints, and propose a novel approach based on reinforcement learning in a Semi-Markov Decision Process. This approach is evaluated in an abstract simulation and in a high fidelity Gazebo simulation. These evaluations show significant improvement upon the existing approach in general settings, which is especially relevant in the growing area of service robotics.

Related papers

• C$^{2}$INet: Realizing Incremental Trajectory Prediction with Prior-Aware Continual Causal Intervention [10.189508227447401]
  Trajectory prediction for multi-agents in complex scenarios is crucial for applications like autonomous driving. Existing methods often overlook environmental biases, which leads to poor generalization. We propose the Continual Causal Intervention (C$2$INet) method for generalizable multi-agent trajectory prediction.
  arXiv  Detail & Related papers  (2024-11-19T08:01:20Z)
• Generalizability of Graph Neural Networks for Decentralized Unlabeled Motion Planning [72.86540018081531]
  Unlabeled motion planning involves assigning a set of robots to target locations while ensuring collision avoidance. This problem forms an essential building block for multi-robot systems in applications such as exploration, surveillance, and transportation. We address this problem in a decentralized setting where each robot knows only the positions of its $k$-nearest robots and $k$-nearest targets.
  arXiv  Detail & Related papers  (2024-09-29T23:57:25Z)
• Consciousness-Inspired Spatio-Temporal Abstractions for Better Generalization in Reinforcement Learning [83.41487567765871]
  Skipper is a model-based reinforcement learning framework. It automatically generalizes the task given into smaller, more manageable subtasks. It enables sparse decision-making and focused abstractions on the relevant parts of the environment.
  arXiv  Detail & Related papers  (2023-09-30T02:25:18Z)
• 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)
• Autonomous search of real-life environments combining dynamical system-based path planning and unsupervised learning [0.0]
  This paper proposes algorithms for obstacle avoidance, chaotic trajectory dispersal, and accurate coverage calculation. The algorithms produce generally smooth chaotic trajectories and provide high scanning coverage of environments. The performance of this application was comparable to that of a conventional optimal path planner.
  arXiv  Detail & Related papers  (2023-05-03T00:09:31Z)
• Risk-Sensitive and Robust Model-Based Reinforcement Learning and Planning [2.627046865670577]
  We will address both planning and reinforcement learning approaches to sequential decision-making. In many real-world domains, it is impossible to construct a perfectly accurate model or simulator. We make a number of contributions towards this goal, with a focus on model-based algorithms.
  arXiv  Detail & Related papers  (2023-04-02T16:44:14Z)
• Safe Multi-agent Learning via Trapping Regions [89.24858306636816]
  We apply the concept of trapping regions, known from qualitative theory of dynamical systems, to create safety sets in the joint strategy space for decentralized learning. We propose a binary partitioning algorithm for verification that candidate sets form trapping regions in systems with known learning dynamics, and a sampling algorithm for scenarios where learning dynamics are not known.
  arXiv  Detail & Related papers  (2023-02-27T14:47:52Z)
• Evaluating Guiding Spaces for Motion Planning [2.384084215091134]
  We define the emphmotion planning guiding space, which encapsulates many seemingly distinct prior works under the same framework. We also suggest an information theoretic method to evaluate guided planning which places the focus on the quality of the resulting biased sampling.
  arXiv  Detail & Related papers  (2022-10-16T21:17:51Z)
• 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)

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.