Bounded Incremental Real-Time Dynamic Programming

A real-time multi-step planning problem is characterized by alternating decision-making and execution processes, whole online decision-making time divided in slices between each execution, and the pressing need for policy that only relates to current step. We propose a new criterion to judge the opt...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the Frontiers in the Convergence of Bioscience and Information Technolgies : Jeju Island, Korea, October 11-13, 2007 pp. 637 - 644
Main Authors: Changjie Fan, Xiaoping Chen
Format: Conference Proceeding
Language:English
Published: IEEE 01.10.2007
Subjects:
Algorithm design and analysis
Computer science
Decision making
Dynamic programming
Heuristic algorithms
Information technology
Process planning
Real time systems
Technology planning
Uncertainty
ISBN:9780769529998, 0769529992
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A real-time multi-step planning problem is characterized by alternating decision-making and execution processes, whole online decision-making time divided in slices between each execution, and the pressing need for policy that only relates to current step. We propose a new criterion to judge the optimality of a policy based on the upper and lower bound theory. This criterion guarantees that the agent can act earlier in a real-time decision process while an optimal policy with sufficient precision still remains. We prove that, under certain conditions, one can obtain an optimal policy with arbitrary precision using such an incremental method. We present a bounded incremental real-time dynamic programming algorithm (BIRTDP). In the experiments of two typical real-time simulation systems, BIRTDP outperforms the other state-of-the-art RTDP algorithms tested.
ISBN:9780769529998
0769529992
DOI:10.1109/FBIT.2007.14