Symbolic Generalization for On-line Planning

by   Zhengzhu Feng, et al.

Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of on-line planners. In addition to reducing computation time, symbolic generalization can reduce the amount of costly real-world interactions required for convergence. We introduce Symbolic Real-Time Dynamic Programming (or sRTDP), an extension of RTDP. After each step of on-line interaction with an environment, sRTDP uses symbolic model-checking techniques to generalizes its experience by updating a group of states rather than a single state. We examine two heuristic approaches to dynamic grouping of states and show that they accelerate the planning process significantly in terms of both CPU time and the number of steps of interaction with the environment.


page 1

page 2

page 3

page 4


PEORL: Integrating Symbolic Planning and Hierarchical Reinforcement Learning for Robust Decision-Making

Reinforcement learning and symbolic planning have both been used to buil...

Towards Symbolic Factual Change in DEL

We extend symbolic model checking for Dynamic Epistemic Logic (DEL) with...

Symbolic Time and Space Tradeoffs for Probabilistic Verification

We present a faster symbolic algorithm for the following central problem...

Symbolic Multibody Methods for Real-Time Simulation of Railway Vehicles

In this work, recently developed state-of-the-art symbolic multibody met...

Symbolic Probabilitistic Inference in Large BN2O Networks

A BN2O network is a two level belief net in which the parent interaction...

Conformant Planning via Symbolic Model Checking

We tackle the problem of planning in nondeterministic domains, by presen...

TASKOGRAPHY: Evaluating robot task planning over large 3D scene graphs

3D scene graphs (3DSGs) are an emerging description; unifying symbolic, ...