Hierarchical path planning for multi-size agents in heterogeneous environments. - Daniel Harabor; Adi Botea (CIG, 2008)

Breaking Path Symmetries on 4-Connected Grid Maps. - Daniel Harabor; Adi Botea (AIIDE, 2010)

An Integrated Modelling, Debugging, and Visualisation Environment for G12. - Andreas Bauer 002; Viorica Botea; Mark Brown; Matt Gray; Daniel Harabor; John K. Slaney (CP, 2010)

Online Graph Pruning for Pathfinding On Grid Maps. - Daniel Damir Harabor; Alban Grastien (AAAI, 2011)

Graph Pruning and Symmetry Breaking on Grid Maps. - Daniel Harabor (IJCAI, 2011)

Path Symmetries in Undirected Uniform-Cost Grids. - Daniel Damir Harabor; Adi Botea; Philip Kilby (SARA, 2011)

Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains - Daniel Harabor; Philip Kilby (CoRR, 2011)

Symmetry-Based Search Space Reduction For Grid Maps - Daniel Harabor; Adi Botea; Philip Kilby (CoRR, 2011)

TRANSIT Routing on Video Game Maps. - Leonid Antsfeld; Daniel Damir Harabor; Philip Kilby; Toby Walsh (AIIDE, 2012)

The JPS Pathfinding System. - Daniel Damir Harabor; Alban Grastien (SOCS, 2012)

Moving Target Search with Compressed Path Databases. - Adi Botea; Jorge A. Baier; Daniel Harabor; Carlos Hernández 003 (ICAPS, 2013)

Path Planning with Compressed All-Pairs Shortest Paths Data. - Adi Botea; Daniel Harabor (ICAPS, 2013)

An Optimal Any-Angle Pathfinding Algorithm. - Daniel Damir Harabor; Alban Grastien (ICAPS, 2013)

Improving Jump Point Search. - Daniel Damir Harabor; Alban Grastien (ICAPS, 2014)

Fast First-Move Queries through Run-Length Encoding. - Ben Strasser; Daniel Harabor; Adi Botea (SOCS, 2014)

Complexity Results for Compressing Optimal Paths. - Adi Botea; Ben Strasser; Daniel Harabor (AAAI, 2015)

The Grid-Based Path Planning Competition: 2014 Entries and Results. - Nathan R. Sturtevant; Jason M. Traish; James R. Tulip; Tansel Uras; Sven Koenig; Ben Strasser; Adi Botea; Daniel Harabor; Steve Rabin (SOCS, 2015)

Simulation and Analysis of Container Freight Train Operations at Port Botany. - Daniel Guimarans; Daniel Harabor; Pascal Van Hentenryck (CoRR, 2015)

Compressing Optimal Paths with Run Length Encoding. - Ben Strasser; Adi Botea; Daniel Harabor (J. Artif. Intell. Res., 2015)

Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps. - Jorge A. Baier; Adi Botea; Daniel Harabor; Carlos Hernández 003 (IEEE Trans. Comput. Intell. AI Games, 2015)

Rail Capacity Modelling with Constraint Programming. - Daniel Harabor; Peter J. Stuckey (CPAIOR, 2016)

Optimal Any-Angle Pathfinding In Practice. - Daniel Damir Harabor; Alban Grastien; Dindar Öz; Vural Aksakalli (J. Artif. Intell. Res., 2016)

Compromise-free Pathfinding on a Navigation Mesh. - Michael Cui; Daniel Damir Harabor; Alban Grastien (IJCAI, 2017)

Two-Oracle Optimal Path Planning on Grid Maps. - Matteo Salvetti; Adi Botea; Alfonso Emilio Gerevini; Daniel Harabor; Alessandro Saetti (ICAPS, 2018)

Forward Search in Contraction Hierarchies. - Daniel Damir Harabor; Peter J. Stuckey (SOCS, 2018)

Fast k-Nearest Neighbor on a Navigation Mesh. - Shizhe Zhao; David Taniar; Daniel Damir Harabor (SOCS, 2018)

Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour. - Shizhe Zhao; Daniel Damir Harabor; David Taniar (CoRR, 2018)

