Folgen
Daniel Höller
Daniel Höller
Saarland University, Saarland Informatics Campus
Bestätigte E-Mail-Adresse bei cs.uni-saarland.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A Survey on Hierarchical Planning – One Abstract Idea, Many Concrete Realizations
P Bercher, R Alford, D Höller
28th International Joint Conference on Artificial Intelligence (IJCAI 2019 …, 2019
1032019
HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems
D Höller, G Behnke, P Bercher, S Biundo, H Fiorino, D Pellier, R Alford
34th AAAI Conference on Artificial Intelligence (AAAI 2020), 2020
832020
Language Classification of Hierarchical Planning Problems
D Höller, G Behnke, P Bercher, S Biundo
21st European Conference on Artificial Intelligence (ECAI 2014), 447-452, 2014
742014
Companion-Technology: An Overview
S Biundo, D Höller, B Schattenberg, P Bercher
KI-Künstliche Intelligenz 30 (1), 11-20, 2016
64*2016
A Generic Method to Guide HTN Progression Search With Classical Heuristics
D Höller, P Bercher, G Behnke, S Biundo
28th International Conference on Automated Planning and Scheduling (ICAPS …, 2018
572018
An Admissible HTN Planning Heuristic
P Bercher, G Behnke, D Höller, S Biundo
26th International Joint Conference on Artificial Intelligence (IJCAI 2017 …, 2017
552017
On the Complexity of HTN Plan Verification and Its Implications for Plan Recognition
G Behnke, D Höller, S Biundo
25th International Conference on Automated Planning and Scheduling (ICAPS …, 2015
542015
totSAT – Totally-Ordered Hierarchical Planning Through SAT
G Behnke, D Höller, S Biundo
32nd AAAI Conference on Artificial Intelligence (AAAI 2018), 6110-6118, 2018
522018
Plan and Goal Recognition as HTN planning
D Höller, G Behnke, P Bercher, S Biundo
30th International Conference on Tools with Artificial Intelligence (ICTAI …, 2018
512018
Assessing the Expressivity of Planning Formalisms through the Comparison to Formal Languages
D Höller, G Behnke, P Bercher, S Biundo
26th International Conference on Automated Planning and Scheduling (ICAPS …, 2016
492016
Bound to Plan: Exploiting Classical Heuristics via Automatic Translations of Tail-Recursive HTN Problems
R Alford, G Behnke, D Höller, P Bercher, S Biundo, D Aha
26th International Conference on Automated Planning and Scheduling (ICAPS …, 2016
472016
More than a Name? On Implications of Preconditions and Effects of Compound HTN Planning Tasks
P Bercher, D Höller, G Behnke, S Biundo
22nd European Conference on Artificial Intelligence (ECAI 2016), 225-233, 2016
442016
Bringing Order to Chaos – A Compact Representation of Partial Order in SAT-based HTN Planning
G Behnke, D Höller, S Biundo
33rd AAAI Conference on Artificial Intelligence (AAAI 2019), 7520-7529, 2019
402019
HTN Planning as Heuristic Progression Search
D Höller, P Bercher, G Behnke, S Biundo
Journal of Artificial Intelligence Research 67, 835-880, 2020
372020
This is a solution!(... but is it though?) – Verifying Solutions of Hierarchical Planning Problems
G Behnke, D Höller, S Biundo
27th International Conference on Automated Planning and Scheduling (ICAPS …, 2017
362017
Finding Optimal Solutions in HTN Planning – A SAT-based Approach
G Behnke, D Höller, S Biundo
28th International Joint Conference on Artificial Intelligence (IJCAI 2019 …, 2019
352019
On Succinct Groundings of HTN Planning Problems
G Behnke, D Höller, A Schmid, P Bercher, S Biundo
34th AAAI Conference on Artificial Intelligence (AAAI 2020), 9775-9784, 2020
342020
On Guiding Search in HTN Planning with Classical Planning Heuristics
D Höller, P Bercher, G Behnke, S Biundo
28th International Joint Conference on Artificial Intelligence (IJCAI 2019 …, 2019
272019
Change the Plan – How Hard Can That Be?
G Behnke, D Höller, P Bercher, S Biundo
26th International Conference on Automated Planning and Scheduling (ICAPS …, 2016
272016
A Planning-Based Assistance System for Setting Up a Home Theater
P Bercher, F Richter, T Hörnle, T Geier, D Höller, G Behnke, F Nothdurft, ...
29th AAAI Conference on Artificial Intelligence (AAAI 2015), 4264-4265, 2015
272015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20