pulakk/ConflictAvoidantCBS-MAPF

Conflict Avoidant CBS (CA-CBS)

21
/ 100
Experimental

This project helps robotics engineers and logistics planners efficiently navigate multiple autonomous agents, like warehouse robots, through shared spaces without collisions. You input the environment layout and the starting and ending points for each robot, and it outputs a set of safe, coordinated paths. This tool is for anyone managing multi-robot systems where collision avoidance and optimal pathfinding are critical.

No commits in the last 6 months.

Use this if you need to generate collision-free paths for multiple robots or vehicles in a confined or shared environment.

Not ideal if you are looking for a solution for single-agent pathfinding or if your agents can dynamically re-plan their routes in real-time without a pre-computed global plan.

robotics warehouse-automation logistics-planning multi-agent-navigation pathfinding
Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 5 / 25
Maturity 16 / 25
Community 0 / 25

How are scores calculated?

Stars

9

Forks

Language

C#

License

AGPL-3.0

Last pushed

Feb 28, 2020

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/agents/pulakk/ConflictAvoidantCBS-MAPF"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.