Expand description
§Planning
Allows the planning of minimal sequences of actions to achieve given goal states.
The main access point is the Agent
type, which allows dynamic and extensible planning with
multiple goals and actions, and complex dynamic interactions between them.
§Example
use std::hash::Hash;
#[derive(Clone, Debug, PartialEq, Eq, Hash)]
struct State {
num_flowers: u16,
hungry: bool,
picnic_set: bool,
}
#[derive(Clone, Debug, PartialEq, Eq, Hash)]
enum MyAction {
PickFlower,
SetPicnic,
Eat,
}
impl Action<State> for MyAction {
fn is_applicable(&self, state: &State) -> bool {
match self {
MyAction::PickFlower => state.num_flowers < 5,
MyAction::SetPicnic => !state.picnic_set,
MyAction::Eat => state.hungry && state.picnic_set,
}
}
fn apply_mut(&self, state: &mut State) {
match self {
MyAction::PickFlower => state.num_flowers += 1,
MyAction::SetPicnic => state.picnic_set = true,
MyAction::Eat => state.hungry = false,
}
}
}
#[derive(Clone, Debug, PartialEq, Eq, Hash)]
enum MyGoal {
BouquetMade,
Eaten,
}
impl Goal<State> for MyGoal {
fn is_satisfied(&self, state: &State) -> bool {
match self {
MyGoal::BouquetMade => state.num_flowers >= 5,
MyGoal::Eaten => !state.hungry,
}
}
fn priority(&self, state: &State) -> i32 {
match self {
MyGoal::BouquetMade => 1,
MyGoal::Eaten => if state.hungry { 2 } else { 0 },
}
}
}
let mut agent = Agent::new(
State { num_flowers: 0, hungry: true, picnic_set: false },
vec![MyAction::PickFlower, MyAction::SetPicnic, MyAction::Eat],
vec![MyGoal::BouquetMade, MyGoal::Eaten],
);
let (goal, plan, _) = agent.plan_dynamic().unwrap();
assert_eq!(goal, &MyGoal::Eaten);
assert_eq!(plan, vec![MyAction::SetPicnic, MyAction::Eat]);
agent.state.hungry = false;
let (goal, plan, _) = agent.plan_dynamic().unwrap();
assert_eq!(goal, &MyGoal::BouquetMade);
assert_eq!(plan, vec![MyAction::PickFlower; 5]);
Structs§
- Agent
- A stateful agent capable of choosing from multiple goals based on priority.
Traits§
- Action
- Defines a state transition with pre-conditions and an optional cost.
- Goal
- Defines a goal that can be satisfied by a state.
Functions§
- plan
- Returns a sequence of actions to reach the goal while minimizing cost, if possible.