Repository of the group Funke/Wiedenhöft for the asprilo project about planned merging.
-
Updated
Oct 20, 2021 - TeX
Repository of the group Funke/Wiedenhöft for the asprilo project about planned merging.
Multi-Agent Pathfinding with Matching using Increasing Cost Tree Search
CBS solutions to 240K path finding problems.
A pure Rust implementation of CBS + PC + BP + DG + Diagonal Sub-Solver
An implementation of MAPF with visualization
An ROS implementation of optimal Multi-Agent Pathfinding algorithm ICTS (Increasing Cost Tree Search) , and a simple multi-agent navigation with ridgeback-robot simulated in Gazebo
Visualizer for solutions of the Multi-Agent Path Finding problem (MAPF).
Multi Agent Path Finding assignment for CSCI-360 at USC.
Implementation of some pathfinding and multi-agent pathfinding algorithms
Modern visualizer and simulator of the classic MAPF problem
Conflict-Based Search implementation in Kotlin
Multi Agent Path Finding CBS algorithm with visualization as a mini project in robotics seminar
[AAMAS 2024] HiMAP: Learning Heuristics-Informed Policies for Large-Scale Multi-Agent Pathfinding
Multi Agent Path Finding (MAPF) advanced solver infrastructure with Bi-Directional solver and automated splitting method
Add a description, image, and links to the mapf topic page so that developers can more easily learn about it.
To associate your repository with the mapf topic, visit your repo's landing page and select "manage topics."