Theory and Analysis of Optimal Planning over Long and Infinite Horizons for Achieving Independent Partially-Observable Tasks that Evolve over Time

02/25/2021
by   Anahita Mohseni-Kabir, et al.
0

We present the theoretical analysis and proofs of a recently developed algorithm that allows for optimal planning over long and infinite horizons for achieving multiple independent tasks that are partially observable and evolve over time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2021

Waiting Tables as a Robot Planning Problem

We present how we formalize the waiting tables task in a restaurant as a...
research
02/06/2023

Leveraging AI to improve human planning in large partially observable environments

AI can not only outperform people in many planning tasks, but also teach...
research
06/22/2022

POGEMA: Partially Observable Grid Environment for Multiple Agents

We introduce POGEMA (https://github.com/AIRI-Institute/pogema) a sandbox...
research
05/18/2006

Cross-Entropic Learning of a Machine for the Decision in a Partially Observable Universe

Revision of the paper previously entitled "Learning a Machine for the De...
research
11/01/1997

A Model Approximation Scheme for Planning in Partially Observable Stochastic Domains

Partially observable Markov decision processes (POMDPs) are a natural mo...
research
11/12/2019

Efficient Planning under Partial Observability with Unnormalized Q Functions and Spectral Learning

Learning and planning in partially-observable domains is one of the most...
research
03/08/2021

Unsupervised Object-Based Transition Models for 3D Partially Observable Environments

We present a slot-wise, object-based transition model that decomposes a ...

Please sign up or login with your details

Forgot password? Click here to reset