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…
Anytime Single-Step MAPF Planning with Anytime PIBT
Nayesha Gandotra, Rishi Veerapaneni, Muhammad Suhail Saleem +3
PIBT is a popular Multi-Agent Path Finding (MAPF) method at the core of many state-of-the-art MAPF methods including LaCAM, CS-PIBT, and WPPL. The main utility of PIBT is that it i…
Real-Time LaCAM for Real-Time MAPF
Runzhe Liang, Rishi Veerapaneni, Daniel Harabor +2
The vast majority of Multi-Agent Path Finding (MAPF) methods with completeness guarantees require planning full-horizon paths. However, planning full-horizon paths can take too lon…
Parallelizing Multi-objective A* Search
Saman Ahmadi, Nathan R. Sturtevant, Andrea Raith +2
The Multi-objective Shortest Path (MOSP) problem is a classic network optimization problem that aims to find all Pareto-optimal paths between two points in a graph with multiple ed…
CBS with Continuous-Time Revisit
Andy Li, Zhe Chen, Danial Harabor +1
Multi-Agent Path Finding in Continuous Time (\mapfr) extends the classical MAPF problem by allowing agents to operate in continuous time. Conflict-Based Search with Continuous Time…
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…
Efficient Energy-Optimal Path Planning for Electric Vehicles Considering Vehicle Dynamics
Saman Ahmadi, Guido Tack, Daniel Harabor +2
The rapid adoption of electric vehicles (EVs) in modern transport systems has made energy-aware routing a critical task in their successful integration, especially within large-sca…
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search
Shao-Hung Chan, Zhe Chen, Dian-Lun Lin +5
Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths for multiple agents in a shared environment while minimizing the sum of travel time. Since s…
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…
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)
Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema +2
The Euclidean shortest path problem (ESPP) is a well studied problem with many practical applications. Recently a new efficient online approach to this problem, RayScan, has been d…
Enhanced Methods for the Weight Constrained Shortest Path Problem
Saman Ahmadi, Guido Tack, Daniel Harabor +2
The classic problem of constrained pathfinding is a well-studied, yet challenging, topic in AI with a broad range of applications in various areas such as communication and transpo…
Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery
Zhe Chen, Javier Alonso-Mora, Xiaoshan Bai +2
Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of robots is tasked with transporting a set of tasks, each from an initial location and each…