Graphplan
id:
graphplan-161-18211825
title:
Graphplan
text:
Graphplan is an algorithm for automated planning developed by Avrim Blum and Merrick Furst in 1995. Graphplan takes as input a planning problem expressed in STRIPS and produces, if one is possible, a sequence of operations for reaching a goal state. The name graphplan is due to the use of a novel planning graph, to reduce the amount of search needed to find the solution from straightforward exploration of the state space graph. In the state space graph:
- the nodes are possible states,
- and
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for automated planning
original url:
https://en.wikipedia.org/wiki/Graphplan
date created:
2005-08-26T18:47:24Z
date modified:
2024-08-27T12:47:51Z
main entity:
{"identifier":"Q5597338","url":"https://www.wikidata.org/entity/Q5597338"}
image:
fields total:
13
integrity:
15