Pith. sign in

REVIEW 3 cited by

POGEMA: A Benchmark Platform for Cooperative Multi-Agent Pathfinding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.14931 v3 pith:EUMIXTOU submitted 2024-07-20 cs.LG cs.AIcs.MA

classification cs.LGcs.AIcs.MA
keywords evaluationcomparisonhybridlearningmethodsmulti-agentclassicalcooperative
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multi-agent reinforcement learning (MARL) has recently excelled in solving challenging cooperative and competitive multi-agent problems in various environments, typically involving a small number of agents and full observability. Moreover, a range of crucial robotics-related tasks, such as multi-robot pathfinding, which have traditionally been approached with classical non-learnable methods (e.g., heuristic search), are now being suggested for solution using learning-based or hybrid methods. However, in this domain, it remains difficult, if not impossible, to conduct a fair comparison between classical, learning-based, and hybrid approaches due to the lack of a unified framework that supports both learning and evaluation. To address this, we introduce POGEMA, a comprehensive set of tools that includes a fast environment for learning, a problem instance generator, a collection of predefined problem instances, a visualization toolkit, and a benchmarking tool for automated evaluation. We also introduce and define an evaluation protocol that specifies a range of domain-related metrics, computed based on primary evaluation indicators (such as success rate and path length), enabling a fair multi-fold comparison. The results of this comparison, which involves a variety of state-of-the-art MARL, search-based, and hybrid methods, are presented.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Search-Aided Joint Agent-Environment Reinforcement Learning for Robust Lifelong Multi-Agent Path Finding with Rotations

    cs.RO 2026-08 conditional novelty 7.0 of 10

    A joint reinforcement learning framework that co-trains robot movement policy and global edge-cost guidance to beat strong baselines in lifelong multi-agent path finding with rotation and safety constraints.

  2. SkyRover: A Modular Simulator for Cross-Domain Pathfinding

    cs.RO 2025-02 conditional novelty 5.0 of 10

    SkyRover is a Gazebo/ROS2 simulator that unifies UAV and AGV pathfinding in 3D grids, with wrappers for search- and learning-based algorithms and low-level controllers, demonstrated by preliminary warehouse benchmarks.

  3. Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding

    cs.AI 2025-05 conditional novelty 4.0 of 10

    A broad survey of MAPF methods that documents inconsistent evaluation practices and proposes a unified taxonomy.

Pith tools