Daniel Harabor

Expert Syst. Appl., 2024

Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding.

[BibT_eX]

[DOI]

CoRR, 2024

Real-Time Energy-Optimal Path Planning for Electric Vehicles.

[BibT_eX]

[DOI]

CoRR, 2024

Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Prioritised Planning with Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Avoiding Node Re-Expansions Can Break Symmetry Breaking.

[BibT_eX]

[DOI]

Mark Carlson

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Efficient and Exact Public Transport Routing via a Transfer Connection Database.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Planning and Execution in Multi-Agent Path Finding: Models and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Exact Multi-objective Path Finding with Negative Weights.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Scalable Rail Planning and Replanning with Soft Deadlines.

[BibT_eX]

[DOI]

CoRR, 2023

Tracking Progress in Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Zhe Chen

CoRR, 2023

Reducing Redundant Work in Jump Point Search.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Efficient Multi Agent Path Finding with Turn Actions.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Optimal Routing for Autonomous Vehicles in a Mixed Congested Network Considering Fairness.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Intelligent Transportation Systems, 2023

Beyond Pairwise Reasoning in Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Zhe Chen

Jiaoyang Li

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Optimal Pathfinding on Weighted Grid Maps.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Enhanced Methods for the Weight Constrained Shortest Path Problem: Constrained Path Finding Meets Bi-objective Search.

[BibT_eX]

[DOI]

CoRR, 2022

Multi-Target Search in Euclidean Space with Ray Shooting (Full Version).

[BibT_eX]

[DOI]

Ryan Hechenberger

Pierre Le Bodic

CoRR, 2022

Branch-and-cut-and-price for multi-agent path finding.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

Fast optimal and bounded suboptimal Euclidean pathfinding.

[BibT_eX]

[DOI]

Artif. Intell., 2022

The JPS Pathfinding System in 3D.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Dual Euclidean Shortest Path Search (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Benchmarks for Pathfinding Search: Iron Harvest.

[BibT_eX]

[DOI]

Ryan Hechenberger

Thomas Jahn

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract).

[BibT_eX]

[DOI]

Ali Davoodi

Mark Wallace

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Multi-Train Path Finding Revisited.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Weight Constrained Path Finding with Bidirectional A.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Improving Time-Dependent Contraction Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Multi-Agent Path Finding with Temporal Jump Point Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2021

Regarding Goal Bounding and Jump Point Search.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search.

[BibT_eX]

[DOI]

CoRR, 2021

Organizing a Successful Artificial Intelligence Online Conference: Lessons from the 13th Symposium on Combinatorial Search.

[BibT_eX]

[DOI]

Mauro Vallati

AI Mag., 2021

Pairwise symmetry reasoning for multi-agent path finding search.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Customised Shortest Paths Using a Distributed Reverse Oracle.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Multi-Target Search in Euclidean Space with Ray Shooting.

[BibT_eX]

[DOI]

Ryan Hechenberger

Pierre Le Bodic

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Further Improved Heuristics For Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Bi-Objective Search with Bi-directional A* (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Anytime Multi-Agent Path Finding via Large Neighborhood Search.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Bi-Objective Search with Bi-Directional A.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Contracting and Compressing Shortest Path Databases.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Jump Point Search with Temporal Obstacles.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Symmetry Breaking for k-Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Organising a Successful AI Online Conference: Lessons from SoCS 2020.

[BibT_eX]

[DOI]

Mauro Vallati

CoRR, 2020

F-Cardinal Conflicts in Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

From Multi-Agent Pathfinding to 3D Pipe Routing.

[BibT_eX]

[DOI]

Gleb Belov

Wenbo Du

Maria Garcia de la Banda

Sven Koenig

Xinrui Wei

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Euclidean Pathfinding with Compressed Path Databases.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Iterative-Deepening Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Bounded Suboptimal Path Planning with Compressed Path Databases.

[BibT_eX]

[DOI]

Mattia Chiari

Alessandro Saetti

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Online Computation of Euclidean Shortest Paths in Two Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019

Position Paper: From Multi-Agent Pathfinding to Pipe Routing.

[BibT_eX]

[DOI]

Gleb Belov

Liron Cohen

Maria Garcia de la Banda

Sven Koenig

Xinrui Wei

CoRR, 2019

Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Branch-and-Cut-and-Price for Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Regarding Jump Point Search and Subgoal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Path Planning with CPD Heuristics.

[BibT_eX]

[DOI]

Massimo Bono

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Peak-Hour Rail Demand Shifting with Discrete Optimisation.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Improving the Combination of JPS and Geometric Containers.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation.

[BibT_eX]

[DOI]

Graeme Gange

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols.

[BibT_eX]

[DOI]

Mattia Chiari

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Searching with Consistent Prioritization for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour.

[BibT_eX]

[DOI]

David Taniar

CoRR, 2018

Fast k-Nearest Neighbor on a Navigation Mesh.

[BibT_eX]

[DOI]

David Taniar

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Forward Search in Contraction Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Two-Oracle Optimal Path Planning on Grid Maps.

[BibT_eX]

[DOI]

Matteo Salvetti

Alessandro Saetti

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017

Compromise-free Pathfinding on a Navigation Mesh.

[BibT_eX]

[DOI]

Michael Cui

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

Optimal Any-Angle Pathfinding In Practice.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Rail Capacity Modelling with Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

2015

Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Intell. AI Games, 2015

Compressing Optimal Paths with Run Length Encoding.

[BibT_eX]

[DOI]

Ben Strasser

J. Artif. Intell. Res., 2015

Simulation and Analysis of Container Freight Train Operations at Port Botany.

[BibT_eX]

[DOI]

Daniel Guimarans

Pascal Van Hentenryck

CoRR, 2015

The Grid-Based Path Planning Competition: 2014 Entries and Results.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Complexity Results for Compressing Optimal Paths.

[BibT_eX]

[DOI]

Ben Strasser

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Fast First-Move Queries through Run-Length Encoding.

[BibT_eX]

[DOI]

Ben Strasser

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Improving Jump Point Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013

An Optimal Any-Angle Pathfinding Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Path Planning with Compressed All-Pairs Shortest Paths Data.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Moving Target Search with Compressed Path Databases.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012

The JPS Pathfinding System.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

TRANSIT Routing on Video Game Maps.

[BibT_eX]

[DOI]

Proceedings of the Eighth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2012

2011

Symmetry-Based Search Space Reduction For Grid Maps

[BibT_eX]

[DOI]

Philip Kilby

CoRR, 2011

Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains

[BibT_eX]

[DOI]

Philip Kilby

CoRR, 2011

Path Symmetries in Undirected Uniform-Cost Grids.

[BibT_eX]

[DOI]

Philip Kilby

Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, 2011

Graph Pruning and Symmetry Breaking on Grid Maps.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Online Graph Pruning for Pathfinding On Grid Maps.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

An Integrated Modelling, Debugging, and Visualisation Environment for G12.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Breaking Path Symmetries on 4-Connected Grid Maps.

[BibT_eX]

[DOI]

Proceedings of the Sixth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2010

2008

Hierarchical path planning for multi-size agents in heterogeneous environments.

[BibT_eX]

[DOI]