miniplan 0.1.1

A PDDL planner library built around the pddl crate, with grounding and search utilities
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

use crate::search::HValue;
use crate::search::Heuristic;
use crate::task::{State, Task};

/// A blind heuristic that returns 0 at the goal and 1 otherwise.
///
/// This is the simplest admissible heuristic, equivalent to
/// treating the search as uniform-cost with goal checking.
///
/// # Examples
///
/// ```
/// use miniplan::heuristic::BlindHeuristic;
/// use miniplan::search::Heuristic;
///
/// assert_eq!(BlindHeuristic.name(), "blind");
/// ```
pub struct BlindHeuristic;

impl Heuristic for BlindHeuristic {
    fn name(&self) -> &str {
        "blind"
    }

    fn estimate(&self, task: &Task, state: &State) -> HValue {
        if state.satisfies(&task.goal_pos, &task.goal_neg) {
            HValue(0.0)
        } else {
            HValue(1.0)
        }
    }
}