Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
A solution of Multi-Agent Path Finding problem
Multi-Agent Pathfinding using A* in Conflict Based Search algorithm
Multiagent Pathfinding Problem for agricultural swarm agents. Used CBS algorithm for search. To know more, refer to the report attached in the link below.
Used Multi Agent Path Finding (MAPF) based on Conflict Based Search (CBS) with A* algorithm implementation to successfully navigate n number of agents through any map without any collision.
Add a description, image, and links to the conflict-based-search topic page so that developers can more easily learn about it.
To associate your repository with the conflict-based-search topic, visit your repo's landing page and select "manage topics."