Optimization of Edge Directions and Weights for Mixed Guidance Graphs in Lifelong Multi-Agent Path Finding
Not on the map. Why?
Abstract (arXiv)
Multi-Agent Path Finding (MAPF) aims to move agents from their start to goal vertices on a graph. Lifelong MAPF (LMAPF) continuously assigns new goals to agents as they complete current ones. To guide agents' movement in LMAPF, prior works have proposed Guidance Graph Optimization (GGO) methods to optimize a guidance graph, which is a bidirected weighted graph whose directed edges represent moving and waiting actions with edge weights being action costs. Higher edge weights represent higher action costs. However, edge weights only provide soft guidance. An edge with a high weight only discourages agents from using it, instead of prohibiting agents from traversing it. In this paper, we explore the need to incorporate edge directions optimization into GGO, providing strict guidance. We generalize GGO to Mixed Guidance Graph Optimization (MGGO), presenting two MGGO methods capable of optimizing both edge weights and directions. The first optimizes edge directions and edge weights in two phases separately. The second applies Quality Diversity algorithms to optimize a neural network capable of generating edge directions and weights. We also incorporate traffic patterns relevant to edge directions into a GGO method, making it capable of generating edge-direction-aware guidance graphs.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 45 references that are in the map. First posted on arXiv 26 Feb 2026.
Builds on
24 of 45 references.
References · 24
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016The CMA Evolution Strategy: A Tutorialcited by 364
- 2019Multi-Agent Pathfinding: Definitions, Variants, and Benchmarkscited by 197
- 2018Searching with Consistent Prioritization for Multi-Agent Path Findingcited by 80
- 2020Lifelong Multi-Agent Path Finding in Large-Scale Warehousescited by 79
- 2019Priority Inheritance with Backtracking for Iterative Multi-agent Path Findingcited by 55
- 2020Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Networkcited by 51
- 2022Deep Surrogate Assisted Generation of Environmentscited by 40
- 2019Mapping Hearthstone Deck Spaces through MAP-Elites with Sliding Boundariescited by 32
- 2023pyribs: A Bare-Bones Python Library for Quality Diversity Optimizationcited by 29
- 2021Deep Surrogate Assisted MAP-Elites for Automated Hearthstone Deckbuildingcited by 26
- 2022Covariance Matrix Adaptation MAP-Annealingcited by 24
12 more
- 2017Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environmentscited by 21
- 2023Traffic Flow Optimisation for Lifelong Multi-Agent Path Findingcited by 14
- 2019Idle Time Optimization for Target Assignment and Path Finding in Sortation Centerscited by 13
- 2024Guidance Graph Optimization for Lifelong Multi-Agent Path Findingcited by 12
- 2023Arbitrarily Scalable Environment Generators via Neural Cellular Automatacited by 9
- 2024Quality-Diversity Algorithms Can Provably Be Helpful for Optimizationcited by 9
- 2024Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunitiescited by 9
- 2024Multi-Agent Motion Planning For Differential Drive Robots Through Stationary State Searchcited by 8
- 2021Optimizing Space Utilization for More Effective Multi-Robot Path Planningcited by 6
- 2025Enhancing PIBT via Multi-Action Operationscited by 5
- 2025Destination-to-Chutes Task Mapping Optimization for Multi-Robot Coordination in Robotic Sorting Systemscited by 3
- 2023The Study of Highway for Lifelong Multi-Agent Path Findingcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.