Multi-Agent Reinforcement Learning for Dynamic Mobility Resource Allocation with Hierarchical Adaptive Grouping
Farshid Nooshi, Suining He

TL;DR
This paper introduces HAG-PS, a hierarchical multi-agent reinforcement learning method that adaptively shares policies for urban mobility resource allocation, improving efficiency and scalability in large-scale environments.
Contribution
The paper presents a novel hierarchical adaptive grouping approach with memory-efficient parameter sharing for multi-agent reinforcement learning in urban mobility.
Findings
HAG-PS outperforms baseline methods in bike availability.
Adaptive agent grouping improves policy sharing efficiency.
Real-world NYC data validates the method's effectiveness.
Abstract
Allocating mobility resources (e.g., shared bikes/e-scooters, ride-sharing vehicles) is crucial for rebalancing the mobility demand and supply in the urban environments. We propose in this work a novel multi-agent reinforcement learning named Hierarchical Adaptive Grouping-based Parameter Sharing (HAG-PS) for dynamic mobility resource allocation. HAG-PS aims to address two important research challenges regarding multi-agent reinforcement learning for mobility resource allocation: (1) how to dynamically and adaptively share the mobility resource allocation policy (i.e., how to distribute mobility resources) across agents (i.e., representing the regional coordinators of mobility resources); and (2) how to achieve memory-efficient parameter sharing in an urban-scale setting. To address the above challenges, we have provided following novel designs within HAG-PS. To enable dynamic and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
