David Speck

Orcid: 0000-0002-5493-7363

Affiliations:
  • Linköping University, Sweden
  • University of Freiburg, Gremany (former)


According to our database1, David Speck authored at least 24 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Versatile Cost Partitioning with Exact Sensitivity Analysis.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

2023
Sensitivity Analysis for Saturated Post-Hoc Optimization in Classical Planning.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

PARIS: Planning Algorithms for Reconfiguring Independent Sets.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

On Partial Satisfaction Planning with Total-Order HTNs.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Finding Matrix Multiplication Algorithms with Classical Planning.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
Symbolic search for optimal planning with expressive extensions
PhD thesis, 2022

Symbolic Search for Optimal Planning with Expressive Extensions.
CoRR, 2022

On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAE.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Loopless Top-K Planning.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

New Refinement Strategies for Cartesian Abstractions.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
Subset-Saturated Transition Cost Partitioning.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

On the Compilability and Expressive Power of State-Dependent Action Costs.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Learning Heuristic Selection with Dynamic Algorithm Configuration.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Symbolic Search for Optimal Total-Order HTN Planning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Symbolic Search for Oversubscription Planning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic Search.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Symbolic Top-k Planning.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
An Empirical Study of the Usefulness of State-Dependent Action Costs in Planning.
Proceedings of the KI 2019: Advances in Artificial Intelligence, 2019

Symbolic Planning with Axioms.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017
Shakey 2016 - How Much Does it Take to Redo Shakey the Robot?
IEEE Robotics Autom. Lett., 2017

2015
Necessary Observations in Nondeterministic Planning.
Proceedings of the KI 2015: Advances in Artificial Intelligence, 2015


  Loading...