Searching with Consistent Prioritization for Multi-Agent Path Finding. - Hang Ma 001; Daniel Harabor; Peter J. Stuckey; Jiaoyang Li 001; Sven Koenig (AAAI, 2019)

Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. - Jiaoyang Li 001; Daniel Harabor; Peter J. Stuckey; Hang Ma 001; Sven Koenig (AAAI, 2019)

Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols. - Mattia Chiari; Shizhe Zhao; Adi Botea; Alfonso Emilio Gerevini; Daniel Harabor; Alessandro Saetti; Matteo Salvetti; Peter J. Stuckey (ICAPS, 2019)

Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation. - Graeme Gange; Daniel Harabor; Peter J. Stuckey (ICAPS, 2019)

Improving the Combination of JPS and Geometric Containers. - Yue Hu; Daniel Harabor; Long Qin; Quanjun Yin; Cong Hu (ICAPS, 2019)

Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search. - Jiaoyang Li 001; Daniel Harabor; Peter J. Stuckey; Hang Ma 001; Sven Koenig (ICAPS, 2019)

Peak-Hour Rail Demand Shifting with Discrete Optimisation. - John M. Betts; David L. Dowe; Daniel Guimarans; Daniel Damir Harabor; Heshan Kumarage; Peter J. Stuckey; Michael Wybrow (CP, 2019)

Path Planning with CPD Heuristics. - Massimo Bono; Alfonso Emilio Gerevini; Daniel Damir Harabor; Peter J. Stuckey (IJCAI, 2019)

Regarding Jump Point Search and Subgoal Graphs. - Daniel Damir Harabor; Tansel Uras; Peter J. Stuckey; Sven Koenig (IJCAI, 2019)

Branch-and-Cut-and-Price for Multi-Agent Pathfinding. - Edward Lam 001; Pierre Le Bodic; Daniel Damir Harabor; Peter J. Stuckey (IJCAI, 2019)

Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding. - Hang Ma 001; Daniel Harabor; Peter J. Stuckey; Jiaoyang Li 001; Sven Koenig (SOCS, 2019)

Position Paper: From Multi-Agent Pathfinding to Pipe Routing. - Gleb Belov; Liron Cohen 002; Maria Garcia de la Banda; Daniel Harabor; Sven Koenig; Xinrui Wei (CoRR, 2019)

Online Computation of Euclidean Shortest Paths in Two Dimensions. - Ryan Hechenberger; Peter J. Stuckey; Daniel Harabor; Pierre Le Bodic; Muhammad Aamir Cheema (ICAPS, 2020)

Bounded Suboptimal Path Planning with Compressed Path Databases. - Shizhe Zhao; Mattia Chiari; Adi Botea; Alfonso Emilio Gerevini; Daniel Harabor; Alessandro Saetti; Peter J. Stuckey (ICAPS, 2020)

Iterative-Deepening Conflict-Based Search. - Eli Boyarski; Ariel Felner; Daniel Harabor; Peter J. Stuckey; Liron Cohen 002; Jiaoyang Li 001; Sven Koenig (IJCAI, 2020)

Euclidean Pathfinding with Compressed Path Databases. - Bojie Shen; Muhammad Aamir Cheema; Daniel Harabor; Peter J. Stuckey (IJCAI, 2020)

New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. - Jiaoyang Li 001; Graeme Gange; Daniel Harabor; Peter J. Stuckey; Hang Ma 001; Sven Koenig (SOCS, 2020)

From Multi-Agent Pathfinding to 3D Pipe Routing. - Gleb Belov; Wenbo Du 004; Maria Garcia de la Banda; Daniel Harabor; Sven Koenig; Xinrui Wei (SOCS, 2020)

F-Cardinal Conflicts in Conflict-Based Search. - Eli Boyarski; Daniel Harabor; Peter J. Stuckey; Pierre Le Bodic; Ariel Felner (SOCS, 2020)

Organising a Successful AI Online Conference: Lessons from SoCS 2020. - Daniel Harabor; Mauro Vallati (CoRR, 2020)

A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem. - Saman Ahmadi; Guido Tack; Daniel Damir Harabor; Philip Kilby (AAAI, 2021)

