Daniel Harabor

Daniel Harabor

Auto-generated profile, based on publicly available information

Daniel Harabor

Monash University

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 April 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
Zhe ChenZhe Chen
Zhe Chen
JAJavier Alonso-Mora
Javier Alonso-Mora
XBXiaoshan Bai
Xiaoshan Bai
DHDaniel Damir Harabor
Daniel Damir Harabor
PSPeter Stuckey
Peter Stuckey
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 to a specified target location. Appearing in the context of automated warehouse logistics and automated mail sortation, MAPD requires first deciding which robot is assigned what task (i.e., Task Assignment or TA) followed by a subsequent coordination problem where each robot must be assigned collision-free paths so as to successfully complete its assignment (i.e., Multi-Agent Path Finding or MAPF). Leading methods in this area solve MAPD sequentially: first assigning tasks, then assigning paths. In this work we propose a new coupled method where task assignment choices are informed by actual delivery costs instead of by lower-bound estimates. The main ingredients of our approach are a marginal-cost assignment heuristic and a meta-heuristic improvement strategy based on Large Neighbourhood Search. As a further contribution, we also consider a variant of the MAPD problem where each robot can carry multiple tasks instead of just one. Numerical simulations show that our approach yields efficient and timely solutions and we report significant improvement compared with other recent methods from the literature.

17 July 2019 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
HMHang Ma
Hang Ma
DHDaniel Harabor
Daniel Harabor
PSPeter Stuckey
Peter Stuckey
JLJiaoyang Li
Jiaoyang Li
SKSven Koenig
Sven Koenig
We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed total priority ordering of all agents a priori. We instead explore the space of all possible partial priority orderings as part of a novel systematic and conflict-driven combinatorial search framework. In a variety of empirical comparisons, we demonstrate state-of-the-art solution qualities and success rates, often with similar runtimes to existing algorithms. We also develop new theoretical results that explore the limitations of prioritized planning, in terms of completeness and optimality, for the first time.

1 December 2021 in Artificial Intelligence
Verified
Journal Article
Closed access
JLJiaoyang Li
Jiaoyang Li
DHDaniel Harabor
Daniel Harabor
PSPeter J. Stuckey
Peter J. Stuckey
HMHang Ma
Hang Ma
GGGraeme Gange
Graeme Gange
SKSven Koenig
Sven Koenig

6 April 2022 in Computers & Operations Research
Verified
Journal Article
Closed access
ELEdward Lam
Edward Lam
PBPierre Le Bodic
Pierre Le Bodic
DHDaniel Harabor
Daniel Harabor
PSPeter Stuckey
Peter Stuckey

24 March 2024 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
Zhe ChenZhe Chen
Zhe Chen
DHDaniel Harabor
Daniel Harabor
JLJiaoyang Li
Jiaoyang Li
PSPeter Stuckey
Peter Stuckey
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 many works appear on this topic, all current algorithms struggle as the number of agents grows. The principal reason is that existing approaches typically plan free-flow optimal paths, which creates congestion. To tackle this issue, we propose a new approach for MAPF where agents are guided to their destination by following congestion-avoiding paths. We evaluate the idea in two large-scale settings: one-shot MAPF, where each agent has a single destination, and lifelong MAPF, where agents are continuously assigned new destinations. Empirically, we report large improvements in solution quality for one-short MAPF and in overall throughput for lifelong MAPF.

11 April 2025 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
HZHongzhi Zang
Hongzhi Zang
YZYulun Zhang
Yulun Zhang
HJHe Jiang
He Jiang
Zhe ChenZhe Chen
Zhe Chen
DHDaniel Harabor
Daniel Harabor
JLJiaoyang Li
Jiaoyang Li
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-Agent Path Finding (MAPF) focuses on moving multiple agents from their starts to goals without collisions. Its lifelong variant, LMAPF, continuously assigns new goals to agents. In this work, we focus on improving the solution quality of PIBT, a state-of-the-art rule-based LMAPF algorithm, by optimizing a policy to generate adaptive guidance. We design two pipelines to incorporate guidance in PIBT in two different ways. We demonstrate the superiority of the optimized policy over both static guidance and human-designed policies. Additionally, we explore scenarios where task distribution changes over time, a challenging yet common situation in real-world applications that is rarely explored in the literature.