Python _parse Exemples

Exemple #1

Fichier : test_parcprinter.py Projet : miken1990/ProjectA_Planning

import os

import py

from task import Task, Operator

import pyperplan as planner
from search import breadth_first_search, searchspace

benchmarks = os.path.abspath(
    os.path.join(os.path.abspath(__file__), '../../../benchmarks'))

# Collect problem files
problem_file = os.path.join(benchmarks, 'parcprinter', 'task01.pddl')
domain_file = planner.find_domain(problem_file)

problem = planner._parse(domain_file, problem_file)
task = planner._ground(problem)

# Manually do the "search"
node = searchspace.make_root_node(task.initial_state)
for step, op_name in enumerate(optimal_plan, start=1):
    for op, successor_state in task.get_successor_states(node.state):
        if not op.name.strip('()') == op_name:
            continue
        node = searchspace.make_child_node(node, op, successor_state)

# Check that we reached the goal
assert len(task.goals - node.state) == 0

Exemple #2

Fichier : test_all_problems.py Projet : KDercksen/SPML

def parse_problem(problem_file, domain_file=None):
    if domain_file is None:
        domain_file = planner.find_domain(problem_file)
    print("Parsing", problem_file)
    problem = planner._parse(domain_file, problem_file)
    return problem

Exemple #3

Fichier : test_all_problems.py Projet : miken1990/ProjectA_Planning

def parse_problem(problem_file, domain_file=None):
    if domain_file is None:
        domain_file = planner.find_domain(problem_file)
    print('Parsing', problem_file)
    problem = planner._parse(domain_file, problem_file)
    return problem

Exemple #4

Fichier : test_parcprinter.py Projet : KDercksen/SPML

import os

import py

from task import Task, Operator

import pyperplan as planner
from search import breadth_first_search, searchspace

benchmarks = os.path.abspath(os.path.join(os.path.abspath(__file__),
                                          '../../../benchmarks'))

# Collect problem files
problem_file = os.path.join(benchmarks, 'parcprinter', 'task01.pddl')
domain_file = planner.find_domain(problem_file)

problem = planner._parse(domain_file, problem_file)
task = planner._ground(problem)

# Manually do the "search"
node = searchspace.make_root_node(task.initial_state)
for step, op_name in enumerate(optimal_plan, start=1):
    for op, successor_state in task.get_successor_states(node.state):
        if not op.name.strip('()') == op_name:
            continue
        node = searchspace.make_child_node(node, op, successor_state)

# Check that we reached the goal
assert len(task.goals - node.state) == 0