npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

ai-planning-val

v4.0.0

Published

Javascript/typescript wrapper for VAL (AI Planning plan validation and evaluation tools from KCL Planning department and the planning community around the ICAPS conference).

Downloads

59

Readme

VAL.js - AI Planning Plan Validation

CI npm

Javascript/typescript wrapper for VAL (plan validation tools from KCL Planning department).

VAL Download

This package includes utility to download the VAL binaries. Select the build number, destination folder and the binaries for linux/windows/macos will get downloaded automatically. The 4 commonly used executables are chmod +x. If you use other utilities than Parser, Validate, ValStep or ValueSeq, please adjust the chmod yourself.

If you install this package globally using npm install ai-panning-val --global, you can use this command from anywhere:

downloadVal --buildId=60 --destination=./val_binaries/

As a result, a folder named after the VAL version gets created in the ./val_binaries/ together with a val.json manifest:

./val_binaries/Val-201909-11.1-win64/...
./val_binaries/val.json

The val.json is a machine readable manifest for easy consumption into any program. Here is an example:

{
  "buildId": 37,
  "version": "20190911.1",
  "files": [
    "Val-20190911.1-win64/README.md",
    "Val-20190911.1-win64/bin/TIM.exe",
    "Val-20190911.1-win64/bin/Parser.exe",
    "..."
  ],
  "parserPath": "Val-20190911.1-win64/bin/Parser.exe",
  "validatePath": "Val-20190911.1-win64/bin/Validate.exe",
  "valueSeqPath": "Val-20190911.1-win64/bin/ValueSeq.exe",
  "valStepPath": "Val-20190911.1-win64/bin/ValStep.exe"
}

Alternatively, you can run this from your Javascript code:

import { ValDownloader } from 'ai-planning-val';

const manifest = await new ValDownloader().download(60, './val_binaries/');

Parse PDDL Domains and Problems

import { URI } from 'vscode-uri';
import { parser } from 'pddl-workspace';
import { Parser } from 'ai-planning-val';
const domain = parser.PddlDomainParser.parseText(domainText, URI.file('domain'));
const problem = await parser.PddlProblemParser.parseText(problemText, URI.file('problem'));

const pddlParser = new Parser({ executablePath: parserPath });

const parsingProblems = await pddlParser.validate(domain, problem);

parsingProblems.forEach((issues, fileUri) => {
    console.log(`Parsing problems in ${fileUri}`);
    issues.forEach(issue => console.log(`At line: ${issue.range.start.line} ${issue.severity}: ${issue.problem}`))
});

The above may print something like:

Parsing problems in file:///domain

At line: 5 warning: Undeclared requirement :fluents
At line: 10 error: Syntax error in domain

The Parser class may be also used to call other PDDL parser. To do that, override the getSyntax() and createPatternMatchers() methods.

To see an custom Parser implementation sample, see the MockParser class in ParserTest.ts and the mock-parser.js.

Validate plans

function printToConsole(text: string): void {
    console.log(text);
}

const validator = new PlanValidator(printToConsole);

const domain = parser.PddlDomainParser.parseText(domainText);
const problem = await parser.PddlProblemParser.parseText(problemText);
const plan = new parser.PddlPlanParser().parseText(planText, 1e-3, planUri);

const validationProblems = await validator.validate(domain, problem, plan, { cwd: '.', validatePath: 'path/to/validate.exe', epsilon: 1e-3 });

validationProblems.getPlanProblems().forEach((issue) => {
    console.log(`At ${issue.range.start.line}:${issue.range.start.character} ${issue.severity}: ${issue.problem}`);
});

The above may print something like:

At 10:1 error: Goal not achieved.
At 10:1 error: Set p to true.

ValStep state-by-state plan evaluation

The ValStep.js wrapper maybe used in multiple modes.

Following examples will be using this PDDL domain and problem as input:

Domain:

(define (domain domain1)

(:requirements :strips )

(:predicates
    (p)
)

(:action a
    :parameters ()
    :precondition (and )
    :effect (and (p))
)
)

Problem:

(define (problem problem1) (:domain domain1)

(:init )

(:goal (and
    (p)
))
)

Batch plan evaluation

import { parser, Happening, HappeningType } from 'pddl-workspace';
import { ValStep } from 'ai-planning-val';
const domain = parser.PddlDomainParser.parseText(domainText);

const problem = await parser.PddlProblemParser.parseText(problemText);

const allHappenings = [
    new Happening(0.001, HappeningType.INSTANTANEOUS, 'a', 0)
];


const valStep = new ValStep(domain, problem);

valStep.executeBatch(allHappenings, {
    valStepPath: 'ValStep',
    verbose: true
}).then(valuesAtEnd => {
    console.log(`Values at end: ` +
        valuesAtEnd
            .map(v => `${v.getVariableName()}=${v.getValue()}`)
            .join(', '));
    // prints p=true
}).catch(error => done(error));

Batch evaluation with notification events fired for each intermediate state

import { parser, Happening, HappeningType } from 'pddl-workspace';
import { ValStep } from 'ai-planning-val';
const valStep = new ValStep(domain, problem);

valStep.onStateUpdated((happenings, newValues) => {
    console.log(`New Values (after applying ${happenings.length}): ` +
        newValues
            .map(v => `${v.getVariableName()}=${v.getValue()}`)
            .join(', '));
    // prints p=true
});

