Symbolic Generalization for On-line Planning
نویسندگان
چکیده
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 online 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 modelchecking 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.
منابع مشابه
The Organizer: Planning Tasks with an Emergent Connectionist/symbolic System
A methodology is proposed for the research and implementation of a learning and planning system for robotic tasks named The Organizer. Under the ['ramework of the Organization level of the Intelligent Machine. the Organizer follows a bottom up approach by creating condition/action/effect rules through experimentation and observation of an abstracted environment. Created rules may have probabili...
متن کاملInterleaving Execution and Planning via Symbolic Model Checking
Interleaving planning and execution is the practical alternative to the problem of planning off-line with large state spaces. While planning via symbolic model checking has been extensively studied for off-line planning, no framework for interleaving it with execution has been ever devised. In this paper, we extend planning via symbolic model checking with the ability of interleaving planning a...
متن کاملOn the Implementation of MIPS
Planning is a central topic of AI and provides solutions to problems given in a problem independent formalism. Recent successes in the exploration of model checking and single-agent search problems have led to a generalization of the symbolic exploration method with binary decision diagrams (BDDs). In this paper we present the use, architecture, implementation and performance of our STRIPS plan...
متن کاملSymbolic Pattern Databases in Heuristic Search Planning
This paper invents symbolic pattern databases (SPDB) to combine two influencing aspects for recent progress in domain-independent action planning, namely heuristic search and model checking. SPDBs are off-line computed dictionaries, generated in symbolic backward traversals of automatically inferred planning space abstractions. The entries of SPDBs serve as heuristic estimates to accelerate exp...
متن کاملSymbolic Heuristic Search Using Decision Diagrams
We show how to use symbolic model-checking techniques in heuristic search algorithms for both deterministic and decision-theoretic planning problems. A symbolic approach exploits state abstraction by using decision diagrams to compactly represent sets of states and operators on sets of states. In earlier work, symbolic model-checking techniques have been used to find plans that minimize the num...
متن کامل