z-logo
open-access-imgOpen Access
Task Scoping for Efficient Planning in Open Worlds (Student Abstract)
Author(s) -
Nishanth Kumar,
Michael Fishman,
Natasha Danas,
Stefanie Tellex,
Michael L. Littman,
George Konidaris
Publication year - 2020
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v34i10.7195
Subject(s) - markov decision process , task (project management) , bellman equation , computer science , subspace topology , action (physics) , state (computer science) , abstraction , function (biology) , artificial intelligence , markov process , mathematical optimization , mathematics , algorithm , engineering , statistics , quantum mechanics , biology , philosophy , evolutionary biology , systems engineering , physics , epistemology
We propose an abstraction method for open-world environments expressed as Factored Markov Decision Processes (FMDPs) with very large state and action spaces. Our method prunes state and action variables that are irrelevant to the optimal value function on the state subspace the agent would visit when following any optimal policy from the initial state. This method thus enables tractable fast planning within large open-world FMDPs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom