https://github.com/cosilab/inverseplanning.jl
Agent modeling and inverse planning, using PDDL and Gen.
Science Score: 36.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
○CITATION.cff file
-
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
○DOI references
-
✓Academic publication links
Links to: arxiv.org -
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (12.9%) to scientific vocabulary
Repository
Agent modeling and inverse planning, using PDDL and Gen.
Basic Info
- Host: GitHub
- Owner: cosilab
- License: apache-2.0
- Language: Julia
- Default Branch: main
- Size: 1.61 MB
Statistics
- Stars: 9
- Watchers: 4
- Forks: 0
- Open Issues: 0
- Releases: 2
Metadata Files
README.md
InversePlanning.jl
An architecture for planning, inverse planning, and inference in planning, using PDDL and Gen.
Initially developed under the MIT Probabilistic Computing Project and the MIT Computational Cognitive Science lab. Now maintained by the Cooperative Systems & Intelligence (CoSI) lab at NUS.
Setup
To use this library in your own projects, press ] at the Julia REPL to
enter the package manager, then run:
julia-repl
add PDDL SymbolicPlanners
add Gen GenParticleFilters
add PDDLViz GLMakie
add https://github.com/cosilab/InversePlanning.jl.git
To explore the examples provided in this repository, clone this repository,
press ] at the Julia REPL to enter the package manager, then run the following
commands:
julia-repl
activate examples
dev ./
instantiate
This will activate the examples directory as the project environment, set up
your cloned copy of InversePlanning.jl as a dependency, and install any
remaining dependencies.
Examples
InversePlanning.jl can be used to model agents that perform model-based heuristic search to achieve their goals. Below, we visualize a sampled trace for a replanning agent that interleaves resource-bounded plan search with plan execution:
We can then perform goal inference for these agents:
Notice that the correct goal is eventually inferred, despite backtracking by the agent. This is because we model the agent as boundedly rational: it does not always produce optimal plans. Indeed, this modeling assumption also allows us to infer goals from failed plans:
Because we use the Planning Domain Definition Language (PDDL) as our underlying state representation, our architecture supports a large range of domains, including the classic Blocks World:
For more details about the modeling and inference architecture, consult our paper:
T. Zhi-Xuan, J. L. Mann, T. Silver, J. B. Tenenbaum, and V. K. Mansinghka, “Online Bayesian Goal Inference for Boundedly-Rational Planning Agents,” Advances in Neural Information Processing Systems, Jun. 2020.
Full example code for several domains can be found here: Gridworld; Doors, Keys & Gems; Block Words
Owner
- Name: Cooperative Systems & Intelligence (CoSI) Lab
- Login: cosilab
- Kind: organization
- Repositories: 1
- Profile: https://github.com/cosilab
Cooperative Systems & Intelligence.
GitHub Events
Total
- Push event: 1
Last Year
- Push event: 1
Issues and Pull Requests
Last synced: 11 months ago