Papers with Code 아카이브

Multi-Agent Path Finding

태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.

전체 기법전체 데이터셋

하위 태스크

0

평가표

0

보존된 평가 기록

0

논문

이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.

Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields

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

Multi-Agent Path Finding For Large Agents Is Intractable

Anytime Single-Step MAPF Planning with Anytime PIBT

Real-Time LaCAM

Prioritized Planning for Continuous-time Lifelong Multi-agent Pathfinding

RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks

Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds

SIGMA: Sheaf-Informed Geometric Multi-Agent Pathfinding

A parallelizable variant of HCA*

Hybrid Quantum-Classical Multi-Agent Pathfinding

Simultaneous Computation with Multiple Prioritizations in Multi-Agent Motion Planning

Graph Coloring to Reduce Computation Time in Prioritized Planning

Multi-Agent Path Finding under Limited Communication Range Constraint via Dynamic Leading

Enhancing Lifelong Multi-Agent Path Finding with Cache Mechanism

Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models

Speedup Techniques for Switchable Temporal Plan Graph Optimization

Multi-Agent Motion Planning For Differential Drive Robots Through Stationary State Search

Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions

Transient Multi-Agent Path Finding for Lifelong Navigation in Dense Environments

Multi-agent Path Finding for Timed Tasks using Evolutionary Games

Large-Scale Multi-Robot Coverage Path Planning on Grids with Path Deconfliction

Deploying Ten Thousand Robots: Scalable Imitation Learning for Lifelong Multi-Agent Path Finding

Layered LA-MAPF: a decomposition of large agent MAPF instance to accelerate solving without compromising solvability

MFC-EQ: Mean-Field Control with Envelope Q-Learning for Moving Decentralized Agents in Formation

Windowed MAPF with Completeness Guarantees

Multi-agent Path Finding in Continuous Environment

Multi-agent Path Finding for Mixed Autonomy Traffic Coordination

Multi-Agent Path Finding with Real Robot Dynamics and Interdependent Tasks for Automated Warehouses

Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic

Algorithm Selection for Optimal Multi-Agent Path Finding via Graph Embedding

MGCBS: An Optimal and Efficient Algorithm for Solving Multi-Goal Multi-Agent Path Finding Problem

Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities

ITA-ECBS: A Bounded-Suboptimal Algorithm for the Combined Target-Assignment and Path-Finding Problem

Improving Learnt Local MAPF Policies with Heuristic Search

Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences

출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.