Risk-Bounded Multi-Agent Visual Navigation via Dynamic Budget Allocation

• URL: http://arxiv.org/abs/2509.08157v1
• Date: Tue, 09 Sep 2025 21:35:55 GMT
• Title: Risk-Bounded Multi-Agent Visual Navigation via Dynamic Budget Allocation
• Abstract summary: Traditional planning methods excel at solving long-horizon tasks but rely on predefined distance metrics.<n>We propose RB-CBS, a novel extension to Conflict-Based Search (CBS) that dynamically allocates and adjusts user-specified risk bound.<n>Our improved planner ensures that each agent receives a local risk budget enabling more efficient navigation while still respecting overall safety constraints.
• Score: 3.7347677698423536
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Safe navigation is essential for autonomous systems operating in hazardous environments, especially when multiple agents must coordinate using just visual inputs over extended time horizons. Traditional planning methods excel at solving long-horizon tasks but rely on predefined distance metrics, while safe Reinforcement Learning (RL) can learn complex behaviors using high-dimensional inputs yet struggles with multi-agent, goal-conditioned scenarios. Recent work combined these paradigms by leveraging goal-conditioned RL (GCRL) to build an intermediate graph from replay buffer states, pruning unsafe edges, and using Conflict-Based Search (CBS) for multi-agent path planning. Although effective, this graph-pruning approach can be overly conservative, limiting mission efficiency by precluding missions that must traverse high-risk regions. To address this limitation, we propose RB-CBS, a novel extension to CBS that dynamically allocates and adjusts user-specified risk bound ($\Delta$) across agents to flexibly trade off safety and speed. Our improved planner ensures that each agent receives a local risk budget ($\delta$) enabling more efficient navigation while still respecting overall safety constraints. Experimental results demonstrate that this iterative risk-allocation framework yields superior performance in complex environments, allowing multiple agents to find collision-free paths within the user-specified $\Delta$.

Related papers

• Cooperative Risk-Aware Exploration in Heterogeneous Multi-Robot Systems Using Algorithmic Altruism [5.8411170261618865]
  This paper develops a game-theoretic framework for cooperative risk-aware exploration based on ecologically inspired altruistic behavior.<n>We define an exploration utility for agents that rewards area coverage and uncertainty reduction, while also penalizing redundancy and risk.<n> Simulations show that altruistic planning reduces redundant exploration, improves inter-robot separation, and reallocates risk according to agent value.
  arXiv  Detail & Related papers  (2026-08-28T14:57:36Z)
• CDCP: Conditional Diffusion Model with Contextual Prompts for Multi-task Offline Safe Reinforcement Learning [63.5739698095413]
  Multi-task offline safe reinforcement learning (RL) promises to learn a shared optimal safe policy from offline data across multiple tasks.<n>However, the triple challenges of multi-tasking, safety constraints, and out-of-distribution actions pose a significant hurdle for existing methods.<n>We propose a Conditional Diffusion model with Contextual Prompts (CDCP) to address these challenges.
  arXiv  Detail & Related papers  (2026-07-04T14:57:35Z)
• MOAR Planner: Multi-Objective and Adaptive Risk-Aware Path Planning for Infrastructure Inspection with a UAV [4.297070083645049]
  This paper introduces the MOAR path planner which addresses the complexities of evolving risks during missions.<n>It offers real-time trajectory adaptation while concurrently optimizing safety, time, and energy.<n>The proposed framework contributes by enabling UAVs to navigate more autonomously and reliably in critical missions.
  arXiv  Detail & Related papers  (2026-06-29T17:18:02Z)
• APEX: Autonomous Policy Exploration for Self-Evolving LLM Agents [54.213455157510445]
  Self-evolving agents learn by accumulating memory and reflection across episodes rather than requiring model-weight updates.<n>As memory grows, behavior concentrates around familiar high-reward routines, reducing the chance of discovering better alternatives.<n>We propose Autonomous Policy EXploration (APEX), which builds and maintains an explicit strategy space through a strategy map.
  arXiv  Detail & Related papers  (2026-05-20T14:29:27Z)