f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search. - Eli Boyarski; Ariel Felner; Pierre Le Bodic; Daniel Damir Harabor; Peter J. Stuckey; Sven Koenig (AAAI, 2021)

Symmetry Breaking for k-Robust Multi-Agent Path Finding. - Zhe Chen 016; Daniel Damir Harabor; Jiaoyang Li 001; Peter J. Stuckey (AAAI, 2021)

Jump Point Search with Temporal Obstacles. - Shuli Hu; Daniel Damir Harabor; Graeme Gange; Peter J. Stuckey; Nathan R. Sturtevant (ICAPS, 2021)

Contracting and Compressing Shortest Path Databases. - Bojie Shen; Muhammad Aamir Cheema; Daniel Damir Harabor; Peter J. Stuckey (ICAPS, 2021)

Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles. - Saman Ahmadi; Guido Tack; Daniel Harabor; Philip Kilby (CP, 2021)

Bi-Objective Search with Bi-Directional A. - Saman Ahmadi; Guido Tack; Daniel Harabor; Philip Kilby (ESA, 2021)

Anytime Multi-Agent Path Finding via Large Neighborhood Search. - Jiaoyang Li 001; Zhe Chen 016; Daniel Harabor; Peter J. Stuckey; Sven Koenig (IJCAI, 2021)

Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. - Jiaoyang Li 001; Zhe Chen 016; Yi Zheng; Shao-Hung Chan; Daniel Harabor; Peter J. Stuckey; Hang Ma 001; Sven Koenig (SOCS, 2021)

Bi-Objective Search with Bi-directional A* (Extended Abstract). - Saman Ahmadi; Guido Tack; Daniel Harabor; Philip Kilby (SOCS, 2021)

Further Improved Heuristics For Conflict-Based Search. - Eli Boyarski; Ariel Felner; Pierre Le Bodic; Daniel Harabor; Peter J. Stuckey; Sven Koenig (SOCS, 2021)

ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. - Shao-Hung Chan; Jiaoyang Li 001; Graeme Gange; Daniel Harabor; Peter J. Stuckey; Sven Koenig (SOCS, 2021)

Multi-Target Search in Euclidean Space with Ray Shooting. - Ryan Hechenberger; Daniel Harabor; Muhammad Aamir Cheema; Peter J. Stuckey; Pierre Le Bodic (SOCS, 2021)

Customised Shortest Paths Using a Distributed Reverse Oracle. - Arthur Mahéo; Shizhe Zhao; Hassan Afzaal; Daniel Harabor; Peter J. Stuckey; Mark Wallace 001 (SOCS, 2021)

Pairwise symmetry reasoning for multi-agent path finding search. - Jiaoyang Li 001; Daniel Harabor; Peter J. Stuckey; Hang Ma 001; Graeme Gange; Sven Koenig (Artif. Intell., 2021)

Organizing a Successful Artificial Intelligence Online Conference: Lessons from the 13th Symposium on Combinatorial Search. - Daniel Harabor; Mauro Vallati (AI Mag., 2021)

Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search. - Jiaoyang Li 001; Daniel Harabor; Peter J. Stuckey; Sven Koenig (CoRR, 2021)

Regarding Goal Bounding and Jump Point Search. - Yue Hu; Daniel Harabor; Long Qin; Quanjun Yin (J. Artif. Intell. Res., 2021)

Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery. - Zhe Chen 016; Javier Alonso-Mora; Xiaoshan Bai; Daniel Damir Harabor; Peter J. Stuckey (IEEE Robotics Autom. Lett., 2021)

MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search. - Jiaoyang Li 001; Zhe Chen 016; Daniel Harabor; Peter J. Stuckey; Sven Koenig (AAAI, 2022)

Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. - Shao-Hung Chan; Jiaoyang Li 001; Graeme Gange; Daniel Harabor; Peter J. Stuckey; Sven Koenig (AAAI, 2022)

Multi-Agent Path Finding with Temporal Jump Point Search. - Shuli Hu; Daniel Damir Harabor; Graeme Gange; Peter J. Stuckey; Nathan R. Sturtevant (ICAPS, 2022)

