Daniel Harabor

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 65

Top Topics

Extended Abstract

Top Venues

Publications

Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey
Planning and Execution in Multi-Agent Path Finding: Models and Algorithms. ICAPS (2024)
Shao-Hung Chan, Zhe Chen, Dian-Lun Lin, Yue Zhang, Daniel Harabor, Tsung-Wei Huang, Sven Koenig, Thomy Phan
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search. CoRR (2024)
Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. AAAI (2024)
Mark Carlson, Daniel Harabor, Peter J. Stuckey
Avoiding Node Re-Expansions Can Break Symmetry Breaking. SOCS (2024)
Jonathan Morag, Yue Zhang, Daniel Koyfman, Zhe Chen, Ariel Felner, Daniel Harabor, Roni Stern
Prioritised Planning with Guarantees. SOCS (2024)
Saman Ahmadi, Nathan R. Sturtevant, Daniel Harabor, Mahdi Jalili
Exact Multi-objective Path Finding with Negative Weights. ICAPS (2024)
Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey
Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract). SOCS (2024)
Shao-Hung Chan, Zhe Chen, Dian-Lun Lin, Yue Zhang, Daniel Harabor, Sven Koenig, Tsung-Wei Huang, Thomy Phan
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search. AAMAS (2024)
Abdallah Abu-Aisha, Mark Wallace, Daniel Harabor, Bojie Shen
Efficient and Exact Public Transport Routing via a Transfer Connection Database. SOCS (2024)
Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract). SOCS (2024)
Ali Davoodi, Mark Wallace, Daniel Harabor, Dong Ngoduy
Optimal Routing for Autonomous Vehicles in a Mixed Congested Network Considering Fairness. ITSC (2023)
Shizhe Zhao, Daniel Harabor, Peter J. Stuckey
Reducing Redundant Work in Jump Point Search. CoRR (2023)
Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh
Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants. SOCS (2023)
Shizhe Zhao, Daniel Harabor, Peter J. Stuckey
Reducing Redundant Work in Jump Point Search. SOCS (2023)
Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. CoRR (2023)
Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey
Scalable Rail Planning and Replanning with Soft Deadlines. CoRR (2023)
Yue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey
Efficient Multi Agent Path Finding with Turn Actions. SOCS (2023)
Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version). CoRR (2022)
Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby
Enhanced Methods for the Weight Constrained Shortest Path Problem: Constrained Path Finding Meets Bi-objective Search. CoRR (2022)
Edward Lam, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey
Branch-and-cut-and-price for multi-agent path finding. Comput. Oper. Res. 144 (2022)
Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh
The JPS Pathfinding System in 3D. SOCS (2022)
Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby
Weight Constrained Path Finding with Bidirectional A. SOCS (2022)
Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig
Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. AAAI (2022)
Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig
MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search. AAAI (2022)
Ali Davoodi, Mark Wallace, Daniel Harabor
Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract). SOCS (2022)
Daniel Harabor, Ryan Hechenberger, Thomas Jahn
Benchmarks for Pathfinding Search: Iron Harvest. SOCS (2022)
Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig
Multi-Train Path Finding Revisited. SOCS (2022)
Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. SOCS (2021)
Daniel Harabor, Mauro Vallati
Organizing a Successful Artificial Intelligence Online Conference: Lessons from the 13th Symposium on Combinatorial Search. AI Mag. 42 (1) (2021)
Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig
Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search. CoRR (2021)
Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby
Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles. CP (2021)
Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig
Further Improved Heuristics For Conflict-Based Search. SOCS (2021)
Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby
Bi-Objective Search with Bi-Directional A. ESA (2021)
Arthur Mahéo, Shizhe Zhao, Hassan Afzaal, Daniel Harabor, Peter J. Stuckey, Mark Wallace
Customised Shortest Paths Using a Distributed Reverse Oracle. SOCS (2021)
Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby
Bi-Objective Search with Bi-directional A* (Extended Abstract). SOCS (2021)
Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig
Anytime Multi-Agent Path Finding via Large Neighborhood Search. AAMAS (2021)
Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Graeme Gange, Sven Koenig
Pairwise symmetry reasoning for multi-agent path finding search. Artif. Intell. 301 (2021)
Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey
Symmetry Breaking for k-Robust Multi-Agent Path Finding. CoRR (2021)
Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig
Anytime Multi-Agent Path Finding via Large Neighborhood Search. IJCAI (2021)
Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby
Bi-objective Search with Bi-directional A. CoRR (2021)
Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. ICAPS (2021)
Yue Hu, Daniel Harabor, Long Qin, Quanjun Yin
Regarding Goal Bounding and Jump Point Search. J. Artif. Intell. Res. 70 (2021)
Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic
Multi-Target Search in Euclidean Space with Ray Shooting. SOCS (2021)
Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig
ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. SOCS (2021)
Shizhe Zhao, Mattia Chiari, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Peter J. Stuckey
Bounded Suboptimal Path Planning with Compressed Path Databases. ICAPS (2020)
Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. SOCS (2020)
Gleb Belov, Wenbo Du, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei
From Multi-Agent Pathfinding to 3D Pipe Routing. SOCS (2020)
Daniel Harabor, Mauro Vallati
Organising a Successful AI Online Conference: Lessons from SoCS 2020. CoRR (2020)
Ryan Hechenberger, Peter J. Stuckey, Daniel Harabor, Pierre Le Bodic, Muhammad Aamir Cheema
Online Computation of Euclidean Shortest Paths in Two Dimensions. ICAPS (2020)
Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner
F-Cardinal Conflicts in Conflict-Based Search. SOCS (2020)
Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen, Jiaoyang Li, Sven Koenig
Iterative-Deepening Conflict-Based Search. IJCAI (2020)
Bojie Shen, Muhammad Aamir Cheema, Daniel Harabor, Peter J. Stuckey
Euclidean Pathfinding with Compressed Path Databases. IJCAI (2020)
Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. ICAPS (2020)
Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. AAAI (2019)
Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig
Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding. SOCS (2019)
Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig
Searching with Consistent Prioritization for Multi-Agent Path Finding. AAAI (2019)
Graeme Gange, Daniel Harabor, Peter J. Stuckey
Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation. ICAPS (2019)
Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig
Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search. ICAPS (2019)
Gleb Belov, Liron Cohen, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei
Position Paper: From Multi-Agent Pathfinding to Pipe Routing. CoRR (2019)
Mattia Chiari, Shizhe Zhao, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Matteo Salvetti, Peter J. Stuckey
Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols. ICAPS (2019)
Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. SOCS (2019)
Yue Hu, Daniel Harabor, Long Qin, Quanjun Yin, Cong Hu
Improving the Combination of JPS and Geometric Containers. ICAPS (2019)
Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig
Searching with Consistent Prioritization for Multi-Agent Path Finding. CoRR (2018)
Matteo Salvetti, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti
Two-Oracle Optimal Path Planning on Grid Maps. ICAPS (2018)
Daniel Harabor, Peter J. Stuckey
Rail Capacity Modelling with Constraint Programming. CPAIOR (2016)
Daniel Guimarans, Daniel Harabor, Pascal Van Hentenryck
Simulation and Analysis of Container Freight Train Operations at Port Botany. CoRR (2015)
Jorge A. Baier, Adi Botea, Daniel Harabor, Carlos Hernández
Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps. IEEE Trans. Comput. Intell. AI Games 7 (2) (2015)
Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin
The Grid-Based Path Planning Competition: 2014 Entries and Results. SOCS (2015)
Ben Strasser, Adi Botea, Daniel Harabor
Compressing Optimal Paths with Run Length Encoding. J. Artif. Intell. Res. 54 (2015)
Adi Botea, Ben Strasser, Daniel Harabor
Complexity Results for Compressing Optimal Paths. AAAI (2015)
Ben Strasser, Daniel Harabor, Adi Botea
Fast First-Move Queries through Run-Length Encoding. SOCS (2014)
Adi Botea, Jorge A. Baier, Daniel Harabor, Carlos Hernández
Moving Target Search with Compressed Path Databases. ICAPS (2013)
Adi Botea, Daniel Harabor
Path Planning with Compressed All-Pairs Shortest Paths Data. ICAPS (2013)
Daniel Harabor, Philip Kilby
Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains CoRR (2011)
Daniel Harabor
Graph Pruning and Symmetry Breaking on Grid Maps. IJCAI (2011)
Daniel Harabor, Adi Botea, Philip Kilby
Symmetry-Based Search Space Reduction For Grid Maps CoRR (2011)
Daniel Harabor, Adi Botea
Breaking Path Symmetries on 4-Connected Grid Maps. AIIDE (2010)
Andreas Bauer, Viorica Botea, Mark Brown, Matt Gray, Daniel Harabor, John K. Slaney
An Integrated Modelling, Debugging, and Visualisation Environment for G12. CP (2010)
Daniel Harabor, Adi Botea
Hierarchical path planning for multi-size agents in heterogeneous environments. CIG (2008)