Generalizable Collaborative Search-and-Capture in Cluttered Environments via Path-Guided MAPPO and Directional Frontier Allocation

• URL: http://arxiv.org/abs/2512.09410v1
• Date: Wed, 10 Dec 2025 08:09:12 GMT
• Title: Generalizable Collaborative Search-and-Capture in Cluttered Environments via Path-Guided MAPPO and Directional Frontier Allocation
• Abstract summary: Collaborative pursuit-evasion in cluttered environments presents significant challenges due to sparse rewards and constrained Fields of View.<n>We propose PGF-MAPPO, a hierarchical framework bridging topological planning with reactive control.<n>Experiments demonstrate that PGF-MAPPO achieves superior capture efficiency against faster evaders.
• Score: 7.6658082440595186
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Collaborative pursuit-evasion in cluttered environments presents significant challenges due to sparse rewards and constrained Fields of View (FOV). Standard Multi-Agent Reinforcement Learning (MARL) often suffers from inefficient exploration and fails to scale to large scenarios. We propose PGF-MAPPO (Path-Guided Frontier MAPPO), a hierarchical framework bridging topological planning with reactive control. To resolve local minima and sparse rewards, we integrate an A*-based potential field for dense reward shaping. Furthermore, we introduce Directional Frontier Allocation, combining Farthest Point Sampling (FPS) with geometric angle suppression to enforce spatial dispersion and accelerate coverage. The architecture employs a parameter-shared decentralized critic, maintaining O(1) model complexity suitable for robotic swarms. Experiments demonstrate that PGF-MAPPO achieves superior capture efficiency against faster evaders. Policies trained on 10x10 maps exhibit robust zero-shot generalization to unseen 20x20 environments, significantly outperforming rule-based and learning-based baselines.

Related papers

• FPAS: Frontier-Based Path Planning with Adaptive Sampling for Large-Scale Unknown Environments [13.528491182593264]
  We propose Frontier-based Path Planning with Adaptive Sampling (FPAS)<n>FPAS is a novel framework designed for efficient goal-reaching in large-scale, unknown environments.
  arXiv  Detail & Related papers  (2026-06-22T04:24:11Z)
• Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network [5.81838331663612]
  Mobile robot path planning methods are often constrained by vast search spaces, resulting in latency in samplingbased algorithms.<n>We present the Connectivity- Preserving Region Proposal Network (CP-RPN), a segmentationguided model designed to predict compact and topologically connected candidate regions.
  arXiv  Detail & Related papers  (2026-05-27T11:59:03Z)
• Palm-sized Omnidirectional Vision-Based UAV Exploration with Sparse Topological Map Guidance [30.757664816308345]
  This paper presents a lightweight autonomous exploration system that leverages omnidirectional vision and sparse topological map guidance.<n>Specifically, we utilize a multi-fisheye camera setup to achieve omnidirectional Field of View (FoV) and perform depth estimation.<n>Unlike classic dense representations, our approach abstracts the environment using a sparse topological map composed of key nodes and their descriptors.
  arXiv  Detail & Related papers  (2026-05-08T05:40:20Z)
• Too Correct to Learn: Reinforcement Learning on Saturated Reasoning Data [55.84428098924793]
  We propose Constrained Uniform Top-K Sampling (CUTS), a parameter-free decoding strategy enforcing structure-preserving exploration.<n>We integrate this into Mixed-CUTS, a training framework synergizing exploitative and exploratory rollouts to amplify intra-group advantage variance.<n> Notably, Mixed-CUTS improves Pass@1 accuracy on the challenging AIME25 benchmark by up to 15.1% over standard GRPO.
  arXiv  Detail & Related papers  (2026-04-20T16:43:28Z)
• S-GRPO: Unified Post-Training for Large Vision-Language Models [11.901218794806796]
  We propose Supervised Group Relative Policy Optimization (S-GRPO) for adapting Large Vision-Language Models (LVLMs)<n>S-GRPO integrates the guidance of imitation learning into the multi-trajectory exploration of preference optimization.<n>It gracefully bridges the gap between Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL)
  arXiv  Detail & Related papers  (2026-04-17T08:39:07Z)
• Enhancing Gradient Inversion Attacks in Federated Learning via Hierarchical Feature Optimization [56.95448807869383]
  Federated Learning (FL) has emerged as a compelling paradigm for privacy-preserving distributed machine learning.<n>Recent studies find that the gradients exchanged in the FL system are also vulnerable to privacy leakage.<n>We propose textbfGradient textbfInversion over textbfFeature textbfDomains (GIFD)
  arXiv  Detail & Related papers  (2026-04-01T14:32:15Z)
• Panoramic Affordance Prediction [94.50813972018504]
  Affordance prediction serves as a critical bridge between perception and action in embodied AI.<n>We present the first exploration into Panoramic Affordance Prediction, utilizing 360-degree imagery.<n>We propose PAP, a training-free, coarse-to-fine pipeline inspired by the human foveal visual system.
  arXiv  Detail & Related papers  (2026-03-16T17:21:49Z)
• Hierarchical Multi-Modal Planning for Fixed-Altitude Sparse Target Search and Sampling [8.90200464018944]
  HIMoS is a fixed-altitude framework for sparse coral search-and-sample missions.<n>System integrates a heterogeneous sensor suite within a two-layer planning architecture.
  arXiv  Detail & Related papers  (2026-03-09T12:53:04Z)
• OmniVL-Guard: Towards Unified Vision-Language Forgery Detection and Grounding via Balanced RL [63.388513841293616]
  Existing forgery detection methods fail to handle the interleaved text, images, and videos prevalent in real-world misinformation.<n>To bridge this gap, this paper targets to develop a unified framework for omnibus vision-language forgery detection and grounding.<n>We propose textbf OmniVL-Guard, a balanced reinforcement learning framework for omnibus vision-language forgery detection and grounding.
  arXiv  Detail & Related papers  (2026-02-11T09:41:36Z)