const valuesAtEnd = await valStep.executeIncrementally(allHappenings, {
  valStepPath: 'path/to/ValStep.exe'
});

Interactive plan execution

const valStep = new ValStep(domain, problem);

valStep.onStateUpdated((happenings, newValues) => {
    console.log(`New Values (after applying ${happenings.length}): ` +
        newValues
            .map(v => `${v.getVariableName()}=${v.getValue()}`)
            .join(', '));
    // prints p=true
});

const valuesAtEnd = await valStep.executeIncrementally(allHappenings, {
    valStepPath: valManifest.valStepPath ?? 'ValStep'
});

PlanEvaluator class

Evaluates the final state of the provided plan.

Let's consider this temporal and numeric PDDL domain, problem and plan:

;;!domain: domain1
;;!problem: problem1

0.00100: (action1 o1) [10.00000]

; Makespan: 10.001
; Cost: 10.001
; States evaluated: 2
const plan = new parser.PddlPlanParser().parseText(planText, 0.001);

const planEvaluator = new PlanEvaluator();
const valStepPath = './val-binaries/..../ValStep';
const finalState = await planEvaluator.evaluate(domain, problem, plan, {
  valStepPath: 'path/to/ValStep.exe'
});
console.log(JSON.stringify(finalState, null, 2));

The console should show this state vector (from the end of the plan):

[
  {
    "time": 10.001,
    "variableName": "q o1",
    "value": true,
  },
  {
    "time": 10.001,
    "variableName": "p o1",
    "value": true,
  },
  {
    "time": 10.001,
    "variableName": "f o1",
    "value": 30,
  }
]

This utility is using ValStep in the batch mode, so the state values all appear to have the same timestamp (timestamp of the last happening) regardless what was the state at which those values were actually created.

Only state values that were modified in the course of the plan, or were initialized in the original problem file are exported.

ValueSeq class

Evaluates numeric function values as they change in the course of the plan.

const valueSeq = new ValueSeq(domainPath, problemPath, planPath, {
    valueSeqPath: 'path/to/ValueSeq.exe',
    adjustDuplicateTimeStamp: true,
    verbose: true
});

const f = domain.getFunction('f'); // for more details, see ValueSeqTest.ts
if (!f) { fail(`'f' not found in domain`); }
const fO1 = f.ground([new ObjectInstance('o1', 'type1')]);

const values = await valueSeq.evaluate([fO1]);

const fO1Values = values.get(fO1.getFullName());

const time0 = fO1Values?.getTimeAtIndex(0);
const value0 = fO1Values?.getValueAtIndex(0);

Alternatively, one can request values for a group of grounded actions corresponding to one lifted:

const values = await valueSeq.evaluateForLifted(f, [fO1]);

console.log(values.toCsv());

This prints the following comma-separated values:

| | f ?t - t1 | | ------------- | --------- | | time | o1 | | 0 | 0 | | 0.001 | 0 | | 0.0010000001 | 10 | | 10.001 | 20 | | 10.0010000001 | 30 |

The adjustDuplicateTimestamps switch adds a 1e-10 delta to every duplicate timestamp, so charting libraries can naturally plot the line as a step function.

Known issue: Currently if multiple grounded functions are passed to ValueSeq#evaluateForLifted(liftedFunction, groundedFunctions) method, the adjustDuplicatedTimeStamps=false flag gets ignored in order to preserve duplicate timestamps.

PlanFunctionEvaluator class

Evaluates numeric function values as they change in the course of the plan.

const planObj = new Plan(plan.getSteps(), domain, problem);
const planEvaluator = new PlanFunctionEvaluator(planObj, {
    valueSeqPath: 'path/to/valueSeq.exe', valStepPath: 'path/to/valStep.exe', shouldGroupByLifted: true
});

const functionValues = await planEvaluator.evaluate();

// print out the data for each graph
functionValues.forEach((variableValues, variable) => {
    console.log(`Variable: ${variableValues}`);
    console.log(variableValues.toCsv());
});

The above code sample prints csv table for each lifted function with one column per grounded function. In other words, it outputs the same structure as ValueSeq above, but for every lifted function.

Known issue: the options: { adjustDuplicatedTimeStamps=false } flag gets ignored if the PDDL problem has multiple grounded functions in order to preserve the duplicate timestamps (for step function charts).

Evaluating NumericExpressions to a time-series over plan happenings

Suppose you have a NumericExpression (i.e. a plan metric) and want to see it on a plot:

const planObj = new Plan(plan.getSteps(), domain, problem);
const planEvaluator = new PlanFunctionEvaluator(planObj, {
    valueSeqPath: valueSeqPath, valStepPath: valStepPath, shouldGroupByLifted: false
});

const metric = problem.getMetrics()[0];

const functionValues = await planEvaluator.evaluateExpression(metric.getExpression());

functionValues.getValue(5); returns value correspnoding to time `5`

Evaluating all metrics

ValueSeq utility responds to special variable name $metrics by calculating time series for all metrics defined in the problem file. Yes, there may be multiple.
This is wrapped by the the evaluateMetrics method:

const functionValues = await planEvaluator.evaluateMetrics();

HappeningsToValStep utility

Converts the Happening objects to input to the ValStep executable.

Compiling and contributing

Install node.js 12.14.1.