11 citations · 20 across the 7 of their papers we have counts for
8 papers
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…
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…
Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding
Hongzhi Zang, Yulun Zhang, He Jiang +4
We study the problem of optimizing a guidance policy capable of dynamically guiding the agents for lifelong Multi-Agent Path Finding based on real-time traffic patterns. Multi-Agen…
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding
Zhe Chen, Daniel Harabor, Jiaoyang Li +1
Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics that asks us to compute collision-free paths for a team of agents, all moving across a shared map. Although man…
Reducing Redundant Work in Jump Point Search
Shizhe Zhao, Daniel Harabor, Peter J. Stuckey
JPS (Jump Point Search) is a state-of-the-art optimal algorithm for online grid-based pathfinding. Widely used in games and other navigation scenarios, JPS nevertheless can exhibit…
Scalable Rail Planning and Replanning with Soft Deadlines
Zhe Chen, Jiaoyang Li, Daniel Harabor +1
The Flatland Challenge, which was first held in 2019 and reported in NeurIPS 2020, is designed to answer the question: How to efficiently manage dense traffic on complex rail netwo…
Tracking Progress in Multi-Agent Path Finding
Bojie Shen, Zhe Chen, Muhammad Aamir Cheema +2
Multi-Agent Path Finding (MAPF) is an important core problem for many new and emerging industrial applications. Many works appear on this topic each year, and a large number of sub…
Selecting and scheduling an optimal subset of road network upgrades
A. D. Stivala, P. J. Stuckey, M. G. Wallace
We consider the problem of choosing a subset of proposed road network upgrades to implement within a fixed budget in order to optimize the benefit in terms of vehicle hours travell…