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

Matias Greco, Álvaro Torralba, Jorge A. Baier, Hector Palacios
7/10/2022
cs.AIcs.CLcs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{greco2022scaling,
  title  = {Scaling up ML-based Black-box Planning with Partial STRIPS Models},
  author = {Matias Greco and Álvaro Torralba and Jorge A. Baier and Hector Palacios},
  year   = {2022},
  eprint = {2207.04479},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.04479v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.04479.svg)](https://codeofpaper.com/paper/2207.04479)

Discussion