Álvaro Torralba

38 publications

7 venues

H Index 13


Saarland University, Saarland Informatics Campus, Saarbr cken, Germany
Charles III University of Madrid, Spain


Name Venue Year citations
Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning. IJCAI 2021 1
On the Optimal Efficiency of A* with Dominance Pruning. AAAI 2021 0
Faster Stackelberg Planning via Symbolic Search and Information Sharing. AAAI 2021 1
Pattern Databases for Goal-Probability Maximization in Probabilistic Planning. ICAPS 2021 1
Automatic Instance Generation for Classical Planning. ICAPS 2021 3
Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties. IJCAI 2020 8
Novel Is Not Always Better: On the Relation between Novelty and Dominance Pruning. AAAI 2020 1
Applying Monte-Carlo Tree Search in HTN Planning. SOCS 2020 1
Generating Instructions at Different Levels of Abstraction. COLING 2020 2
Learning How to Ground a Plan - Partial Grounding in Classical Planning. AAAI 2019 12
Symbolic Planning with Axioms. ICAPS 2019 3
Operator Mutexes and Symmetries for Simplifying Planning Tasks. AAAI 2019 7
Interleaving Search and Heuristic Improvement. SOCS 2019 3
Bridging the Gap between Abstractions and Critical-Path Heuristics via Hypergraphs. ICAPS 2019 1
Merge-and-Shrink Task Reformulation for Classical Planning. IJCAI 2019 1
Completeness-Preserving Dominance Techniques for Satisficing Planning. IJCAI 2018 2
Symbolic perimeter abstraction heuristics for cost-optimal planning. Artificial Intelligence 2018 7
Efficient symbolic search for cost-optimal planning. Artificial Intelligence 2017 38
Symbolic Leaf Representation in Decoupled Search. SOCS 2017 3
Symmetry Breaking in Star-Topology Decoupled Search. ICAPS 2017 13
On Creating Complementary Pattern Databases. IJCAI 2017 20
From Qualitative to Quantitative Dominance Pruning for Optimal Planning. IJCAI 2017 5
On State-Dominance Criteria in Fork-Decoupled Search. IJCAI 2016 9
Practical Undoability Checking via Contingent Planning. ICAPS 2016 11
Abstraction Heuristics for Symbolic Bidirectional Search. IJCAI 2016 32
From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation. COLING 2016 3
Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink. SOCS 2015 14
Simulation-Based Admissible Dominance Pruning. IJCAI 2015 21
A Reminder about the Importance of Computing and Exploiting Invariants in Planning. ICAPS 2015 61
BDDs Strike Back (in AI Planning). AAAI 2015 23
"Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability. ECAI 2014 54
Symbolic Merge-and-Shrink for Cost-Optimal Planning. IJCAI 2013 17
Transition Trees for Cost-Optimal Symbolic Planning. ICAPS 2013 16
Constrained Symbolic Search: On Mutexes, BDD Minimization and More. SOCS 2013 21
Precomputed-Direction Heuristics for Suboptimal Grid-Based Path-finding. SOCS 2012 1
Symbolic A ECAI 2012 0
Size-Independent Additive Pattern Databases for the Pancake Problem. SOCS 2011 3
Planning Multi-Modal Transportation Problems. ICAPS 2011 19
Copyright ©2019 Universität Würzburg

Impressum | Privacy | FAQ