oelin/darpy
A user-friendly implementation of the DARP algorithm for multi-agent coverage path planning (MCPP).
This helps operations managers or robotics engineers efficiently plan how multiple autonomous robots or vehicles can completely cover an area, like a warehouse floor or a survey site, without missing spots. You provide a map of the area, mark any obstacles, and specify the starting points for your robots, and it calculates the optimal paths for each robot to cover the entire space.
No commits in the last 6 months.
Use this if you need to plan efficient coverage paths for multiple autonomous agents (like drones or ground robots) over a defined area, ensuring all parts are visited while avoiding obstacles.
Not ideal if you are looking for single-agent path planning or if your agents have dynamic, non-fixed starting positions and tasks.
Stars
19
Forks
3
Language
Python
License
MIT
Category
Last pushed
Jan 29, 2023
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/oelin/darpy"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
caelan/pddlstream
PDDLStream: Integrating Symbolic Planners and Blackbox Samplers
realkushagrakhare/3D_Path_Planning
AI project for 3D Path Planning. Other details and running instructions can be found on the...
DillonZChen/wlplan
Relational Features for Planning
enlite-ai/maze
Maze Applied Reinforcement Learning Framework
APLA-Toolbox/PythonPDDL
🧭🔍 A PDDL Planner in Python partially wrapping PDDL.jl using JuliaPy