Adi Botea

Alessandro Saetti

Peter J. Stuckey

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

Parallel AND/OR Search for Marginal MAP.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Computing Multi-Modal Journey Plans under Uncertainty.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

An Evaluation Framework for Interactive Recommender System.

[BibT_eX]

[DOI]

Oznur Alkan

Elizabeth M. Daly

CoRR, 2019

Generating Dialogue Agents via Automated Planning.

[BibT_eX]

[DOI]

CoRR, 2019

AI fun matters.

[BibT_eX]

[DOI]

AI Matters, 2019

Crosswords.

[BibT_eX]

[DOI]

AI Matters, 2019

An Evaluation Framework for Interactive Recommender Systems.

[BibT_eX]

[DOI]

Oznur Alkan

Elizabeth M. Daly

Proceedings of the Adjunct Publication of the 27th Conference on User Modeling, 2019

Repairing Compressed Path Databases on Maps with Dynamic Changes.

[BibT_eX]

[DOI]

Marco Verzeletti

Marina Zanella

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

IRF: interactive recommendation through dialogue.

[BibT_eX]

[DOI]

Oznur Alkan

Massimiliano Mattetti

Elizabeth M. Daly

Inge Vejsbjerg

Proceedings of the 13th ACM Conference on Recommender Systems, 2019

Depth-First Proof-Number Search with Heuristic Edge Cost and Application to Chemical Synthesis Planning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Where can my career take me?: harnessing dialogue for interactive career goal recommendations.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Intelligent User Interfaces, 2019

Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Mattia Chiari

Shizhe Zhao

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

Anytime Recursive Best-First Search for Bounding Marginal MAP.

[BibT_eX]

[DOI]

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

2018

Solving Multi-agent Path Finding on Strongly Biconnected Digraphs.

[BibT_eX]

[DOI]

Davide Bonusi

Pavel Surynek

J. Artif. Intell. Res., 2018

On the Complexity of Quantum Circuit Compilation.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract).

[BibT_eX]

[DOI]

Davide Bonusi

Pavel Surynek

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 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

AI Meets Chemistry.

[BibT_eX]

[DOI]

Beat Buesser

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Parallel A* for State-Space Search.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017

A Survey of Parallel A.

[BibT_eX]

[DOI]

CoRR, 2017

A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents.

[BibT_eX]

[DOI]

Fan Xie

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

Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads.

[BibT_eX]

[DOI]

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

Efficient Optimal Search under Expensive Edge Cost Computation.

[BibT_eX]

[DOI]

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

Compressed Path Databases with Ordered Wildcard Substitutions.

[BibT_eX]

[DOI]

Matteo Salvetti

Alessandro Saetti

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016

Hedging the Risk of Delays in Multimodal Journey Planning.

[BibT_eX]

[DOI]

AI Mag., 2016

Service Bundle Recommendation for Person-Centered Care Planning in Cities.

[BibT_eX]

[DOI]

Proceedings of the Exploring Complexity in Health: An Interdisciplinary Systems Approach - Proceedings of MIE2016 at HEC2016, Munich, Germany, 28 August, 2016

Combining Deterministic and Nondeterministic Search for Optimal Journey Planning Under Uncertainty.

[BibT_eX]

[DOI]

Elizabeth Daly

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Scalable Exact MAP Inference in Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 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

Reports from the 2015 AAAI Workshop Program.

[BibT_eX]

[DOI]

AI Mag., 2015

Active Learning for Multi-relational Data Construction.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on World Wide Web, 2015

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

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Mobility Mining for Journey Planning in Rome.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2015

Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Managing travels with PETRA: The Rome use case.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Data Engineering Workshops, 2015

Contingent versus Deterministic Plans in Multi-Modal Journey Planning.

[BibT_eX]

[DOI]

Stefano Braghin

Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Complexity Results for Compressing Optimal Paths.

[BibT_eX]

[DOI]

Ben Strasser

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

Multi-Agent Path Finding on Strongly Biconnected Digraphs.

[BibT_eX]

[DOI]

Pavel Surynek

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

2014

Stochastic Travel Planning for Unreliable Public Transportation Systems.

[BibT_eX]

