All Classes and Interfaces
Class
Description
A more convenient representation of command line argument based on keys and
values.
An object that allows an array to be treated as
Iterable.Iterates through all the elements in an array.
An atom is the smallest indivisible unit of a logical language that has a
truth value.
An individual statement that has a truth value (the atoms of propositional
logic).
A wrapper around a
StateSpaceHeuristic which uses the given
heuristic to estimate the distance from the problem's initial state to the
current goal of a backward search.Represents a node in a backward state space search graph, where a node is a
goal and a plan to achieve the problem goal if the node's goal can be
achieved.
A totally ordered plan which is built from end (last step) to beginning.
A planner which searches backward through space of states for the solution to
a given problem.
A special
BackwardNode that represents the root of the backward
search space and holds a pointer to the problem object and the search
budget.Represents a backward search through the space of states, starting at the
problem goal and ending in the initial state.
A set of assignments of values to
Term terms.The parent class of all Boolean expressions, whose truth value is defined by
combining other expressions.
A causal link describes how the effect of an earlier step (the tail)
satisfied the precondition of a later step (the head).
A conjunction, or logical AND statement, is true just when all of its
arguments are true.
A constant represents a specific unique thing.
A directed acyclic graph (or DAG) whose nodes are of a given type.
Represents a single directed egde in a
DirectedAcyclicGraph.A disjunction, or logical OR statement, is true just when one or more of its
arguments are true.
A planning domain is a reusable set of action templates called
Operators that describes all the ways the state of the world can
change.An implementation of
OutputStream that does nothing.An implementation of
Writer that does nothing.A flaw is something that prevents a partial plan from being a solution to
its problem.
A format exception is thrown when the input to a
Parser is improperly formatted.The parent class of all logical formulas.
A wrapper around a
StateSpaceHeuristic which uses the given
heuristic to estimate the distance from the current state in a
forward search to the problem's goal.Represents a node in a forward state space search graph, where a node is a
state and the plan taken to reach that state from the initial state.
A totally ordered plan which is built from beginning (first step) to end
last step).
A planner which searches forward through space of states for the solution to
a given problem.
A special
ForwardNode that represents the root of the forward search
space and holds a pointer to the problem object and the search budget.Represents a forward search through the space of states, starting at the
initial state and ending in any state where the goal is achieved.
An implementation of
MutableState that uses a
HashMap to keep track of which atoms are true.A substitution which uses a
HashMap to keep track of
substitutions.A heuristic is a function which estimates how much work remains to be done
to convert a partial solution to a problem into a complete solution.
An array whose values cannot be modified.
A list of objects which cannot be modified.
An implication, or logical IF statement, is defined by the truth value of
its two parts, the antecedent and the consequent.
Represents a specific level of a
PlanGraph, and contains only those
nodes which exist at this level.A list is a collection of 0 to many nodes.
An implementation of
Bindings based on a linked list.A literal is an
Atom or a negated atom.Represents a unique literal, or fact, in a plan graph.
Contains common parsing rules that apply to many kinds of logic.
The entry point for the planning application.
A min priority queue which, instead of using a
Comparator, allows
the user to specify a numeric key that should be associated with the item
being added to the queue.A state which can be modified.
Represents the negation (or opposite) of a proposition.
The abstract superclass of
LiteralNode and StepNode.Represents a plan graph node at a specific level.
An object parser provides a means of translating a node into an object of
a specific kind.
An open precondition flaw indicates that a partial plan has not yet
guaranteed that some precondition of some step will be satisfied.
Indicates that an algorithm has performed more than the maximum allowed
number of operations.
An operator is an action template that describes one way to change the world in terms
of its precondition (what must be true before the action can be taken) and effect
(what becomes true after the action is taken).
Converts text into various kinds of objects based on customizable rules.
This interface is implemented by any object which is affected by the
bindings of a least-commitment plan.
This class represents a step in a partial plan.
A plan is a sequence of step for achieving a goal.
plan graph is a data structure that compresses the state space of a
planning problem into something that represents possible future states.
A planner which searches a
PlanGraph for a subgraph that represents
a solution to a planning problem.Represents the two-phase search process of a
PlanGraphPlanner.A planner is an algorithm which solves a planning problem by finding a plan.
This class represents an specific partial plan in a plan-space search.
A subclass of
Planner which uses
plan-space search for find solutions.A special subclass of
PlanSpaceNode representing the root node of
the search space.A subclass of
Search which represents
plan-space search (i.e.A parser for predicate logic, which expects all
Atoms to be
Predications.The atoms of predicate logic, which are composed of statements that express
relationships between things in the world (i.e.
A planning problem exists in some
Domain and defines the initial
state of the world and a goal to be achieved.A proposition is any logical formula with a truth value.
A parser for propositional logic, which expects all
Atoms to be
AtomicPropositions.A result contains information about how and why a search succeeded or failed.
A search is the process of exploring some space while looking for solutions
to a problem.
Represents the limitations placed on an algorithm in terms of how many
operations it may perform and how long it make take to solve a problem.
Indicates that an algorithm has used more than the maximum allowed
resources.
Project settings
Settings for all projects.
A state fully describes the disposition of all things in a world.
A state space heuristic estimates the distance (as number of steps) between
a given state and a given goal proposition.
Represents a node in a state space search graph.
A planner which searches the space of states for the solution to a given
problem.
A subclass of
Problem that
propositionalizes all the StateSpaceProblem.steps that could possibly occur in a
plan.A special
StateSpaceNode that represents the root of the search
space and holds a pointer to the problem object and the search budget.Represents a search through the space of states.
A step is a single ground action in a plan which changes the world's state.
Represents a unique step, or action, in a plan graph.
Represents a specific subset of nodes in a plan graph.
This class represents the second phase of a
PlanGraphSearch, in
which we search for a subgraph of a plan graph that represents a solution
to the problem.This class represents a specific subgraph of a plan graph during the search
for a subgraph which represents a solution to the problem.
A special subclass of
SubgraphSpaceNode representing the root node
of the search space.A substitution defines that certain formulas should be replaced by other
formulas.
A symbol is a string of characters.
Logic for displaying simple 2-dimensional tables of data.
An individual unit of data in the table.
A vertical sequence of cells.
A horizontal sequence of cells.
The abstract parent of
Table.Row and Table.Column.A term is a reference to an individual thing in the world, and does not have
a truth value.
An threatened causal link flaw indicates that a partial plan contains a
causal link such that the effect of its tail step might be undone by some
other step in the plan (the threat) before it is used by the causal link's
tail step.
Indicates that an algorithm has taken more than the allowed amount of time.
A tuple is simply an array of
Objects implemented such that two
tuples are the same (i.e.A assortment of useful methods.
Assorted helpful methods.
A variable represents a placeholder for a
Term.