public interface

ADStarNode

implements HeuristicNode<A, S, C extends Comparable<C>, N extends HeuristicNode<A, S, C, N>>
es.usc.citius.hipster.model.ADStarNode<A, S, C extends java.lang.Comparable<C>, N extends es.usc.citius.hipster.model.ADStarNode<A, S, C, N>>
Known Indirect Subclasses

Class Overview

Implementation of Node to be used with the AD* algorithm, implemented in ADStarForward. AD* nodes are formed by two cost elements, G and V, and a ADStarNode.Key which is used to order the nodes by priority in the queues of the algorithm. This implementation extends HeuristicNode.

Summary

Nested Classes
class ADStarNode.Key<C extends Comparable<C>> Inner class defining the key of the node, which depends on the values of G and V. 
Public Methods
abstract C getG()
abstract C getV()
abstract boolean isConsistent()
abstract boolean isDoUpdate()
abstract void setAction(A action)
abstract void setDoUpdate(boolean update)
abstract void setG(C g)
abstract void setKey(Key<C> key)
abstract void setPreviousNode(N parent)
abstract void setState(S state)
abstract void setV(C v)
[Expand]
Inherited Methods
From interface es.usc.citius.hipster.model.CostNode
From interface es.usc.citius.hipster.model.HeuristicNode
From interface es.usc.citius.hipster.model.Node
From interface java.lang.Comparable

Public Methods

public abstract C getG ()

Returns
  • G-cost of the node

public abstract C getV ()

Returns
  • V-cost (also RHS) of the node

public abstract boolean isConsistent ()

Returns
  • determines if the node is in a consistent or inconsistent state based on the values of G and V

public abstract boolean isDoUpdate ()

Returns

public abstract void setAction (A action)

Parameters
action action between the parent and this node

public abstract void setDoUpdate (boolean update)

Parameters
update set a new value for the update flag of this node

public abstract void setG (C g)

Parameters
g new value of G

public abstract void setKey (Key<C> key)

Parameters
key new key to compare the priority of the nodes

public abstract void setPreviousNode (N parent)

Parameters
parent new parent of the node

public abstract void setState (S state)

Parameters
state state of this node

public abstract void setV (C v)

Parameters
v new value of V