simple multi-agent pathfinding (MAPF) visualizer for research usage
-
Updated
May 22, 2024 - C++
simple multi-agent pathfinding (MAPF) visualizer for research usage
This is the repo for the team Pikachu's solution in the League of Robot Competition 2023. Our solution won the Overall Best and Fast Mover tracks and ranked second in the Line Honours track.
📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)
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.
[AAAI-2024] Follower: This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follower approach utilizes a combination of a planning algorithm for constructing a long-term plan and reinforcement learning for resolving local conflicts.
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
Multi-agent pathfinding via Conflict Based Search
[AAAI-2024] MATS-LP addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed approach utilizes a combination of Monte Carlo Tree Search and reinforcement learning for resolving conflicts.
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.
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
EPH: Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding
An ROS implementation of optimal Multi-Agent Pathfinding algorithm ICTS (Increasing Cost Tree Search) , and a simple multi-agent navigation with ridgeback-robot simulated in Gazebo
[AAMAS 2024] HiMAP: Learning Heuristics-Informed Policies for Large-Scale Multi-Agent Pathfinding
MAPF instance generator
"When to Switch" Implementation: Addressing the PO-MAPF challenge with RePlan & EPOM policies. This repo includes search-based re-planning, reinforcement learning techniques, and three mixed policies for pathfinding in partially observable multi-agent environments. 🤖🛤️
Minimal Python implementation of LaCAM* for MAPF
Add a description, image, and links to the mapf topic page so that developers can more easily learn about it.
To associate your repository with the mapf topic, visit your repo's landing page and select "manage topics."