200 citations · 228 across the 18 of their papers we have counts for
20 papers
A Lightweight Traffic Map for Efficient Anytime LaCAM*
Bojie Shen, Yue Zhang, Zhe Chen +1
Multi-Agent Path Finding (MAPF) aims to compute collision-free paths for multiple agents and has a wide range of practical applications. LaCAM*, an anytime configuration-based solv…
Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery
Yue Zhang, Zhe Chen, Daniel Harabor +2
We study the problem of online Multi-Agent Pickup and Delivery (MAPD), where a team of agents must repeatedly serve dynamically appearing tasks on a shared map. Existing online met…
Online Submission and Evaluation System Design for Competition Operations
Zhe Chen, Daniel Harabor, Ryan Hechnenberger +1
Research communities have developed benchmark datasets across domains to compare the performance of algorithms and techniques However, tracking the progress in these research areas…
An Exact System Optimum Assignment Model for Transit Demand Management
Xia Zhou, Mark Wallace, Daniel D. Harabor +1
Mass transit systems are experiencing increasing congestion in many cities. The schedule-based transit assignment problem (STAP) involves a joint choice model for departure times a…
Departure time choice user equilibrium for public transport demand management
Xia Zhou, Zhenliang Ma, Mark Wallace +1
Departure time management is an efficient way in addressing the peak-hour crowding in public transport by reducing the temporal imbalance between service supply and travel demand.…
Dynamic Replanning for Improved Public Transport Routing
Abdallah Abuaisha, Bojie Shen, Daniel Harabor +2
Delays in public transport are common, often impacting users through prolonged travel times and missed transfers. Existing solutions for handling delays remain limited; backup plan…