AA-SIPP-m
Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allowed to follow any-angle path on the grid). Timeline is continuous, i.e. action durations are not explicitly discretized into timesteps. Different agents' size and moving speed are supported. Planning is carried out in (x, y, \theta) configuration space, i.e. agents' orientation are taken into account.
PathPlanning/AA-SIPP-m
View on GitHub ↗Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allowed to follow any-angle path on the grid). Timeline is continuous, i.e. action durations are not explicitly discretized into timesteps. Different agents' size and moving speed are supported. Planning is carried out in (x, y, \theta) configuration space, i.e. agents' orientation are taken into account.
AA-SIPP-m grew +0.0% in the last 30 days, ranks 65th of 74 in RL Environments, last commit 1,784 days ago.
Star trajectory
79 days tracked+0.0% in 30d, below the RL Environments median of +0.2%.
Last commit 1,784 days ago, staler than the median of 171d.
How it compares in RL Environments
Ranked 65th of 74 by stars.
- Language
- C++
- License
- MIT License
- Contributors
- 2
- Forks
- 38
- Watchers
- 8
- Open issues
- 5
- Releases
- 0
- Created
- 2017-02-09
- Stars this week
- +0
You've seen where AA-SIPP-m stands today.
Get the moves before everyone else: the 5 RL Environments repos climbing fastest, every Tuesday.
Free weekly digest. Double opt-in, unsubscribe anytime.