Improving Time-Dependent Contraction Hierarchies. - Bojie Shen; Muhammad Aamir Cheema; Daniel Damir Harabor; Peter J. Stuckey (ICAPS, 2022)

Weight Constrained Path Finding with Bidirectional A. - Saman Ahmadi; Guido Tack; Daniel Harabor; Philip Kilby (SOCS, 2022)

Multi-Train Path Finding Revisited. - Zhe Chen 016; Jiaoyang Li 001; Daniel Harabor; Peter J. Stuckey; Sven Koenig (SOCS, 2022)

Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract). - Ali Davoodi; Mark Wallace 001; Daniel Harabor (SOCS, 2022)

Benchmarks for Pathfinding Search: Iron Harvest. - Daniel Harabor; Ryan Hechenberger; Thomas Jahn (SOCS, 2022)

Dual Euclidean Shortest Path Search (Extended Abstract). - Ryan Hechenberger; Peter J. Stuckey; Pierre Le Bodic; Daniel Damir Harabor (SOCS, 2022)

The JPS Pathfinding System in 3D. - Thomas K. Nobes; Daniel Harabor; Michael Wybrow; Stuart D. C. Walsh (SOCS, 2022)

Fast optimal and bounded suboptimal Euclidean pathfinding. - Bojie Shen; Muhammad Aamir Cheema; Daniel Damir Harabor; Peter J. Stuckey (Artif. Intell., 2022)

Branch-and-cut-and-price for multi-agent path finding. - Edward Lam 001; Pierre Le Bodic; Daniel Harabor; Peter J. Stuckey (Comput. Oper. Res., 2022)

Multi-Target Search in Euclidean Space with Ray Shooting (Full Version). - Ryan Hechenberger; Daniel Harabor; Muhammad Aamir Cheema; Peter J. Stuckey; Pierre Le Bodic (CoRR, 2022)

Enhanced Methods for the Weight Constrained Shortest Path Problem: Constrained Path Finding Meets Bi-objective Search. - Saman Ahmadi; Guido Tack; Daniel Harabor; Philip Kilby (CoRR, 2022)

Optimal Pathfinding on Weighted Grid Maps. - Mark Carlson; Sajjad K. Moghadam; Daniel Damir Harabor; Peter J. Stuckey; Morteza Ebrahimi (AAAI, 2023)

Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search. - Edward Lam 001; Daniel Damir Harabor; Peter J. Stuckey; Jiaoyang Li 001 (ICAPS, 2023)

Beyond Pairwise Reasoning in Multi-Agent Path Finding. - Bojie Shen; Zhe Chen 016; Jiaoyang Li 001; Muhammad Aamir Cheema; Daniel Damir Harabor; Peter J. Stuckey (ICAPS, 2023)

Optimal Routing for Autonomous Vehicles in a Mixed Congested Network Considering Fairness. - Ali Davoodi; Mark Wallace 001; Daniel Harabor; Dong Ngoduy (ITSC, 2023)

Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants. - Thomas K. Nobes; Daniel Harabor; Michael Wybrow; Stuart D. C. Walsh (SOCS, 2023)

Efficient Multi Agent Path Finding with Turn Actions. - Yue Zhang 048; Daniel Harabor; Pierre Le Bodic; Peter J. Stuckey (SOCS, 2023)

Reducing Redundant Work in Jump Point Search. - Shizhe Zhao; Daniel Harabor; Peter J. Stuckey (SOCS, 2023)

Tracking Progress in Multi-Agent Path Finding. - Bojie Shen; Zhe Chen 016; Muhammad Aamir Cheema; Daniel Damir Harabor; Peter J. Stuckey (CoRR, 2023)

Scalable Rail Planning and Replanning with Soft Deadlines. - Zhe Chen 016; Jiaoyang Li 001; Daniel Harabor; Peter J. Stuckey (CoRR, 2023)

Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. - Zhe Chen 016; Daniel Harabor; Jiaoyang Li 001; Peter J. Stuckey (AAAI, 2024)

Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search. - Shao-Hung Chan; Zhe Chen 016; Dian-Lun Lin; Yue Zhang 048; Daniel Harabor; Sven Koenig; Tsung-Wei Huang; Thomy Phan (AAMAS, 2024)

