nitkannen/Multi-Agent-Path-Planning-MAPD-

A novel offline Multi-Agent Path Planning approach using MLA* and IDA* with Floyd Warshall based heuristic computation

29
/ 100
Experimental

This project helps optimize the movement of multiple robots or automated guided vehicles (AGVs) in a warehouse or factory setting. Given a map of the area and a list of all pickup and delivery tasks for each agent, it calculates the most efficient, collision-free paths for all agents to complete their assignments. This is useful for operations managers or logistics planners who need to coordinate automated fleets.

No commits in the last 6 months.

Use this if you need to pre-plan the optimal routes for a fleet of robots or automated vehicles for a known set of pickup and delivery tasks in a fixed environment.

Not ideal if your tasks or environment change dynamically in real-time, as this solution is designed for offline, pre-defined scenarios.

warehouse-logistics robotics fleet-management operations-planning material-handling
No License Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 6 / 25
Maturity 8 / 25
Community 15 / 25

How are scores calculated?

Stars

19

Forks

4

Language

C++

License

Last pushed

Apr 12, 2021

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/agents/nitkannen/Multi-Agent-Path-Planning-MAPD-"

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