There are 3 repositories under conflict-based-search topic.
Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.
Conflict-based search for multi-agent path finding (MAPF)
A solution of Multi-Agent Path Finding problem
Conflict-based search for optimal multi-agent pathfinding
Conflict Avoidant CBS (CA-CBS)
Multiagent Pathfinding Problem for agricultural swarm agents. Used CBS algorithm for search. To know more, refer to the report attached in the link below.
Yet Another Sat solvER
Multi-Agent Pathfinding using A* in Conflict Based Search algorithm
Statistical models for multi-agent path planning in dynamic environments.
Conflict-Based Search implementation in Kotlin
CBS solutions to 240K path finding problems.
A large dataset containing optimal actions taken by conflict-based search (CBS) with five agents on random 20x20 maps.