libMultiRobotPlanning
libMultiRobotPlanning copied to clipboard
whoenig
Library with search algorithms for task and path planning for multi robot/agent systems
https://github.com/whoenig/libMultiRobotPlanning/blob/b01a527103d5a7c0eda529cf0e1ae9568b9b9391/include/libMultiRobotPlanning/a_star.hpp#L85 I think it could have infinite loop if no way from start point to goal point since there is an additional parameter(time) in State. And when you add a...
Some improvement when building our distance graph.
This is the solution of CBS:  This is a better (shorter) solution:  yaml input (after annotation): ``` {agents: [{goal: '14', name: agent0, start: '13'}, {goal: '10', name: agent1,...
This implements 4 speed improvements: * Refactoring of checks into functions (so that I can call them directly and cache the annotated roadmaps more easily) * Implementation of a pre-check...
The paper ECBS said that the node that pushed into the FOCAL from OPEN should meet the condition LB
Hi, I am currently studying MAPF topics. This awesome repo helps me a lot! I am interested in (E)CBS-TA, it is very impressive work. When I tested `ECBS-TA` with unlabeled...
Hello, First of all, thank you for this awesome repository! These implementations will help a lot of people. I just cloned the repository and I ran my own trivial examples....
Currently, just Manhattan distance is used. Switch to a perfect heuristic, as done in (E)CBS-TA.
Firstly thanks a lot for releasing such high-quality code. Kindly, I have question about errors I am facing while running roadmap example in the README. After running `python3 ../tools/annotate_roadmap.py ../test/mapf_simple1_roadmap_to_annotate.yaml...
