Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/30291
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | Robot planning in partially observable continuous domains |
Autor: | Porta, Josep M. CSIC ORCID ; Spaan, Matthijs T. J.; Vlassis, Nikos | Palabras clave: | Automation: Robots Robots Robotics |
Fecha de publicación: | 2005 | Editor: | Massachusetts Institute of Technology | Citación: | 1st Robotics: Science and Systems Conference: pp. 217-224 (2005) | Resumen: | We present a value iteration algorithm for learning to act in Partially Observable Markov Decision Processes (POMDPs) with continuous state spaces. Mainstream POMDP research focuses on the discrete case and this complicates its application to, e.g., robotic problems that are naturally modeled using continuous state spaces. The main difficulty in defining a (belief-based) POMDP in a continuous state space is that expected values over states must be defined using integrals that, in general, cannot be computed in closed from. In this paper, we first show that the optimal finite-horizon value function over the continuous infinite-dimensional POMDP belief space is piecewise linear and convex, and is defined by a finite set of supporting alpha-functions that are analogous to the alpha-vectors (hyperplanes) defining the value function of a discrete-state POMDP. Second, we show that, for a fairly general class of POMDP models in which all functions of interest are modeled by Gaussian mixtures, all belief updates and value iteration backups can be carried out analytically and exact. A crucial difference with respect to the alpha-vectors of the discrete case is that, in the continuous case, the alpha-functions will typically grow in complexity (e.g., in the number of components) in each value iteration. Finally, we demonstrate PERSEUS, our previously proposed randomized point-based value iteration algorithm, in a simple robot planning problem with a continuous domain, where encouraging results are observed. | Descripción: | Robotics: Science and Systems Conference (RSS), 2005, Cambridge (EE.UU.) | URI: | http://hdl.handle.net/10261/30291 | ISBN: | 9780262701143 |
Aparece en las colecciones: | (IRII) Comunicaciones congresos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
doc1.pdf | 319,58 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
358
checked on 22-abr-2024
Download(s)
208
checked on 22-abr-2024
Google ScholarTM
Check
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.