Search

Search Results

• Crossword Puzzle Resolution via Monte Carlo Tree Search

  Lihan Chen, Jingping Liu, Sihang Jiang, Chao Wang, Jiaqing Liang, Yanghua Xiao, Sheng Zhang, Rui Song

  35-43

  2022-06-13

• Detecting Unsolvability Based on Separating Functions

  Remo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert

  44-52

  2022-06-13

• Task-Guided Inverse Reinforcement Learning under Partial Information

  Franck Djeumou, Murat Cubuktepe, Craig Lennon, Ufuk Topcu

  53-61

  2022-06-13

• Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width

  Dominik Drexler, Jendrik Seipp, Hector Geffner

  62-70

  2022-06-13

• Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming

  Masood Feyzbakhsh Rankooh, Jussi Rintanen

  71-79

  2022-06-13

• Operator-Potentials in Symbolic Search: From Forward to Bi-directional Search

  Daniel Fišer, Álvaro Torralba, Jörg Hoffmann

  80-89

  2022-06-13

• Iterative Depth-First Search for FOND Planning

  Ramon Fraga Pereira, André Grahl Pereira, Frederico Messa, Giuseppe De Giacomo

  90-99

  2022-06-13

• Admissible Heuristics for Multi-Objective Planning

  Florian Geißer, Patrik Haslum, Sylvie Thiébaux, Felipe Trevizan

  100-109

  2022-06-13

• Beyond Stars – Generalized Topologies for Decoupled Search

  Daniel Gnad, Álvaro Torralba, Daniel Fišer

  110-118

  2022-06-13

• Assignment and Prioritization of Tasks with Uncertain Durations for Satisfying Makespans in Decentralized Execution

  Sriram Gopalakrishnan, Daniel Borrajo

  119-123

  2022-06-13

• On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond

  Malte Helmert, Silvan Sievers, Alexander Rovner, Augusto B. Corrêa

  124-133

  2022-06-13

• Encoding Lifted Classical Planning in Propositional Logic

  Daniel Höller, Gregor Behnke

  134-144

  2022-06-13

• Compiling HTN Plan Verification Problems into HTN Planning Problems

  Daniel Höller, Julia Wichlacz, Pascal Bercher, Gregor Behnke

  145-150

  2022-06-13

• An Exact Algorithm for the Linear Tape Scheduling Problem

  Valentin Honoré, Bertrand Simon, Frédéric Suter

  151-159

  2022-06-13

• Optimal Mixed Strategies for Cost-Adversarial Planning Games

  Rostislav Horčík, Álvaro Torralba, Pavel Rytíř, Lukáš Chrpa, Stefan Edelkamp

  160-168

  2022-06-13

• Multi-Agent Path Finding with Temporal Jump Point Search

  Shuli Hu, Daniel D. Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant

  169-173

  2022-06-13

• A Compilation Based Approach to Finding Centroids and Minimum Covering States in Planning

  Erez Karpas

  174-178

  2022-06-13

• Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria

  Michael Katz, Shirin Sohrabi

  179-183

  2022-06-13

• Pattern Selection Strategies for Pattern Databases in Probabilistic Planning

  Thorsten Klößner, Marcel Steinmetz, Álvaro Torralba, Jörg Hoffmann

  184-192

  2022-06-13

• Cost Partitioning Heuristics for Stochastic Shortest Path Problems

  Thorsten Klößner, Florian Pommerening, Thomas Keller, Gabriele Röger

  193-202

  2022-06-13

• LM-Cut Heuristics for Optimal Linear Numeric Planning

  Ryo Kuroiwa, Alexander Shleyfman, J. Christopher Beck

  203-212

  2022-06-13

• Biased Exploration for Satisficing Heuristic Search

  Ryo Kuroiwa, J. Christopher Beck

  213-221

  2022-06-13

• Beam Search: Faster and Monotonic

  Sofia Lemons, Carlos Linares López, Robert C. Holte, Wheeler Ruml

  222-230

  2022-06-13

• On the Expressive Power of Planning Formalisms in Conjunction with LTL

  Songtuan Lin, Pascal Bercher

  231-240

  2022-06-13

• Generalized Linear Integer Numeric Planning

  Xiaoyou Lin, Qingliang Chen, Liangda Fang, Quanlong Guan, Weiqi Luo, Kaile Su

  241-251

  2022-06-13