seeker 0.1.0

A PDDL planner
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90

use anyhow::Result;
use clap::Parser;
use seeker::search::SearchKind;
use seeker::search::{self, solve};
use std::{
    fs,
    path::PathBuf,
    time::{Duration, Instant},
};

#[derive(Parser, Debug)]
struct Args {
    /// Time limit in human time.
    /// Supported units: ns, us, ms, sec, min, hours, days, weeks, months, years (and few variations)
    #[arg(short, long)]
    #[clap(value_parser = humantime::parse_duration)]
    time_limit: Option<Duration>,
    /// Memory limit in MB
    #[arg(short, long)]
    memory_limit: Option<usize>,
    /// Avoids printing plan to stdout
    #[arg(short, long)]
    quiet: bool,
    /// Path to which the plan file will be written
    #[arg(short, long)]
    out: Option<PathBuf>,
    /// Path to domain file
    domain: PathBuf,
    /// Path to problem file
    problem: PathBuf,
    #[command(subcommand)]
    search: Option<SearchKind>,
}

fn main() -> Result<()> {
    let t_begin = Instant::now();
    let args = Args::parse();
    let t_preprocessing = Instant::now();
    println!("Reading files...");
    let t = Instant::now();
    println!("Reading domain...");
    let domain = fs::read_to_string(&args.domain)?;
    println!("Reading problem...");
    let problem = fs::read_to_string(&args.problem)?;
    println!("Read time: {}s", t.elapsed().as_secs_f64());
    println!("Parsing files...");
    let t = Instant::now();
    let domain = pddlp::domain::parse(&domain).unwrap();
    let problem = pddlp::problem::parse(&problem).unwrap();
    println!("Parse time: {}s", t.elapsed().as_secs_f64());
    println!("Translating task...");
    let t = Instant::now();
    let task = pddllib::translation::translate_parsed(&domain, &problem)?;
    println!("Translation time: {}s", t.elapsed().as_secs_f64());
    println!(
        "Preprocessing time: {}s",
        t_preprocessing.elapsed().as_secs_f64()
    );
    println!("Types: {}", task.types.len());
    println!("Predicates: {}", task.predicates.len());
    println!("Actions: {}", task.actions.len());
    println!("Objects: {}", task.objects.len());
    println!("Static facts: {}", task.static_facts.len());
    println!("Initial state facts: {}", task.init.fact_count());
    if args.search.is_none() {
        println!("No search algorithm specified, exiting");
        return Ok(());
    }
    println!("Generating searcher...");
    let mut searcher = search::generate(&task, args.search.as_ref().unwrap());
    println!("Beginning search...");
    let t = Instant::now();
    let _result = solve(&task, args.time_limit, args.memory_limit, &mut searcher);
    let result = _result?;
    let plan = task.trace_path(&result);
    if let Some(out_path) = args.out {
        fs::write(out_path, task.export_plan(&plan))?;
    }
    if !args.quiet {
        print!("{}", task.export_plan(&plan));
    }
    println!(
        "Search time: {}s ({:.2}%)",
        t.elapsed().as_secs_f64(),
        t.elapsed().as_secs_f64() / t_begin.elapsed().as_secs_f64() * 100.0
    );
    println!("Total time: {}s", t_begin.elapsed().as_secs_f64());
    println!("Plan length: {}", plan.len());
    Ok(())
}