aandreychuk Goto Github PK

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

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

lacam3

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

lacaminpogema

libmultirobotplanning

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

mcts

osmbuildings

OSM Buildings Classic 2.5D

pathfinding_algorithms

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.

pogema-baselines

PPO and PyMARL baseline for Pogema environment

primal2

Training code PRIMAL2 - Public Repo

psipp-ctc

push-and-rotate--cbs--prioritizedplanning

3 algorithms for classical MAPF on 4 connected grid in one project

pypibt

Minimal Python implementation of PIBT for MAPF

rhcr

An efficient solver for lifelong Multi-Agent Path Finding

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