213 skills found · Page 1 of 8
GavinPHR / Multi Agent Path FindingAnonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
gsartoretti / PRIMALPRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning -- Distributed RL/IL code for Multi-Agent Path Finding (MAPF)
h3r2tic / Tony Mc MapfaceA cool-headed display transform
APRIL-ZJU / CL CBSAn Efficient Multi-Agent Path Finding Solver for Car-Like Robots
zhangqian00 / Echarts3 MapFileEcharts3.0地图数据(含全国和省js以及全国、省、区县json)
Cognitive-AI-Systems / Pogema[ICLR-2025] 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 / MAPF settings.
PathPlanning / Continuous CBSContinuous 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.
speedzjy / Mapf RosThis is a multi-agent path planning(also known as Multi-Agent Path Finding, MAPF) algorithm package for ROS/ROS2.
mapfish / Mapfish PrintA component of MapFish for printing templated cartographic maps. This module is the Java serverside module.
Kei18 / Mapf IRIterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)
Jiaoyang-Li / CBSH2 RTCAn optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning
bitkylin / MapForTour基于百度地图 SDK 的多人地图 Android 客户端，已实现对本机和其他用户进行实时定位、绘制实时和历史运行轨迹、地理围栏报警等功能。本作品获得第十一届中国研究生电子设计竞赛华南赛区二等奖。
PathPlanning / AA SIPP MAlgorithm 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.
CognitiveAISystems / MAPF GPT[AAAI-2025] This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on trajectories produced by LaCAM, it generates actions under partial observability without heuristics or agent communication. MAPF-GPT excels on unseen instances and outperforms learnable state-of-the-art solvers
gloriyo / MAPF ICBSMulti-agent pathfinding via Conflict Based Search
Kei18 / Lacam3Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
Jiaoyang-Li / MAPF LNS2MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search
Kei18 / Pibt2Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)
ed-lam / Bcp MapfBCP-MAPF – branch-and-cut-and-price for multi-agent path finding
chenzhike110 / MAPF SolverMulti Agent Path Finding Algorithms
