INFORMATICA, 2003 Vol. 8, No. 2, 267--283
|
Descargar SCORM
¡Sea el primero en solicitar este recurso!
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
INFORMATICA, 2003 Vol. 8, No. 2, 267--283
|
| Id. |
42071260 |
| Idioma |
inglés
|
| Titulo |
INFORMATICA, 2003 Vol. 8, No. 2, 267--283 |
| Localización |
http://citeseer.ist.psu.edu/635723.html
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
Reinforcement learning addresses the question of how an autonomous
agent can learn to choose optimal actions to achieve its goals. Efficient exploration is of
fundamental importance for autonomous agents that learn to act. Previous approaches to
exploration in reinforcement learning usually address exploration in the case when the environment
is fully observable. In contrast, we study the case when the environment is only
partially observable. We consider different exploration techniques applied to the learning
algorithm "Utile Suffix Memory", and, in addition, discuss an adaptive fringe depth. Experimental
results in a partially observable maze show that exploration techniques have
serious impact on performance of learning algorithm.
|
| Tipo |
ps
|
| Palabras clave |
INFORMATICA, 2003 Vol. 8, No. 2, 267--283
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
unrestricted |
| Formatos |
ps
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://dssg.cs.rtu.lv/en/publications/../../download/publications/2003/Pchelkin-INFORMATICA-2003.ps.gz
|
| Fecha de contribución |
31-mar-2009 |
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
