Pinned Repositories
boOX
Multi-agent path finding (MAPF), Token Swapping (TSWAP) and related solvers. Among others SMT-based solvers, variants of CBS, and SAT-based solvers are implemented. Recently also continuous variants of MAPF (MAPF^R) are supported.
CBSH2
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search
CBSH2-RTC
An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning
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.
EECBS
A bounded-suboptimal solver for Multi-Agent Path Finding
Flatland
Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.
hog2
Pathfinding and search testbed/visualization suite. Current code is in PDB-refactor branch.
idcbs
Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques
multi_agent_path_planning
Python implementation of a bunch of multi-robot path-planning algorithms.
PRIMAL2
Training code PRIMAL2 - Public Repo
AlbaIntelligence's Repositories
AlbaIntelligence/CBSH2
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search
AlbaIntelligence/hog2
Pathfinding and search testbed/visualization suite. Current code is in PDB-refactor branch.
AlbaIntelligence/idcbs
Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques
AlbaIntelligence/RHCR
An efficient solver for lifelong Multi-Agent Path Finding
AlbaIntelligence/TO-AA-SIPP
Time-Optimal Any-Angle Safe Interval Path Planning
AlbaIntelligence/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.
AlbaIntelligence/CBS--PrioritizedPlanning--MP
AlbaIntelligence/CBS-SIPP
C++ implementation of CBS with using SIPP as a low-level planner
AlbaIntelligence/CL-CBS
An Efficient Multi-Agent Path Finding Solver for Car-Like Robots
AlbaIntelligence/CRH_Star
A framework offering a scalable, and deadlock-free implementation of prioritised planning with novel customisation options designed to improve performance.
AlbaIntelligence/Dstar-lite-pathplanner
Implementation of the D* lite algorithm in Python for "Improved Fast Replanning for Robot Navigation in Unknown Terrain"
AlbaIntelligence/flatland-challenge
Multi-agent reinforcement learning on trains, for Deep Learning class at UNIBO
AlbaIntelligence/Genie.jl
The highly productive Julia web framework
AlbaIntelligence/LIAN
Heuristic search algorithm for generating smooth paths for single-shot grid-based 2D path finding.
AlbaIntelligence/LPLian
Lifelong Planning version of LIAN algorithm
AlbaIntelligence/Multi-agent-Path-Finding-in-Warehouse
Robotic Order Fulfillment System Using Kiva-like mobile robots. Conflict-based Search multi-robot path planning.
AlbaIntelligence/PathPlanning
Common used path planning algorithms with animations.
AlbaIntelligence/sbpl
Search-Based Planning Library
AlbaIntelligence/unlabeled-MAPF
Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution
AlbaIntelligence/Digital-Real-Estate-Index
AlbaIntelligence/Genie_Guides_Books
AlbaIntelligence/regime_switch_model
Regime-Switching Model
AlbaIntelligence/shapley_confidence
AlbaIntelligence/StippleDemos
Demo apps for Stipple
AlbaIntelligence/tracebase
Multivariate time series forecasting on high-dimensional and sparse Uber movement speed data.
AlbaIntelligence/xai_stories
XAI Stories. Case studies for eXplainable Artificial Intelligence
AlbaIntelligence/xai_stories_2
XAI Stories 2.0. eXplainable Artificial Intelligence for Retail Analytics - case studies