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.
Multi-agent pathfinding via Conflict Based Search
Conflict-based search for multi-agent path finding (MAPF)
A solution of Multi-Agent Path Finding problem
Stochastic Conflict-Based Allocation
Conflict-based search for optimal multi-agent pathfinding
naive implementations of Multi-Agent Path Finding algorithms
A Rust implementation of Continuous Conflict-Based Search for Multi-Agent Path Finding
Conflict Avoidant CBS (CA-CBS)
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.
Yet Another Sat solvER
Conflict-Based Search implementation in Kotlin
Statistical models for multi-agent path planning in dynamic environments.
MAPF: CBS optimal solver + MAPPO with transformer communication, CBS-bootstrapped curriculum, lifelong goals — pure PyTorch, Mac-native
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.
The Multi Agent Transportation Problem: Solvers, Evaluations, and Computer-Assisted Proofs
CBS solutions to 240K path finding problems.
Deterministic multi-agent planning with disruption recovery, bounded strategy comparison, independent validation, and reproducible evidence.
To associate your repository with the conflict-based-search topic, visit your repo's landing page and select "manage topics."