Package edu.uky.cs.nil.sabre.hg

package edu.uky.cs.nil.sabre.hg

Data structures similar to plan graphs that can be used to explore the structure of and estimate important properties of a problem.

Related Packages

Package	Description
edu.uky.cs.nil.sabre	Fundamental elements for defining planning problems and plans.

Class	Description
ActionNode	An event node that represents an action.
ArithmeticNode	A cost set node representing an arithmetic expression, which has an arithmetic operator and two numeric expressions on the left and right sides.
ArrayRange	An implementation of a range that uses an array to store its values and their costs.
ClauseNode	A node which represents a conjunctive clause, a conjunction of atomic preconditions that must all have a finite cost before the clause can have a finite cost.
ConstantNode	A cost set node representing a single value, where that value always costs 0 and all other values always cost positive infinity.
CostNode	A heuristic graph node that represents a Boolean proposition and the cost of that proposition being true.
CostSet	A cost set is a collection of values where each is associated with a numeric cost.
CostSet.Entry	An individual value/cost pair in a cost set.
DisjunctionNode	A node which represents a logical expression in disjunctive normal form, a disjunction of conjunctive clauses where at least one clause must have a finite cost before the disjunction can have a finite cost.
EffectNode	A node which represents an atomic effect of an event.
EventNode	A node which represents an event, which has a precondition that must have a finite cost before it can occur and effects which may cause other nodes to take on finite values.
FluentNode	A cost set node representing a fluent, a feature of a state that can have one of several values.
FormulaNode	An cost set node whose logical formula appears as a smaller part of some larger formula and which needs to notify the node representing that larger formula when its gains new values.
GoalNode	A goal node represents one branch of a conditional utility node expression.
HeuristicGraph	A heuristic graph is a data structure that represents the relationships between propositions and events in a ground problem to enable various kinds of analysis.
InfiniteSpan	A span of numeric values (and their associated costs) which automatically expands to include the value positive infinity any time its upper bound increases and automatically expands to include the value negative infinity any time its lower bound decreases.
List<T>	A list for holding elements of a HeuristicGraph heuristic graph.
MaxGraph	A max graph is a heuristic graph where the cost of a conjunction is defined to be the maximum cost of and of its conjuncts.
Node	The parent class of all heuristic graph nodes.
NominalFluentNode	A fluent node representing a non-numeric fluent, which is any fluent that has a discrete, finite set of possible values.
NumericFluentNode	A fluent node representing a numeric fluent, which is any fluent that has a potentially infinite range of number values.
PreconditionNode	A node which represents an atomic precondition, which is a comparison between a fluent on the left and a value on the right.
Range	A range is a cost set that defines protected methods for setting the cost of a value and resetting the range to its original state.
Span	An implementation of range that supports numeric values.
SumGraph	A sum graph is a heuristic graph where the cost of a conjunction is defined to be the sum of the cost of its conjuncts.
TriggerNode	An event node representing a trigger.
UtilityNode	A cost set node that represents a utility expression.