Search

Search Results

• PlanVerb: Domain-Independent Verbalization and Summary of Task Plans

  Gerard Canal, Senka Krivić, Paul Luff, Andrew Coles

  9698-9706

  2022-06-28

• Competing for Resources: Estimating Adversary Strategy for Effective Plan Generation

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

  9707-9715

  2022-06-28

• The FF Heuristic for Lifted Classical Planning

  Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès

  9716-9723

  2022-06-28

• Inconsistent Planning: When in Doubt, Toss a Coin!

  Yuriy Dementiev, Fedor Fomin, Artur Ignatiev

  9724-9731

  2022-06-28

• Robustification of Online Graph Exploration Methods

  Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter

  9732-9740

  2022-06-28

• Explainable Planner Selection for Classical Planning

  Patrick Ferber, Jendrik Seipp

  9741-9749

  2022-06-28

• Operator-Potential Heuristics for Symbolic Search

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

  9750-9757

  2022-06-28

• Reconfiguring Shortest Paths in Graphs

  Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri

  9758-9766

  2022-06-28

• Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics

  Rostislav Horčík, Daniel Fišer, Álvaro Torralba

  9767-9775

  2022-06-28

• Speeding Up the RUL¯ Dynamic-Controllability-Checking Algorithm for Simple Temporal Networks with Uncertainty

  Luke Hunsberger, Roberto Posenato

  9776-9785

  2022-06-28

• Learning to Solve Routing Problems via Distributionally Robust Optimization

  Yuan Jiang, Yaoxin Wu, Zhiguang Cao, Jie Zhang

  9786-9794

  2022-06-28

• Learning Probably Approximately Complete and Safe Action Models for Stochastic Worlds

  Brendan Juba, Roni Stern

  9795-9804

  2022-06-28

• Bounding Quality in Diverse Planning

  Michael Katz, Shirin Sohrabi, Octavian Udrea

  9805-9812

  2022-06-28

• A* Search and Bound-Sensitive Heuristics for Oversubscription Planning

  Michael Katz, Emil Keyder

  9813-9820

  2022-06-28

• NICE: Robust Scheduling through Reinforcement Learning-Guided Integer Programming

  Luke Kenworthy, Siddharth Nayak, Christopher Chin, Hamsa Balakrishnan

  9821-9829

  2022-06-28

• Planning to Avoid Side Effects

  Toryn Q. Klassen, Sheila A. McIlraith, Christian Muise, Jarvis Xu

  9830-9839

  2022-06-28

• Sample-Efficient Iterative Lower Bound Optimization of Deep Reactive Policies for Planning in Continuous MDPs

  Siow Meng Low, Akshat Kumar, Scott Sanner

  9840-9848

  2022-06-28

• Bridging LTLf Inference to GNN Inference for Learning LTLf Formulae

  Weilin Luo, Pingjia Liang, Jianfeng Du, Hai Wan, Bo Peng, Delong Zhang

  9849-9857

  2022-06-28

• Risk-Aware Stochastic Shortest Path

  Tobias Meggendorfer

  9858-9867

  2022-06-28

• Differential Assessment of Black-Box AI Agents

  Rashmeet Kaur Nayyar, Pulkit Verma, Siddharth Srivastava

  9868-9876

  2022-06-28

• Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability Using Tree Search and Graph Neural Networks

  Kevin Osanlou, Jeremy Frank, Andrei Bursuc, Tristan Cazenave, Eric Jacopin, Christophe Guettier, J. Benton

  9877-9885

  2022-06-28

• Deciding Unsolvability in Temporal Planning under Action Non-Self-Overlapping

  Stefan Panjkovic, Andrea Micheli, Alessandro Cimatti

  9886-9893

  2022-06-28

• A Distributional Framework for Risk-Sensitive End-to-End Planning in Continuous MDPs

  Noah Patton, Jihwan Jeong, Mike Gimelfarb, Scott Sanner

  9894-9901

  2022-06-28

• Formula Synthesis in Propositional Dynamic Logic with Shuffle

  Sophie Pinchinat, Sasha Rubin, François Schwarzentruber

  9902-9909

  2022-06-28

• Efficient Encoding of Cost Optimal Delete-Free Planning as SAT

  Masood Feyzbakhsh Rankooh, Jussi Rintanen

  9910-9917

  2022-06-28