mlsanityData to 7 Oct 2026

Scaling up ML-based Black-box Planning with Partial STRIPS Models

arXiv 2207.04479 ↗First posted 10 Jul 2022cs.AI cs.CL cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

A popular approach for sequential decision-making is to perform simulator-based search guided with Machine Learning (ML) methods like policy learning. On the other hand, model-relaxation heuristics can guide the search effectively if a full declarative model is available. In this work, we consider how a practitioner can improve ML-based black-box planning on settings where a complete symbolic model is not available. We show that specifying an incomplete STRIPS model that describes only part of the problem enables the use of relaxation heuristics. Our findings on several planning domains suggest that this is an effective way to improve ML-based black-box planning beyond collecting more data or tuning ML architectures.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 48 references that are in the map. First posted on arXiv 10 Jul 2022.

Builds on

10 of 48 references.

References · 10

  1. 2017Attention Is All You Needcited by 59,932
  2. 2017A Brief Survey of Deep Reinforcement Learningcited by 466
  3. 2017Safe Reinforcement Learning via Shieldingcited by 427
  4. 2021PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Modelscited by 402
  5. 2020Reward Machines: Exploiting Reward Function Structure in Reinforcement Learningcited by 183
  6. 2018Foundations for Restraining Bolts: Reinforcement Learning with LTLf/LDLf restraining specificationscited by 69
  7. 2019Learning Domain-Independent Planning Heuristics with Hypergraph Networkscited by 50
  8. 2020Generalized Planning With Deep Reinforcement Learningcited by 35
  9. 2020Learning Generalized Relational Heuristic Networks for Model-Agnostic Planningcited by 22
  10. 2021Exploiting Learned Policies in Focal Searchcited by 3

Built on by

Not cited yet.