• GeoGR: A Generative Retrieval Framework for Spatio-Temporal Aware POI Recommendation [15.009742536403763]
  GeoGR is a geographic generative recommendation framework tailored for navigation-based LBS like AMAP.<n>It perceives users' contextual state changes and enables intent-aware POI recommendation.<n>Extensive experiments on multiple real-world datasets demonstrate GeoGR's superiority over state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-02-11T01:48:27Z)
• Mean-Field Control on Sparse Graphs: From Local Limits to GNNs via Neighborhood Distributions [5.081469534056712]
  Mean-field control (MFC) offers a scalable solution to the curse of dimensionality in multi-agent systems.<n>We bridge the gap to real-world network structures by proposing a rigorous framework for MFC on large sparse graphs.
  arXiv  Detail & Related papers  (2026-01-29T09:57:48Z)
• MMP-A*: Multimodal Perception Enhanced Incremental Heuristic Search on Path Planning [8.522882937983972]
  MMP-A* is a multimodal framework that integrates the spatial grounding capabilities of vision-language models with a novel adaptive decay mechanism.<n>We show that MMP-A* achieves near-optimal trajectories with significantly reduced operational costs.
  arXiv  Detail & Related papers  (2026-01-05T08:55:27Z)
• Enhancing Adversarial Transferability by Balancing Exploration and Exploitation with Gradient-Guided Sampling [82.52485740425321]
  Adrial attacks present a critical challenge to deep neural networks' robustness.<n> transferability of adversarial attacks faces a dilemma between Exploitation (maximizing attack potency) and Exploration (enhancing cross-model generalization)
  arXiv  Detail & Related papers  (2025-11-01T05:43:47Z)
• Efficient On-Policy Reinforcement Learning via Exploration of Sparse Parameter Space [15.65017469378437]
  Policy-gradient methods such as PPO are updated along a single gradient direction, leaving the rich local structure of the parameter space unexplored.<n>Previous work has shown that the surrogate gradient is often poorly correlated with the true reward landscape.<n>We introduce ExploRLer, a pluggable pipeline that seamlessly integrates with on-policy algorithms such as PPO and TRPO.
  arXiv  Detail & Related papers  (2025-09-30T07:13:55Z)
• Tree-Guided Diffusion Planner [31.664192839205608]
  Planning with pretrained diffusion emerged as a promising approach for test-time guided control problems.<n>We propose a zero-time test-time planning framework that balances exploration and exploitation through structured trajectory generation.
  arXiv  Detail & Related papers  (2025-08-29T17:27:44Z)
• Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning [56.240199425429445]
  Multi-Robot Motion Planning (MPMP) involves generating trajectories for multiple robots operating in a shared continuous workspace.<n>While discrete multi-agent finding (MAPF) methods are broadly adopted due to their scalability, their coarse discretization trajectory quality.<n>This paper tackles limitations of two approaches by introducing discrete MAPF solvers with constrained generative diffusion models.
  arXiv  Detail & Related papers  (2025-08-27T17:59:36Z)
• SIGMA: Sheaf-Informed Geometric Multi-Agent Pathfinding [11.38008343729117]
  Multi-Agent Path Finding problem is core challenge for robotic deployments in large-scale logistics and transportation.<n>We introduce a new framework that applies sheaf theory to decentralized deep reinforcement learning.<n>Our proposed method demonstrates significant improvements over state-of-the-art learning-based MAPF planners.
  arXiv  Detail & Related papers  (2025-02-10T13:17:34Z)
• Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models [57.45019514036948]
  Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics.<n>This work proposes a novel approach that integrates constrained optimization with diffusion models for MAPF in continuous spaces.
  arXiv  Detail & Related papers  (2024-12-23T21:27:19Z)
• A Simple and Generalist Approach for Panoptic Segmentation [57.94892855772925]
  We propose a simple generalist framework based on a deep encoder - shallow decoder architecture with per-pixel prediction.<n>We show that this is due to imbalance during training and propose a novel method for reducing it.<n>Our method achieves panoptic quality (PQ) of 55.1 on the challenging MS-COCO dataset.
  arXiv  Detail & Related papers  (2024-08-29T13:02:12Z)
• Active Neural Topological Mapping for Multi-Agent Exploration [24.91397816926568]
  Multi-agent cooperative exploration problem requires multiple agents to explore an unseen environment via sensory signals in a limited time. Topological maps are a promising alternative as they consist only of nodes and edges with abstract but essential information. Deep reinforcement learning has shown great potential for learning (near) optimal policies through fast end-to-end inference. We propose Multi-Agent Neural Topological Mapping (MANTM) to improve exploration efficiency and generalization for multi-agent exploration tasks.
  arXiv  Detail & Related papers  (2023-11-01T03:06:14Z)
• POGEMA: Partially Observable Grid Environment for Multiple Agents [64.88759709443819]
  POGEMA is a sandbox for challenging partially observable multi-agent pathfinding (PO-MAPF) problems. It can be tailored to a variety of PO-MAPF, which can serve as an excellent testing ground for planning and learning methods.
  arXiv  Detail & Related papers  (2022-06-22T09:39:50Z)
• Learning Space Partitions for Path Planning [54.475949279050596]
  PlaLaM outperforms existing path planning methods in 2D navigation tasks, especially in the presence of difficult-to-escape local optima. These gains transfer to highly multimodal real-world tasks, where we outperform strong baselines in compiler phase ordering by up to 245% and in molecular design by up to 0.4 on properties on a 0-1 scale.
  arXiv  Detail & Related papers  (2021-06-19T18:06:11Z)

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.