SOTAVerified

Multi-Agent Path Finding

Papers

Showing 51100 of 140 papers

TitleStatusHype
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants0
MS*: A New Exact Algorithm for Multi-agent Simultaneous Multi-goal Sequencing and Path Finding0
Multi-Agent Path Finding For Large Agents Is Intractable0
Multi-agent Path Finding for Mixed Autonomy Traffic Coordination0
Multi-agent Path Finding for Timed Tasks using Evolutionary Games0
Multi-agent Path Finding in Continuous Environment0
Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models0
Multi-Agent Path Finding under Limited Communication Range Constraint via Dynamic Leading0
Multi Agent Path Finding using Evolutionary Game Theory0
Multi Agent Path Finding with Awareness for Spatially Extended Agents0
Multi-Agent Path Finding with Capacity Constraints0
Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT)0
Multi-Agent Path Finding with Deadlines0
Multi-Agent Path Finding with Deadlines: Preliminary Results0
Multi-Agent Path Finding with Delay Probabilities0
Windowed MAPF with Completeness Guarantees0
Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality0
Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences0
A Competitive Analysis of Online Multi-Agent Path Finding0
A Conflict-Aware Optimal Goal Assignment Algorithm for Multi-Robot Systems0
A Feedback Scheme to Reorder a Multi-Agent Execution Schedule by Persistently Optimizing a Switchable Action Dependency Graph0
AI Buzzwords Explained: Multi-Agent Path Finding (MAPF)0
A Job-Assignment Heuristic for Lifelong Multi-Agent Path Finding Problem with Multiple Delivery Locations0
Algorithm Selection for Optimal Multi-Agent Path Finding via Graph Embedding0
An Efficient Approach to the Online Multi-Agent Path Finding Problem by Using Sustainable Information0
Anytime Single-Step MAPF Planning with Anytime PIBT0
A parallelizable variant of HCA*0
A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach0
Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution0
Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities0
Conflict-Based Search for Connected Multi-Agent Path Finding0
Conflict-Based Search for Explainable Multi-Agent Path Finding0
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance0
Optimizing Cooperative path-finding: A Scalable Multi-Agent RRT* with Dynamic Potential Fields0
Cooperative Task and Motion Planning for Multi-Arm Assembly Systems0
Cost Splitting for Multi-Objective Conflict-Based Search0
Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding0
Optimizing Crowd-Aware Multi-Agent Path Finding through Local Communication with Graph Neural Networks0
Decentralised Approach for Multi Agent Path Finding0
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds0
Robust Multi-Agent Pickup and Delivery with Delays0
Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report0
Searching with Consistent Prioritization for Multi-Agent Path Finding0
Selective Communication for Cooperative Perception in End-to-End Autonomous Driving0
SOCIALMAPF: Optimal and Efficient Multi-Agent Path Finding with Strategic Agents for Social Navigation0
Speedup Techniques for Switchable Temporal Plan Graph Optimization0
Symmetry Breaking for k-Robust Multi-Agent Path Finding0
The Multi-Agent Pickup and Delivery Problem: MAPF, MARL and Its Warehouse Applications0
The Study of Highway for Lifelong Multi-Agent Path Finding0
Tracking Progress in Multi-Agent Path Finding0
Show:102550
← PrevPage 2 of 3Next →

No leaderboard results yet.