AO* revisited Public Deposited

http://ir.library.oregonstate.edu/concern/defaults/n870zs111

Preprint submitted to Elsevier Science 30 June 2004.

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • This paper revisits the AO* algorithm introduced by Martelli and Montanari [1] and made popular by Nilsson [2] The paper's main contributions are: (1) proving that the value of a node monotonically increases as the AO* search progresses , (2) proving that selective updates of the value function in the AO* algorithm are correct and providing guidance to researchers interested in the AO* implementation. (1) and (2) are proven under the assumption that the heuristic used by AO* is consistent. The paper also reviews the use of AO* for solving Markov Decision Processes (MDPs) and Partially Observable Markov Decision Processes (POMDPs).
Resource Type
Date Available
Date Issued
Keyword
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-08-08T18:10:34Z No. of bitstreams: 1 2004-51 AO revisited.pdf: 287535 bytes, checksum: 347fc3253adb42ebb735bcdd1f7a8b7c (MD5)
  • description.provenance : Made available in DSpace on 2012-08-31T17:03:29Z (GMT). No. of bitstreams: 1 2004-51 AO revisited.pdf: 287535 bytes, checksum: 347fc3253adb42ebb735bcdd1f7a8b7c (MD5) Previous issue date: 2004-06-30
  • description.provenance : Approved for entry into archive by Michael Boock(michael.boock@oregonstate.edu) on 2012-08-31T17:03:29Z (GMT) No. of bitstreams: 1 2004-51 AO revisited.pdf: 287535 bytes, checksum: 347fc3253adb42ebb735bcdd1f7a8b7c (MD5)

Relationships

In Administrative Set:
Last modified: 07/18/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items