• HiRO-Nav: Hybrid ReasOning Enables Efficient Embodied Navigation [58.29060712443587]
  HiRO-Nav is the first kind of agent capable of adaptively determining whether to perform thinking at every step based on its own action entropy.<n>We propose a tailored training pipeline comprising hybrid supervised fine-tuning as a cold start, followed by online reinforcement learning.<n>Experiments on the textscCHORES-$mathbbS$ ObjectNav benchmark showcases that HiRO-Nav achieves a better trade-off between success rates and token efficiency than both dense-thinking and no-thinking baselines.
  arXiv  Detail & Related papers  (2026-04-09T13:22:24Z)
• AgentSwing: Adaptive Parallel Context Management Routing for Long-Horizon Web Agents [115.18197165538943]
  Large language models (LLMs) evolve into autonomous agents for long-horizon information-seeking.<n>Existing context management methods typically commit to a single fixed strategy throughout the entire trajectory.<n>We introduce a probabilistic framework that characterizes long-horizon success through two complementary dimensions: search efficiency and terminal precision.
  arXiv  Detail & Related papers  (2026-03-29T02:59:27Z)
• VORL-EXPLORE: A Hybrid Learning Planning Approach to Multi-Robot Exploration in Dynamic Environments [19.811711277536187]
  Multi-robot exploration commonly decouples frontier allocation from local navigation.<n>We propose VORL-EXPLORE, a hybrid learning and planning framework that addresses this limitation through execution fidelity.<n>It also drives a risk-aware adaptive arbitration mechanism between global A* guidance and a reactive reinforcement learning policy.
  arXiv  Detail & Related papers  (2026-03-09T05:20:33Z)
• Global Commander and Local Operative: A Dual-Agent Framework for Scene Navigation [96.88162755522342]
  Vision-and-Language Scene navigation is a fundamental capability for embodied human-AI.<n>We introduce DACo, a planning-grounding decoupled architecture that disentangles global deliberation from local grounding.<n>By disentangling global reasoning from local action, DACo alleviates cognitive overload and improves long-horizon stability.
  arXiv  Detail & Related papers  (2026-02-21T19:19:55Z)
• AgentDoG: A Diagnostic Guardrail Framework for AI Agent Safety and Security [126.49733412191416]
  Current guardrail models lack agentic risk awareness and transparency in risk diagnosis.<n>We propose a unified three-dimensional taxonomy that categorizes agentic risks by their source (where), failure mode (how), and consequence (what)<n>We introduce a new fine-grained agentic safety benchmark (ATBench) and a Diagnostic Guardrail framework for agent safety and security (AgentDoG)
  arXiv  Detail & Related papers  (2026-01-26T13:45:41Z)
• Heterogeneous Multi-Expert Reinforcement Learning for Long-Horizon Multi-Goal Tasks in Autonomous Forklifts [5.215925647203835]
  We propose a Heterogeneous Multi-Expert Reinforcement Learning (HMER) framework tailored for autonomous forklifts.<n>HMER decomposes long-horizon tasks into specialized sub-policies controlled by a Semantic Task Planner.<n>Our method achieves a task success rate of 94.2% (compared to 62.5% for baselines), reduces operation time by 21.4%, and maintains placement error within 1.5 cm.
  arXiv  Detail & Related papers  (2026-01-12T08:27:24Z)
• Hybrid Motion Planning with Deep Reinforcement Learning for Mobile Robot Navigation [0.0]
  Hybrid Motion Planning with Deep Reinforcement Learning (HMP-DRL)<n>We propose a graph-based global planner to generate a path, which is integrated into a local DRL policy via a sequence of checkpoints encoded in both the state space and reward function.<n>To ensure social compliance, the local planner employs an entity-aware reward structure that dynamically adjusts safety margins and penalties based on the semantic type of surrounding agents.
  arXiv  Detail & Related papers  (2025-12-31T05:58:57Z)
• Building a Foundational Guardrail for General Agentic Systems via Synthetic Data [76.18834864749606]
  LLM agents can plan multi-step tasks, intervening at the planning stage-before any action is executed-is often the safest way to prevent harm.<n>Existing guardrails mostly operate post-execution, which is difficult to scale and leaves little room for controllable supervision at the plan level.<n>We introduce AuraGen, a controllable engine that synthesizes benign trajectories, injects category-labeled risks with difficulty, and filters outputs via an automated reward model.
  arXiv  Detail & Related papers  (2025-10-10T18:42:32Z)
