Trait rusty_planner::planner::ProblemSpace

pub trait ProblemSpace {
    type State: Copy + Eq + Hash;
    type Iter: Iterator<Item = (Self::State, f64)>;

    // Required methods
    fn heuristic(&self, _: &Self::State, _: &Self::State) -> f64;
    fn succ(&self, _: &Self::State) -> Self::Iter;
    fn pred(&self, _: &Self::State) -> Self::Iter;
}

Public trait which - once implemented - describes the problem space to solve.

Required Associated Types

type State: Copy + Eq + Hash

Defines the type of your state.

type Iter: Iterator<Item = (Self::State, f64)>

Iterator for containing states and cost/utility to transition to it.

Required Methods

fn heuristic(&self, _: &Self::State, _: &Self::State) -> f64

Heuristic function to calculate the “distance” between two states.

fn succ(&self, _: &Self::State) -> Self::Iter

Given a state calculates the successor states.

fn pred(&self, _: &Self::State) -> Self::Iter

Given a state calculates the predecessor states.

Implementors