Exact Multi-objective Path Finding with Negative Weights. - Saman Ahmadi; Nathan R. Sturtevant; Daniel Harabor; Mahdi Jalili (ICAPS, 2024)

Planning and Execution in Multi-Agent Path Finding: Models and Algorithms. - Yue Zhang 048; Zhe Chen 016; Daniel Harabor; Pierre Le Bodic; Peter J. Stuckey (ICAPS, 2024)

Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract). - Zhe Chen 016; Daniel Harabor; Jiaoyang Li 001; Peter J. Stuckey (SOCS, 2024)

Efficient and Exact Public Transport Routing via a Transfer Connection Database. - Abdallah Abu-Aisha; Mark Wallace 001; Daniel Harabor; Bojie Shen (SOCS, 2024)

Avoiding Node Re-Expansions Can Break Symmetry Breaking. - Mark Carlson; Daniel Harabor; Peter J. Stuckey (SOCS, 2024)

Prioritised Planning with Guarantees. - Jonathan Morag; Yue Zhang 048; Daniel Koyfman; Zhe Chen 016; Ariel Felner; Daniel Harabor; Roni Stern (SOCS, 2024)

Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract). - Yue Zhang 048; Zhe Chen 016; Daniel Harabor; Pierre Le Bodic; Peter J. Stuckey (SOCS, 2024)

Real-Time Energy-Optimal Path Planning for Electric Vehicles. - Saman Ahmadi; Guido Tack; Daniel Harabor; Philip Kilby; Mahdi Jalili (CoRR, 2024)

Guards: Benchmarks for weighted grid-based pathfinding. - Sajjad K. Moghadam; Morteza Ebrahimi; Daniel Damir Harabor (Expert Syst. Appl., 2024)

Enhanced methods for the weight constrained shortest path problem. - Saman Ahmadi; Guido Tack; Daniel Harabor; Philip Kilby; Mahdi Jalili (Networks, 2024)

Snapshot-Optimal Real-Time Ride Sharing. - Hassan Afzaal; Mark Wallace 001; Irene Moser; Daniel Damir Harabor (Inf., 2024)

Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding. - Hongzhi Zang; Yulun Zhang 002; He Jiang; Zhe Chen 016; Daniel Harabor; Peter J. Stuckey; Jiaoyang Li 001 (AAAI, 2025)

Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities. - Yue Zhang 048; Zhe Chen 016; Daniel Harabor; Pierre Le Bodic; Peter J. Stuckey (AAAI, 2025)

Constraint-Based In-Station Train Dispatching. - Andreas Schutt; Matteo Cardellini; Jip J. Dekker; Daniel Harabor; Marco Maratea; Mauro Vallati (CP, 2025)

CBS with Continuous-Time Revisit. - Andy Li; Zhe Chen 016; Daniel Harabor (CoRR, 2025)

Parallelizing Multi-objective A* Search. - Saman Ahmadi; Nathan R. Sturtevant; Andrea Raith; Daniel Harabor; Mahdi Jalili (CoRR, 2025)

Real-Time LaCAM. - Runzhe Liang; Rishi Veerapaneni; Daniel Harabor; Jiaoyang Li 001; Maxim Likhachev (CoRR, 2025)

Anytime Single-Step MAPF Planning with Anytime PIBT. - Nayesha Gandotra; Rishi Veerapaneni; Muhammad Suhail Saleem; Daniel Harabor; Jiaoyang Li 001; Maxim Likhachev (CoRR, 2025)

Dynamic Replanning for Improved Public Transport Routing. - Abdallah Abu-Aisha; Bojie Shen; Daniel Harabor; Peter J. Stuckey; Mark Wallace 001 (CoRR, 2025)

Online Submission and Evaluation System Design for Competition Operations. - Zhe Chen 016; Daniel Harabor; Ryan Hechenberger; Nathan R. Sturtevant (CoRR, 2025)

Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery. - Yue Zhang 048; Zhe Chen 016; Daniel Harabor; Pierre Le Bodic; Peter J. Stuckey (CoRR, 2025)