By Topic

Observation Reduction for State-Action Tables

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wei Huang ; Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China ; Hong Peng

The problem of planning for reachability goals in full observable nondeterministic domains has been addressed in the literature, where plans are often expressed as state-action tables under the hypothesis that, states of the world can be sensed directly by the robot or agent executing the plans. In most real world domains, however, a robot or agent distinguishes states of the world by acquiring some optional observation information at some cost. In addition, some observation information may be unnecessary to the plan execution. Observation reduction for a general state-action table, aims at reducing the observation information that is unnecessary at execution time. The contribution of this paper is an algorithm that calculates the loops of belief states, and necessary observation information that may arise during the execution of a state--action table; and transforms the state-action table into a structured plan which only branches on the necessary observation information.

Published in:

Computational Intelligence and Security, 2009. CIS '09. International Conference on  (Volume:2 )

Date of Conference:

11-14 Dec. 2009