Documentation ¶
Index ¶
- Constants
- func ConditionSatisfied(c task.Condition, s state.State) bool
- func DistributedFFHeuristic(t *task.Task, s comm.Server, d comm.Dispatcher) *distributedFFHeuristic
- func Initialize(name string, t *task.Task)
- func Register(info *EvaluatorInfo)
- func RelaxationHeuristic(t *task.Task, costtype task.CostType) *relaxationHeuristic
- func SumOfInts(t []int, gs ...int) int
- type BlindHeuristic
- type EvaluatorInfo
- type StateEvaluator
- func AdditiveBFHeuristic(t *task.Task) StateEvaluator
- func AdditiveHeuristic(t *task.Task) StateEvaluator
- func FFHeuristic(t *task.Task) StateEvaluator
- func GCHeuristic(t *task.Task) StateEvaluator
- func Get(name string, agentID int) (StateEvaluator, error)
- func NewBlindHeuristic(t *task.Task) StateEvaluator
Constants ¶
View Source
const ( MaxCost = 100000000 DeadEnd = -1 )
Variables ¶
This section is empty.
Functions ¶
func DistributedFFHeuristic ¶
TODO: doc
func Initialize ¶
func Register ¶
func Register(info *EvaluatorInfo)
func RelaxationHeuristic ¶
Types ¶
type BlindHeuristic ¶
type BlindHeuristic struct {
// contains filtered or unexported fields
}
blindHeuristic returns 1 for all non-goal states and 0 for goal-states
type EvaluatorInfo ¶
type EvaluatorInfo struct { Name string Description string NewEvaluator func(task *task.Task) StateEvaluator }
func Find ¶
func Find(name string) (*EvaluatorInfo, error)
type StateEvaluator ¶
func AdditiveBFHeuristic ¶
func AdditiveBFHeuristic(t *task.Task) StateEvaluator
additive heuristic (hAdd) with bellman ford computation
func AdditiveHeuristic ¶
func AdditiveHeuristic(t *task.Task) StateEvaluator
func FFHeuristic ¶
func FFHeuristic(t *task.Task) StateEvaluator
func GCHeuristic ¶
func GCHeuristic(t *task.Task) StateEvaluator
func NewBlindHeuristic ¶
func NewBlindHeuristic(t *task.Task) StateEvaluator
Click to show internal directories.
Click to hide internal directories.