Papers with Code 아카이브
Multi-Agent Path Finding
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences
A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution
Caching-Augmented Lifelong Multi-Agent Path Finding
Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report
Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding
A Conflict-Aware Optimal Goal Assignment Algorithm for Multi-Robot Systems
Optimal Task Assignment and Path Planning using Conflict-Based Search with Precedence and Temporal Constraints
Guidance Graph Optimization for Lifelong Multi-Agent Path Finding
Multi-agent Path Finding for Cooperative Autonomous Driving
Scalable Mechanism Design for Multi-Agent Path Finding
Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yet
Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search
Improved Anonymous Multi-Agent Path Finding Algorithm
Optimizing Crowd-Aware Multi-Agent Path Finding through Local Communication with Graph Neural Networks
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding
SACHA: Soft Actor-Critic with Heuristic-Based Attention for Partially Observable Multi-Agent Path Finding
Selective Communication for Cooperative Perception in End-to-End Autonomous Driving
On Computing Universal Plans for Partially Observable Multi-Agent Path Finding
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
Tracking Progress in Multi-Agent Path Finding
Multi-Robot Coordination and Layout Design for Automated Warehousing
Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses
The Study of Highway for Lifelong Multi-Agent Path Finding
Robust Multi-Agent Pickup and Delivery with Delays
Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality
Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding
An Efficient Approach to the Online Multi-Agent Path Finding Problem by Using Sustainable Information
Heuristically Guided Compilation for Multi-Agent Path Finding
Multi Agent Path Finding using Evolutionary Game Theory
Cost Splitting for Multi-Objective Conflict-Based Search
Multi-Agent Path Finding via Tree LSTM
SOCIALMAPF: Optimal and Efficient Multi-Agent Path Finding with Strategic Agents for Social Navigation
Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding
Multi-Goal Multi-Agent Pickup and Delivery
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.