Share Email Print

Proceedings Paper

Quantum search in stochastic planning
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

There has been recent interest in implementing automated planning by optimizing a planning domain modeled as a stochastic system. Planning is viewed as a process where sequential decision problems are solved in order to reach the goal, and thus, can be considered as instances of a Markov Decision Process (MDP). However, standard MDP techniques cannot solve a typical planning problem in polynomial time. Hence, the motivation for investigating the use of quantum search techniques based on the Grover Search Algorithm, to identify policies with high utility.

Paper Details

Date Published: 23 May 2005
PDF: 12 pages
Proc. SPIE 5846, Noise and Information in Nanoelectronics, Sensors, and Standards III, (23 May 2005); doi: 10.1117/12.609962
Show Author Affiliations
Sanjeev Naguleswaran, Univ. of Adelaide (Australia)
Langford B. White, Univ. of Adelaide (Australia)

Published in SPIE Proceedings Vol. 5846:
Noise and Information in Nanoelectronics, Sensors, and Standards III
Janos A. Bergou; Janusz M. Smulko; Mark I. Dykman; Lijun Wang, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?