Multi Agent Path Finding assignment for CSCI-360 at USC.
-
Updated
Feb 4, 2020 - C++
Multi Agent Path Finding assignment for CSCI-360 at USC.
CBS solutions to 240K path finding problems.
Conflict-Based Search implementation in Kotlin
A pure Rust implementation of CBS + PC + BP + DG + Diagonal Sub-Solver
This is the repo for the team Pikachu's solution in the League of Robot Competition 2023. Our solution won the Overall Best and Fast Mover tracks and ranked second in the Line Honours track.
[AAAI-2024] MATS-LP addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed approach utilizes a combination of Monte Carlo Tree Search and reinforcement learning for resolving conflicts.
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
Multi-Agent Pathfinding with Matching using Increasing Cost Tree Search
Combinatorial Decision Making and Optimization Course Project.
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
Implementation of some pathfinding and multi-agent pathfinding algorithms
Visualizer for solutions of the Multi-Agent Path Finding problem (MAPF).
Modern visualizer and simulator of the classic MAPF problem
Conflict Avoidant CBS (CA-CBS)
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."