planner.graphPlan

Class Planner

java.lang.Object

planner.graphPlan.Planner

Direct Known Subclasses:

GraphPlanSearchPlanner

public class Planner
extends Object

Uses the GraphPlan algorithm to generate a plan for the attainment of goals. The problem definition consists of a tuple (S, A,S0, G) where S is the set of potential world state conditions, A is the set of actions that are available (including preconditions and postconditions), S0 is the set of world state conditions that are true at time 0, and G is the set of world state conditions that must be true to achieve the goal. Elements of S that are not in S0 are assumed to be false at time 0 Elements of S that are not in G or whose negations are not in G are assumed to be irrelevant to the goal state (i.e. the goal can be achieved whether these values are true or false).

Version:

$Id: Planner.java 9109 2015-07-29 22:39:46Z brutzman $

Author:

dtdavis

Constructor Summary

Constructors

Constructor and Description
Planner() Creates a new instance of the Planner

Method Summary

Modifier and Type	Method and Description
List<Plan>	generatePlans() Generates a set of plans (sequence of actions) that will achieve the goal state WARNING: If no solution is possible, this method will not terminate!
void	initialize(Literal[] S, Action[] A, Literal[] S0, Literal[] G) Initializes the Planner object
static void	main(String[] args) For testing only

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Planner

public Planner()

Creates a new instance of the Planner

Method Detail

initialize

public void initialize(Literal[] S,
                       Action[] A,
                       Literal[] S0,
                       Literal[] G)

Initializes the Planner object

Parameters:

S - the set of available world state values

A - the set of available actions

S0 - the set of world state that are true at time 0

G - the set of world state variables that must be true to achieve the goal

generatePlans

public List<Plan> generatePlans()

Generates a set of plans (sequence of actions) that will achieve the goal state WARNING: If no solution is possible, this method will not terminate!

Returns:

ArrayList containing all plans that will achieve the goals with the minimum number of steps

main

public static void main(String[] args)

For testing only

Parameters:

args -