The multi-robot path planning problem is the problem of finding optimal (or close to optimal) paths for n robots simultaneously without collisions where each robot has a designated start and goal state. This problem can be solved in different ways, ranging from greedy search methods to heuristic algorithms.
The multi-robot path planning problem is the problem of finding optimal (or close to optimal) paths for n robots simultaneously without collisions where each robot has a designated start and goal state. This problem can be solved in different ways, ranging from greedy search methods to heuristic algorithms.
License
ezrafielding/BotPath
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The multi-robot path planning problem is the problem of finding optimal (or close to optimal) paths for n robots simultaneously without collisions where each robot has a designated start and goal state. This problem can be solved in different ways, ranging from greedy search methods to heuristic algorithms.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published