nicofretti/MAPF

A solution of Multi-Agent Path Finding problem

28
/ 100
Experimental

This project helps operations engineers and logistics planners efficiently coordinate multiple robots or automated guided vehicles (AGVs) within a shared space, like a warehouse or factory floor. It takes as input the map of an environment and the starting and ending locations for several agents, then outputs collision-free paths for each agent to reach its destination. This ensures smooth, simultaneous movement without bottlenecks or accidents.

No commits in the last 6 months.

Use this if you need to find the most efficient, conflict-free paths for multiple moving entities in a confined, obstacle-filled environment.

Not ideal if your agents' paths are independent and don't require coordination to avoid collisions, or if you only need to optimize the path for a single agent.

robotics logistics warehouse-automation pathfinding operations-management
No License Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 9 / 25
Maturity 8 / 25
Community 11 / 25

How are scores calculated?

Stars

70

Forks

7

Language

Python

License

Last pushed

Apr 16, 2024

Commits (30d)

0

Get this data via API

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

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