arXiv Machine Learning By Brandon Ho, Nikola Rogers, Seung-Kyum Choi

Shared-Roadmap Generation and Evaluator for Multi-Agent Path Planning Using Heterogeneous Graph Neural Network

Read the original on arXiv Machine Learning →

The paper introduces a scalable heterogeneous Graph Neural Network framework that automatically generates and evaluates shared roadmaps for multi‑agent path planning in continuous environments. By representing waypoints, agent locations, and task locations as distinct nodes, the GNN learns from expert solver trajectories to identify critical points and prune redundant connections, producing a compact, coordination‑aware roadmap. Experiments show the approach can reduce planning effort, achieving at least a 40% reduction in runtime and graph size for dense roadmaps.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 22

Node-as-Agent: Graph Agentic Network

arXiv:2508. 00429v5 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) have achieved remarkable success in graph-based learning by propagating information among neighbor nodes via predefined aggregation mechanisms.

By Minghao Guo, Xi Zhu, Qingyue Jiao, Xiujin Liu, Haochen Xue, Chong Zhang, Shuhang Lin, Jingyuan Huang, Ziyi Ye, Yongfeng Zhang
arXiv Machine Learning
Sep 25

Graph-Based Inference and Topology-Aware Multi-Agent Reinforcement Learning for Large-Scale Railway Network Management

The paper presents a graph-based framework for large-scale railway network management, combining a hierarchical Bayesian model with a Gaussian Process on a graph kernel to infer spatially correlated maintenance environments from Swiss Federal Railways data. It introduces a topology-aware Multi-Agent Reinforcement Learning system that uses graph neural networks and Transformers to optimize network-level policies. The approach demonstrates scalability via zero-shot transfer learning, enabling agents trained on small network segments to perform effectively on unseen large networks, outperforming heuristics and standard MARL baselines while reducing training time.

By Giacomo Arcieri, Gregory Duth\'e, Christophe Muller, Konstantinos G. Papakonstantinou, Daniel Straub, Eleni Chatzi
arXiv AI
6d ago

MAPF-World: Action World Model for Multi-Agent Path Finding

MAPF-World introduces an autoregressive action world model for multi‑agent path finding that predicts short‑horizon local observations and neighboring agents’ action intentions, enabling decisions beyond immediate local views. The model incorporates a spatio‑agent positional encoding within Transformer architectures to enhance spatial awareness and agent semantics, fostering coordinated behaviors. Experiments on diverse maps, including a new automated map generator based on real‑world urban layouts, show that MAPF‑World outperforms existing learned solvers, achieving strong performance, robust zero‑shot generalization, and high success rates even at high agent densities.

By Zhanjiang Yang, Yueming Li, Yang Shen, Meng Li, Lijun Sun
arXiv AI
Jul 24

Compact Latent Coordination for Autonomous Vehicles at Unsignalized Intersections

arXiv:2607. 21488v1 Announce Type: cross Abstract: Coordinating autonomous vehicles at unsignalized intersections remains a critical challenge for multi-agent reinforcement learning (MARL) systems, which typically struggle with combinatorial action spaces, reliance on privileged information, or rigid agent designs.

By Gil Lifshits, Igal Bilik, Gilad Katz