State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
type: Item
instance of: scholarly article
title: State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
zbMATH Open document ID: 1216.68239
author: Daniel Bryce
author: William Cushing
author: Subbarao Kambhampati
published in: Artificial Intelligence
publication date: 2011-06-17T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5909465
zbMATH Keywords: planning
zbMATH Keywords: heuristics
describes a project that uses: VHPOP
describes a project that uses: CUDD
describes a project that uses: Graphplan
describes a project that uses: STAN
MaRDI profile type: Publication
full work available at URL: j.artint.2010.12.002
OpenAlex ID: W2144961063
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Q3624010
cites work: Sequential Monte Carlo in reachability heuristics for probabilistic planning
cites work: Q4411139
cites work: Sequential Monte Carlo Methods in Practice
cites work: Q4449304
cites work: Conformant planning via heuristic forward search: A new approach
cites work: The FF planning system: Fast plan generation through heuristic search
cites work: Q4242054
cites work: Q4449294
cites work: Using regression-match graphs to control search in planning
cites work: Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
cites work: Q3856120
cites work: Q4533356
cites work: Q4449310
cites work: Q5715703
DOI: 10.1016/J.ARTINT.2010.12.002
description: scientific article; zbMATH DE number 5909465