Heuristic Search

Bridging Planning and Execution: Multi-Agent Path Finding Under Real-World Deadlines featured image
Learning for Planning

Bridging Planning and Execution: Multi-Agent Path Finding Under Real-World Deadlines

The Multi-Agent Path Finding (MAPF) problem aims to find collision-free paths for multiple agents while optimizing objectives such as the sum of costs or makespan. MAPF has wide …

Jingtian Yan*
•
Read more
Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions featured image
Heuristic Search

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

Multi-Agent Path Finding (MAPF) seeks collision-free paths for multiple agents from their respective starting locations to their respective goal locations while minimizing path …

Shuai Zhou
•
Read more
Multi-Robot Path Planning Visualizer featured image
Robotics

Multi-Robot Path Planning Visualizer

A Qt-based visualizer for Continuous Multi-Agent Path Finding (MAPF) algorithms. Renders agent movements with smooth trajectories in continuous 2D space.

Read more