SOTAVerified

Multi-Agent Path Finding

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 101–140 of 140 papers

TitleStatusHype
Subdimensional Expansion for Multi-objective Multi-agent Path FindingCode1
Improving Continuous-time Conflict Based SearchCode1
A Conflict-Based Search Framework for Multi-Objective Multi-Agent Path FindingCode1
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search—0
Learning to Select Nodes in Bounded Suboptimal Conflict-Based Search for Multi-Agent Path Finding—0
A Feedback Scheme to Reorder a Multi-Agent Execution Schedule by Persistently Optimizing a Switchable Action Dependency Graph—0
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path FindingCode1
Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming—0
Multi Agent Path Finding with Awareness for Spatially Extended Agents—0
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering—0
Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming—0
Resolving Head-On Conflicts for Multi-Agent Path Finding with Conflict-Based Search—0
Conflict-Based Search for Connected Multi-Agent Path Finding—0
Lifelong Multi-Agent Path Finding in Large-Scale WarehousesCode1
A Job-Assignment Heuristic for Lifelong Multi-Agent Path Finding Problem with Multiple Delivery Locations—0
Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings—0
Optimized Directed Roadmap Graph for Multi-Agent Path Finding Using Stochastic Gradient Descent—0
Optimizing Cooperative path-finding: A Scalable Multi-Agent RRT* with Dynamic Potential Fields—0
Multi-Agent Path Finding with Capacity Constraints—0
On the Tour Towards DPLL(MAPF) and Beyond—0
Position Paper: From Multi-Agent Pathfinding to Pipe Routing—0
From Abstractions to Grounded Languages for Robust Coordination of Task Planning Robots—0
Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT)—0
A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach—0
Searching with Consistent Prioritization for Multi-Agent Path Finding—0
Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search—0
Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT—0
Multi-Agent Path Finding with Deadlines—0
Multi-Agent Path Finding with Deadlines: Preliminary Results—0
AI Buzzwords Explained: Multi-Agent Path Finding (MAPF)—0
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments—0
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants—0
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers—0
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery TasksCode0
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios—0
Optimal Target Assignment and Path Finding for Teams of Agents—0
Multi-Agent Path Finding with Delay Probabilities—0
Resolving Spatial-Time Conflicts In A Set Of Any-angle Or Angle-constrained Grid Paths—0
Justifying and Improving Meta-Agent Conflict-Based Search—0
Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal Environment—0
Show:102550
← PrevPage 3 of 3Next →

No leaderboard results yet.