Anton Andreychuk's repositories
AStar-JPS-ThetaStar
Basic algorithms for single-shot grid-based path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*
Push-and-Rotate--CBS--PrioritizedPlanning
3 algorithms for classical MAPF on 4 connected grid in one project
SuboptimalSIPP
Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.
Continuous-CBS
Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.
hog2
Automatically exported from code.google.com/p/hog2
libMultiRobotPlanning
Library with search algorithms for task and path planning for multi robot/agent systems
lacam3
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
osmbuildings
OSM Buildings Classic 2.5D
pogema-baselines
PPO and PyMARL baseline for Pogema environment
PRIMAL2
Training code PRIMAL2 - Public Repo
pypibt
Minimal Python implementation of PIBT for MAPF
RHCR
An efficient solver for lifelong Multi-Agent Path Finding