miniplan 0.2.0

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
33
34
35
36

//! Heuristic functions for estimating distance to goal.
//!
//! Heuristics are used by planners like A*, GBFS, NBS, and BAE* to guide
//! their search. Each heuristic implements the [`Heuristic`] trait.
//!
//! # Available heuristics
//!
//! - [`BlindHeuristic`] — returns 0 at goal, 1 otherwise.
//! - [`GoalCountHeuristic`] — counts unsatisfied goal facts.
//! - [`HAdd`] — additive heuristic (Bonet & Geffner, 2001).
//! - [`HMax`] — max heuristic (Bonet & Geffner, 2001).
//! - [`HFF`] — FF heuristic (Hoffmann & Nebel, 2001).
//! - [`HZero`] — always returns 0 (uninformed).
//!
//! # Examples
//!
//! ```
//! use miniplan::heuristic::HFF;
//! use miniplan::search::Heuristic;
//!
//! assert_eq!(HFF.name(), "hff");
//! ```

mod blind;
mod goal_count;
mod relaxed;
mod zero;

pub use blind::BlindHeuristic;
pub use goal_count::GoalCountHeuristic;
pub use relaxed::{HAdd, HFF, HMax};
pub use zero::HZero;

pub use crate::search::Heuristic;

pub(crate) use relaxed::{rpg_backward_fact_costs, rpg_fact_costs};