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

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

/// The h^0 (zero) heuristic — always returns 0.
///
/// This reduces A* to uniform-cost search (Dijkstra's algorithm).
/// Admissible but provides no guidance.
///
/// # Examples
///
/// ```
/// use miniplan::heuristic::HZero;
/// use miniplan::search::Heuristic;
///
/// assert_eq!(HZero.name(), "zero");
/// ```
pub struct HZero;

impl Heuristic for HZero {
    fn name(&self) -> &str {
        "zero"
    }

    fn estimate(&self, _task: &Task, _state: &State) -> HValue {
        HValue(0.0)
    }
}