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)
Multi-agent pathfinding via Conflict Based Search
Stochastic Conflict-Based Allocation
A solution of Multi-Agent Path Finding problem
Conflict-based search for optimal multi-agent pathfinding
naive implementations of Multi-Agent Path Finding algorithms
Conflict Avoidant CBS (CA-CBS)
Multi-Agent Pathfinding using A* in Conflict Based Search algorithm
A Rust implementation of Continuous Conflict-Based Search for Multi-Agent Path Finding
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
Conflict-Based Search implementation in Kotlin
Statistical models for multi-agent path planning in dynamic environments.
The Multi Agent Transportation Problem: Solvers, Evaluations, and Computer-Assisted Proofs
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.
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.
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."