Francesco Percassi

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

2023

Improving Domain-Independent Heuristic State-Space Planning via plan cost predictions.

[BibT_eX]

[DOI]

Ivan Serina

J. Exp. Theor. Artif. Intell., August, 2023

Width-based search for multi agent privacy-preserving planning.

[BibT_eX]

[DOI]

Artif. Intell., May, 2023

A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

On the Notion of Fixability of PDDL+ Plans [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

An Efficient Heuristic for AI-based Urban Traffic Control.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Models and Technologies for Intelligent Transportation Systems, 2023

Automated Planning for Generating and Simulating Traffic Signal Strategies.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Fixing Plans for PDDL+ Problems: Theoretical and Practical Implications.

[BibT_eX]

[DOI]

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

Goal Recognition as a Deep Learning Task: The GRNet Approach.

[BibT_eX]

[DOI]

Mattia Chiari

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

A Structure-Sensitive Translation from Hybrid to Numeric Planning.

[BibT_eX]

[DOI]

Proceedings of the AIxIA 2023 - Advances in Artificial Intelligence, 2023

2022

Goal Recognition as a Deep Learning Task: the GRNet Approach.

[BibT_eX]

[DOI]

Mattia Chiari

Luca Putelli

Ivan Serina

CoRR, 2022

On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

On the Use of Width-Based Search for Multi Agent Privacy-Preserving Planning (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

The Power of Reformulation: From Validation to Planning in PDDL+.

[BibT_eX]

[DOI]

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

2021

Translations from Discretised PDDL+ to Numeric Planning.

[BibT_eX]

[DOI]

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

On Planning with Qualitative State-Trajectory Constraints in PDDL3 by Compiling them Away.

[BibT_eX]

[DOI]

Luigi Bonassi

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

A Sound (But Incomplete) Polynomial Translation from Discretised PDDL+ to Numeric Planning.

[BibT_eX]

[DOI]

Proceedings of the AIxIA 2021 - Advances in Artificial Intelligence, 2021

2020

Generating and Exploiting Cost Predictions in Heuristic State-Space Planning.

[BibT_eX]

[DOI]

Ivan Serina

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

2019

Novelty Messages Filtering for Multi Agent Privacy-preserving Planning.

[BibT_eX]

[DOI]

CoRR, 2019

Novelty Messages Filtering for Multi Agent Privacy-Preserving Plannin.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

On Compiling Away PDDL3 Soft Trajectory Constraints without Using Automata.

[BibT_eX]

[DOI]

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

Best-First Width Search for Multi Agent Privacy-Preserving Planning.

[BibT_eX]

[DOI]

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

2018

Iterative Width Search for Multi Agent Privacy-Preserving Planning.

[BibT_eX]

[DOI]

Gabriele Bazzotti

Proceedings of the AI*IA 2018 - Advances in Artificial Intelligence, 2018

2017

Improving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA.

[BibT_eX]

[DOI]