Cooperative Risk-Aware Exploration in Heterogeneous Multi-Robot Systems Using Algorithmic Altruism

• URL: http://arxiv.org/abs/2608.28409v1
• Date: Fri, 28 Aug 2026 14:57:36 GMT
• Title: Cooperative Risk-Aware Exploration in Heterogeneous Multi-Robot Systems Using Algorithmic Altruism
• Abstract summary: 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.
• Score: 5.8411170261618865
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-robot systems are well-positioned for exploration in hazardous environments, but effective deployment requires deciding not only where robots should gather information, but also how risk should be distributed across heterogeneous team members. This paper develops a game-theoretic framework for cooperative risk-aware exploration based on ecologically inspired altruistic behavior. Each robot selects a finite-horizon trajectory to maximize information gain while penalizing redundant exploration and expected hazard exposure. Heterogeneity is introduced through agent-specific value parameters for encoding altruistic coupling, which is modeled through relatedness weights inspired by Hamilton's rule. We introduce a game-theoretic structure for trajectory planning that defines a Social Nash Equilibrium, which modifies the utility of agent actions according to agent relatedness. This utility shaping causes agents to internalize the effect of their trajectory choices on teammates, encouraging lower-valued robots to accept risk when doing so benefits higher-valued agents and improves team performance. We define an exploration utility for agents that rewards area coverage and uncertainty reduction, while also penalizing redundancy and risk, enabling projected gradient-based waypoint optimization in a receding-horizon planner. Simulations show that altruistic planning reduces redundant exploration, improves inter-robot separation, and reallocates risk according to agent value while maintaining comparable map coverage. We further demonstrate the approach in hardware experiments, where planned waypoints are tracked by wheeled robots using single-integrator controllers and barrier certificates.

Related papers

• SAGE: A Socially-Aware Generative Engine for Heterogeneous Multi-Agent Navigation [20.851820019451587]
  This paper proposes SAGE, a socially-aware generative engine for heterogeneous multi-agent navigation.<n>During inference, SAGE refines sampled robot trajectories using differentiable collision, kinematic, task-progress, and role-conditioned social-compliance terms.<n>The proposed guidance mechanism consistently reduces collision and social-violation rates, scales to teams of up to 20 robots, and enables explicit control of the safety-accuracy-task trade-off without retraining.
  arXiv  Detail & Related papers  (2026-07-18T03:40:59Z)
• World Models as Adversaries: Multi-Agent Self-Play Fine-Tuning for Robust Motion Planning [60.88859946006306]
  Adversa World Modeling is a theoretically grounded multi-agent self-play fine-tuning framework.<n>In inner minimization, the planner's predictive world model is converted into a role-conditioned adversary that learns sparse, scene-adaptive attack coalitions.<n> Experiments on the nuPlan and InterPlan benchmarks demonstrate that our method generates transferable adversarial interactions.
  arXiv  Detail & Related papers  (2026-07-12T07:44:16Z)
• Can Attribution Predict Risk? From Multi-View Attribution to Planning Risk Signals in End-to-End Autonomous Driving [51.726472686971896]
  End-to-end autonomous driving models generate future trajectories from multi-view inputs.<n> Existing methods fail to reveal the visual evidence underlying trajectory generation.<n>We propose a hierarchical attribution framework for end-to-end planning.
  arXiv  Detail & Related papers  (2026-05-07T13:38:18Z)
• 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)
• Multi-Agent Off-World Exploration for Sparse Evidence Discovery via Gaussian Belief Mapping and Dual-Domain Coverage [15.524614683513834]
  We propose a multi-agent informative path planning framework for sparse evidence discovery based on Gaussian belief mapping and dual-domain coverage.<n> Experimental results in simulated lunar environments show that the proposed method consistently outperforms sampling-based and greedy baselines under different budgets and communication ranges.
  arXiv  Detail & Related papers  (2026-03-08T14:27:41Z)
• 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)
• Risk-Bounded Multi-Agent Visual Navigation via Dynamic Budget Allocation [3.7347677698423536]
  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.
  arXiv  Detail & Related papers  (2025-09-09T21:35:55Z)
• REBEL: Reward Regularization-Based Approach for Robotic Reinforcement Learning from Human Feedback [61.54791065013767]
  A misalignment between the reward function and human preferences can lead to catastrophic outcomes in the real world.<n>Recent methods aim to mitigate misalignment by learning reward functions from human preferences.<n>We propose a novel concept of reward regularization within the robotic RLHF framework.
  arXiv  Detail & Related papers  (2023-12-22T04:56:37Z)
• Learning Risk-Aware Quadrupedal Locomotion using Distributional Reinforcement Learning [12.156082576280955]
  Deployment in hazardous environments requires robots to understand the risks associated with their actions and movements to prevent accidents. We propose a risk sensitive locomotion training method employing distributional reinforcement learning to consider safety explicitly. We show emergent risk sensitive locomotion behavior in simulation and on the quadrupedal robot ANYmal.
  arXiv  Detail & Related papers  (2023-09-25T16:05:32Z)
• 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)
• Risk-Sensitive Sequential Action Control with Multi-Modal Human Trajectory Forecasting for Safe Crowd-Robot Interaction [55.569050872780224]
  We present an online framework for safe crowd-robot interaction based on risk-sensitive optimal control, wherein the risk is modeled by the entropic risk measure. Our modular approach decouples the crowd-robot interaction into learning-based prediction and model-based control. A simulation study and a real-world experiment show that the proposed framework can accomplish safe and efficient navigation while avoiding collisions with more than 50 humans in the scene.
  arXiv  Detail & Related papers  (2020-09-12T02:02:52Z)

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.