The dataset for the paper 'Learning self-supervised traversability with navigation experiences of mobile robots: A risk-aware self-training approach'

Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.

An Efficient Multi-Robot Trajectory Planner for Ground Vehicles.

Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)

Reciprocal Collision Avoidance with Acceleration-Velocity Obstacles (C++)

Optimal Reciprocal Collision Avoidance (C++)

The Hybrid Reciprocal Velocity Obstacle (C++)

Anytime Multi-Agent Path Finding via Large-Neighborhood Search

An efficient solver for lifelong Multi-Agent Path Finding

MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search

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 conti…

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.

An Efficient Multi-Agent Path Finding Solver for Car-Like Robots

<모던 C++ 디자인 패턴> 소스 코드

A distributed TEB planner for multi-robot trajectory planning