BAMAX: Backtrack Assisted Multi-Agent Exploration using Reinforcement Learning

• URL: http://arxiv.org/abs/2411.08400v1
• Date: Wed, 13 Nov 2024 07:38:24 GMT
• Title: BAMAX: Backtrack Assisted Multi-Agent Exploration using Reinforcement Learning
• Authors: Geetansh Kalra, Amit Patel, Atul Chaudhari, Divye Singh,
• Abstract summary: We introduce Backtrack Assisted Multi-Agent Exploration using Reinforcement Learning (BAMAX) BAMAX is a method for collaborative exploration in multi-agent systems which attempts to explore an entire virtual environment. Results show BAMAX outperforms other methods in terms of faster coverage and less backtracking across these environments.
• Score: 0.0
• License:
• Abstract: Autonomous robots collaboratively exploring an unknown environment is still an open problem. The problem has its roots in coordination among non-stationary agents, each with only a partial view of information. The problem is compounded when the multiple robots must completely explore the environment. In this paper, we introduce Backtrack Assisted Multi-Agent Exploration using Reinforcement Learning (BAMAX), a method for collaborative exploration in multi-agent systems which attempts to explore an entire virtual environment. As in the name, BAMAX leverages backtrack assistance to enhance the performance of agents in exploration tasks. To evaluate BAMAX against traditional approaches, we present the results of experiments conducted across multiple hexagonal shaped grids sizes, ranging from 10x10 to 60x60. The results demonstrate that BAMAX outperforms other methods in terms of faster coverage and less backtracking across these environments.

Related papers

• Curiosity & Entropy Driven Unsupervised RL in Multiple Environments [0.0]
  We propose and experiment with five new modifications to the original work. In high-dimensional environments, curiosity-driven exploration enhances learning by encouraging the agent to seek diverse experiences and explore the unknown more. However, its benefits are limited in low-dimensional and simpler environments where exploration possibilities are constrained and there is little that is truly unknown to the agent.
  arXiv  Detail & Related papers  (2024-01-08T19:25:40Z)
• From Simulations to Reality: Enhancing Multi-Robot Exploration for Urban Search and Rescue [46.377510400989536]
  We present a novel hybrid algorithm for efficient multi-robot exploration in unknown environments with limited communication and no global positioning information. We redefine the local best and global best positions to suit scenarios without continuous target information. The presented work holds promise for enhancing multi-robot exploration in scenarios with limited information and communication capabilities.
  arXiv  Detail & Related papers  (2023-11-28T17:05:25Z)
• A further exploration of deep Multi-Agent Reinforcement Learning with Hybrid Action Space [0.0]
  We propose two algorithms: deep multi-agent hybrid soft actor-critic (MAHSAC) and multi-agent hybrid deep deterministic policy gradients (MAHDDPG) Our experiences are running on multi-agent particle environment which is an easy multi-agent particle world, along with some basic simulated physics.
  arXiv  Detail & Related papers  (2022-08-30T07:40:15Z)
• Discovering and Achieving Goals via World Models [61.95437238374288]
  We introduce Latent Explorer Achiever (LEXA), a unified solution to this problem. LEXA learns a world model from image inputs and uses it to train an explorer and an achiever policy from imagined rollouts. After the unsupervised phase, LEXA solves tasks specified as goal images zero-shot without any additional learning.
  arXiv  Detail & Related papers  (2021-10-18T17:59:58Z)
• Cooperative Exploration for Multi-Agent Deep Reinforcement Learning [127.4746863307944]
  We propose cooperative multi-agent exploration (CMAE) for deep reinforcement learning. The goal is selected from multiple projected state spaces via a normalized entropy-based technique. We demonstrate that CMAE consistently outperforms baselines on various tasks.
  arXiv  Detail & Related papers  (2021-07-23T20:06:32Z)
• 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)
• Batch Exploration with Examples for Scalable Robotic Reinforcement Learning [63.552788688544254]
  Batch Exploration with Examples (BEE) explores relevant regions of the state-space guided by a modest number of human provided images of important states. BEE is able to tackle challenging vision-based manipulation tasks both in simulation and on a real Franka robot.
  arXiv  Detail & Related papers  (2020-10-22T17:49:25Z)
• SMARTS: Scalable Multi-Agent Reinforcement Learning Training School for Autonomous Driving [96.50297622371457]
  Multi-agent interaction is a fundamental aspect of autonomous driving in the real world. Despite more than a decade of research and development, the problem of how to interact with diverse road users in diverse scenarios remains largely unsolved. We develop a dedicated simulation platform called SMARTS that generates diverse and competent driving interactions.
  arXiv  Detail & Related papers  (2020-10-19T18:26:10Z)
• Never Give Up: Learning Directed Exploration Strategies [63.19616370038824]
  We propose a reinforcement learning agent to solve hard exploration games by learning a range of directed exploratory policies. We construct an episodic memory-based intrinsic reward using k-nearest neighbors over the agent's recent experience to train the directed exploratory policies. A self-supervised inverse dynamics model is used to train the embeddings of the nearest neighbour lookup, biasing the novelty signal towards what the agent can control.
  arXiv  Detail & Related papers  (2020-02-14T13:57:22Z)

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.