-
Notifications
You must be signed in to change notification settings - Fork 1
Roadmap
Yoav Grimland edited this page May 5, 2025
·
6 revisions
- Full "Usage" documentation:
- How to prevent full problem from being known to user (for instance, so they cannot parse the PDDL to find out where "hidden treasure" is)
- How to define probabilistic actions
- report cards, and maybe a more general framework for summary statistics
- code tests
- pddl Serialization (for now not really needed, also is kinda annoying)
- full protocol to manage a simulator with access to a set of problems? (Not really needed, one can run multiple servers, but maybe add code to make running a multi-server easier)
- a more efficient implementation for "get grounded actions" (successor generation) is possible using database theory and query optimization.
- The gist of it is compiling a precondition into a set of conjunctive queries with negation, and then running these efficiently using join algorithms and filtering for the negations (whenever possible).
- Good fit for a student interested in these topics.
- An implementation should probably use FFI. If using Rust, consider Maturin!