Computing Publications

Publications Home » Abstract policy evaluation for re...

Abstract policy evaluation for reactive agents

Krysia Broda, Christopher Hogger

Conference or Workshop Paper
6th International Symposium on Abstraction, Reformulation and Approximation (SARA 2005), Airth Castle, Scotland, July 26-29, 2005
July, 2005
Lecture Notes in Computer Science
Volume 3607
pp.44–59
Springer-Verlag
ISBN 978-3-540-27872-6
DOI 10.1007/11527862_4
Abstract

This paper describes a method for constructing and evaluating teleo-reactive policies for one or more agents, based upon discounted-reward evaluation of policy-restricted subgraphs of complete situation-graphs. The combinatorial burden that would potentially ensue from state-perception associations can be ameliorated by suitable use of abstractions and empirical simulation results indicate that the method affords a good degree of scalability and predictive power. The paper formally analyses the predictive quality of two different abstractions, one for applications involving several agents and one for applications with large numbers of perceptions. Sufficient conditions for reasonable predictive quality are given.

PDF of full publication (188 kilobytes)
(need help viewing PDF files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.