• AgentGym-RL: Training LLM Agents for Long-Horizon Decision Making through Multi-Turn Reinforcement Learning [129.44038804430542]
  We introduce AgentGym-RL, a new framework to train LLM agents for multi-turn interactive decision-making through RL.<n>We propose ScalingInter-RL, a training approach designed for exploration-exploitation balance and stable RL optimization.<n>Our agents match or surpass commercial models on 27 tasks across diverse environments.
  arXiv  Detail & Related papers  (2025-09-10T16:46:11Z)
• Designing Control Barrier Function via Probabilistic Enumeration for Safe Reinforcement Learning Navigation [55.02966123945644]
  We propose a hierarchical control framework leveraging neural network verification techniques to design control barrier functions (CBFs) and policy correction mechanisms.<n>Our approach relies on probabilistic enumeration to identify unsafe regions of operation, which are then used to construct a safe CBF-based control layer.<n>These experiments demonstrate the ability of the proposed solution to correct unsafe actions while preserving efficient navigation behavior.
  arXiv  Detail & Related papers  (2025-04-30T13:47:25Z)
• Safe Multi-Agent Navigation guided by Goal-Conditioned Safe Reinforcement Learning [2.082168997977094]
  We introduce a novel method that integrates the strengths of both planning and safe RL.<n>Our method prunes unsafe edges and generates a waypoint-based plan that the agent follows until reaching its goal.<n>In particular, we leverage Conflict-Based Search (CBS) to create waypoint-based plans for multiple agents allowing for their safe navigation over extended horizons.
  arXiv  Detail & Related papers  (2025-02-25T03:38:52Z)
• Integrated Sensing and Communications for Low-Altitude Economy: A Deep Reinforcement Learning Approach [20.36806314683902]
  We study an integrated sensing and communications (ISAC) system for low-altitude economy (LAE)<n>The expected communication sum-rate over a given flight period is maximized by jointly optimizing the beamforming at the GBS and UAVs' trajectories.<n>We propose a novel LAE-oriented ISAC scheme, referred to as Deep LAE-ISAC (DeepLSC), by leveraging the deep reinforcement learning (DRL) technique.
  arXiv  Detail & Related papers  (2024-12-05T11:12:46Z)
• Safeguarded Progress in Reinforcement Learning: Safe Bayesian Exploration for Control Policy Synthesis [63.532413807686524]
  This paper addresses the problem of maintaining safety during training in Reinforcement Learning (RL) We propose a new architecture that handles the trade-off between efficient progress and safety during exploration.
  arXiv  Detail & Related papers  (2023-12-18T16:09:43Z)
• A Risk-Averse Framework for Non-Stationary Stochastic Multi-Armed Bandits [0.0]
  In areas of high volatility like healthcare or finance, a naive reward approach often does not accurately capture the complexity of the learning problem. We propose a framework of adaptive risk-aware strategies that operate in non-stationary environments.
  arXiv  Detail & Related papers  (2023-10-24T19:29:13Z)
• A Multiplicative Value Function for Safe and Efficient Reinforcement Learning [131.96501469927733]
  We propose a safe model-free RL algorithm with a novel multiplicative value function consisting of a safety critic and a reward critic. The safety critic predicts the probability of constraint violation and discounts the reward critic that only estimates constraint-free returns. We evaluate our method in four safety-focused environments, including classical RL benchmarks augmented with safety constraints and robot navigation tasks with images and raw Lidar scans as observations.
  arXiv  Detail & Related papers  (2023-03-07T18:29:15Z)
• Safety Correction from Baseline: Towards the Risk-aware Policy in Robotics via Dual-agent Reinforcement Learning [64.11013095004786]
  We propose a dual-agent safe reinforcement learning strategy consisting of a baseline and a safe agent. Such a decoupled framework enables high flexibility, data efficiency and risk-awareness for RL-based control. The proposed method outperforms the state-of-the-art safe RL algorithms on difficult robot locomotion and manipulation tasks.
  arXiv  Detail & Related papers  (2022-12-14T03:11:25Z)
• Plan Better Amid Conservatism: Offline Multi-Agent Reinforcement Learning with Actor Rectification [74.10976684469435]
  offline reinforcement learning (RL) algorithms can be transferred to multi-agent settings directly. We propose a simple yet effective method, Offline Multi-Agent RL with Actor Rectification (OMAR), to tackle this critical challenge. OMAR significantly outperforms strong baselines with state-of-the-art performance in multi-agent continuous control benchmarks.
  arXiv  Detail & Related papers  (2021-11-22T13:27:42Z)

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.