[DOI]

Tim Nonner

Marco Laumanns

ERCIM News, 2014

Fast First-Move Queries through Run-Length Encoding.

[BibT_eX]

[DOI]

Ben Strasser

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Multi-criteria journey aware housing recommender system.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM Conference on Recommender Systems, 2014

Spatially Distributed Multiagent Path Planning.

[BibT_eX]

[DOI]

Christopher Makoto Wilt

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

2013

Evaluation of a simple, scalable, parallel best-first search strategy.

[BibT_eX]

[DOI]

Artif. Intell., 2013

Uncertainty in urban mobility: Predicting waiting times for shared bicycles and parking lots.

[BibT_eX]

[DOI]

Proceedings of the 16th International IEEE Conference on Intelligent Transportation Systems, 2013

Search in Real-Time Video Games.

[BibT_eX]

[DOI]

Proceedings of the Artificial and Computational Intelligence in Games, 2013

Pathfinding in Games.

[BibT_eX]

[DOI]

Proceedings of the Artificial and Computational Intelligence in Games, 2013

Multi-Modal Journey Planning in the Presence of Uncertainty.

[BibT_eX]

[DOI]

Evdokia Nikolova

Michele Berlingerio

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

Optimal Reconfiguration for Supply Restoration With Informed A<sup>*</sup> Search.

[BibT_eX]

[DOI]

Jussi Rintanen

Debdeep Banerjee

IEEE Trans. Smart Grid, 2012

Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Fast, Optimal Pathfinding with Compressed Path Databases.

[BibT_eX]

[DOI]

Cristina Beltran Orihuela

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Testing the prospective evaluation of a new healthcare system.

[BibT_eX]

[DOI]

Proceedings of the AMIA 2012, 2012

Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms on Clouds, Grids, and Shared Clusters.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2011

Symmetry-Based Search Space Reduction For Grid Maps

[BibT_eX]

[DOI]

CoRR, 2011

On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Path Symmetries in Undirected Uniform-Cost Grids.

[BibT_eX]

[DOI]

Daniel Damir Harabor

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

Ultra-Fast Optimal Pathfinding without Runtime Search.

[BibT_eX]

[DOI]

Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2011

Solution Quality Improvements for Massively Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

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

2010

On the Scaling Behavior of HDA.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Scalable Multi-Agent Pathfinding on Grid Maps with Tractability and Completeness Guarantees.

[BibT_eX]

[DOI]

Proceedings of the ECAI 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

2009

Tractable Multi-Agent Path Planning on Grid Maps.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events.

[BibT_eX]

[DOI]

André A. Ciré

Proceedings of the IJCAI 2009, 2009

Scalable, Parallel Best-First Search for Optimal Sequential Planning.

[BibT_eX]

[DOI]

Alex S. Fukunaga

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

Improving Planning Performance Using Low-Conflict Relaxed Plans.

[BibT_eX]

[DOI]

Jorge A. Baier

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008

Learning in Planning with Temporally Extended Goals and Uncontrollable Events.

[BibT_eX]

[DOI]

André A. Ciré

Proceedings of the ECAI 2008, 2008

Crossword Puzzles as a Constraint Problem.

[BibT_eX]

[DOI]

Anbulagan

Proceedings of the Principles and Practice of Constraint Programming, 2008

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

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE Symposium on Computational Intelligence and Games, 2008

Fast and Memory-Efficient Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

Offline Planning with Hierarchical Task Networks in Video Games.

[BibT_eX]

[DOI]

John Paul Kelly

Sven Koenig

Proceedings of the Fourth Artificial Intelligence and Interactive Digital Entertainment Conference, 2008

2007

Fast Planning with Iterative Macros.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2005

Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2005

Learning Partial-Order Macros from Solutions.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005

2004

Near Optimal Hierarchical Path-Finding.

[BibT_eX]

J. Game Dev., 2004

Using Component Abstraction for Automatic Generation of Macro-Actions.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

2002

Using Abstraction for Heuristic Search and Planning.

[BibT_eX]

[DOI]

Proceedings of the Abstraction, 2002

Using Abstraction for Planning in Sokoban.

[BibT_eX]

[DOI]