Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
-
Updated
Oct 13, 2021 - Python
Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
An Efficient Multi-Agent Path Finding Solver for Car-Like Robots
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.
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.
Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)
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…
📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)
Multi-agent pathfinding via Conflict Based Search
Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)
simple multi-agent pathfinding (MAPF) visualizer for research usage
JAX-based implementation for multi-agent path planning (MAPP) in continuous spaces.
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
Multi-Agent Pickup and Delivery implementation
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
[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.
"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. 🤖🛤️
Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)
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."