aandreychuk

AA-SIPP

Optimal any-angle planner for a single agent in environments with dynamic obstacles

AStar-JPS-ThetaStar

Basic algorithms for single-shot grid-based path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*

bookbot

pogema

POGEMA stands for Partially-Observable Grid Environment for Multiple Agents. This is a grid-based environment that was specifically designed to be flexible, tunable and scalable. It can be tailored to a variety of PO-MAPF settings.

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.

Theta_ROS

Theta* algorithm that can work with inputs and outputs of ROS

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.

evaluation_configs

hog2

Automatically exported from code.google.com/p/hog2

Lab1

Programming

libMultiRobotPlanning

Library with search algorithms for task and path planning for multi robot/agent systems

MCTS

lacam3

Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)

LacamInPogema

osmbuildings

OSM Buildings Classic 2.5D

pathfinding_algorithms

pogema-baselines

PPO and PyMARL baseline for Pogema environment

PRIMAL2

Training code PRIMAL2 - Public Repo

PSIPP-CTC

pypibt

Minimal Python implementation of PIBT for MAPF

RHCR

An efficient solver for lifelong Multi-Agent Path Finding