%PDF-1.5 % 1 0 obj << /S /GoTo /D (chapter*.1) >> endobj 4 0 obj (Tabla de Contenidos) endobj 5 0 obj << /S /GoTo /D (chapter*.1) >> endobj 7 0 obj (Lista de Tablas) endobj 8 0 obj << /S /GoTo /D (chapter*.2) >> endobj 11 0 obj (Lista de Figuras) endobj 12 0 obj << /S /GoTo /D (chapter*.4) >> endobj 15 0 obj (Agradecimientos) endobj 16 0 obj << /S /GoTo /D (chapter*.5) >> endobj 19 0 obj (Resumen) endobj 20 0 obj << /S /GoTo /D (chapter*.6) >> endobj 23 0 obj (Abstract) endobj 24 0 obj << /S /GoTo /D (chapter*.7) >> endobj 27 0 obj (Resum) endobj 28 0 obj << /S /GoTo /D (chapter.1) >> endobj 31 0 obj (1 Introducci\363n) endobj 32 0 obj << /S /GoTo /D (section.1.1) >> endobj 35 0 obj (1.1 Antecedentes) endobj 36 0 obj << /S /GoTo /D (subsection.1.1.1) >> endobj 39 0 obj (1.1.1 Breve rese\361a hist\363rica) endobj 40 0 obj << /S /GoTo /D (subsection.1.1.2) >> endobj 43 0 obj (1.1.2 Perspectiva actual) endobj 44 0 obj << /S /GoTo /D (section.1.2) >> endobj 47 0 obj (1.2 Motivaci\363n y objetivos) endobj 48 0 obj << /S /GoTo /D (section.1.3) >> endobj 51 0 obj (1.3 Aportaciones de la tesis) endobj 52 0 obj << /S /GoTo /D (section.1.4) >> endobj 55 0 obj (1.4 Organizaci\363n del trabajo) endobj 56 0 obj << /S /GoTo /D (chapter.2) >> endobj 59 0 obj (2 La planificaci\363n en Inteligencia Artificial) endobj 60 0 obj << /S /GoTo /D (section.2.1) >> endobj 63 0 obj (2.1 Definici\363n del problema) endobj 64 0 obj << /S /GoTo /D (subsection.2.1.1) >> endobj 67 0 obj (2.1.1 Representaci\363n en planificaci\363n cl\341sica) endobj 68 0 obj << /S /GoTo /D (subsection.2.1.2) >> endobj 71 0 obj (2.1.2 Representaci\363n de un problema de planificaci\363n en PDDL) endobj 72 0 obj << /S /GoTo /D (section.2.2) >> endobj 75 0 obj (2.2 Aproximaciones de planificaci\363n cl\341sica) endobj 76 0 obj << /S /GoTo /D (subsection.2.2.1) >> endobj 79 0 obj (2.2.1 Planificaci\363n de Orden Parcial) endobj 80 0 obj << /S /GoTo /D (subsection.2.2.2) >> endobj 83 0 obj (2.2.2 Planificaci\363n basada en grafos) endobj 84 0 obj << /S /GoTo /D (subsection.2.2.3) >> endobj 87 0 obj (2.2.3 Planificaci\363n heur\355stica) endobj 88 0 obj << /S /GoTo /D (section.2.3) >> endobj 91 0 obj (2.3 Planificaci\363n Temporal) endobj 92 0 obj << /S /GoTo /D (subsection.2.3.1) >> endobj 95 0 obj (2.3.1 Modelos de acciones con duraci\363n) endobj 96 0 obj << /S /GoTo /D (subsection.2.3.2) >> endobj 99 0 obj (2.3.2 Representaci\363n en planificaci\363n temporal) endobj 100 0 obj << /S /GoTo /D (subsection.2.3.3) >> endobj 103 0 obj (2.3.3 Evoluci\363n de la planificaci\363n temporal) endobj 104 0 obj << /S /GoTo /D (subsection.2.3.4) >> endobj 107 0 obj (2.3.4 Planificadores temporales en la actualidad) endobj 108 0 obj << /S /GoTo /D (section.2.4) >> endobj 111 0 obj (2.4 Restricciones temporales) endobj 112 0 obj << /S /GoTo /D (subsection.2.4.1) >> endobj 115 0 obj (2.4.1 PDDL2.2) endobj 116 0 obj << /S /GoTo /D (subsection.2.4.2) >> endobj 119 0 obj (2.4.2 PDDL3.0 ) endobj 120 0 obj << /S /GoTo /D (section.2.5) >> endobj 123 0 obj (2.5 Conclusiones) endobj 124 0 obj << /S /GoTo /D (chapter.3) >> endobj 127 0 obj (3 Grafos de Landmarks STRIPS) endobj 128 0 obj << /S /GoTo /D (section.3.1) >> endobj 131 0 obj (3.1 Introducci\363n) endobj 132 0 obj << /S /GoTo /D (section.3.2) >> endobj 135 0 obj (3.2 Ejemplo de aplicaci\363n) endobj 136 0 obj << /S /GoTo /D (section.3.3) >> endobj 139 0 obj (3.3 Conceptos de landmarks) endobj 140 0 obj << /S /GoTo /D (subsection.3.3.1) >> endobj 143 0 obj (3.3.1 Relaciones de orden entre landmarks) endobj 144 0 obj << /S /GoTo /D (subsection.3.3.2) >> endobj 147 0 obj (3.3.2 Grafo de landmaks) endobj 148 0 obj << /S /GoTo /D (section.3.4) >> endobj 151 0 obj (3.4 M\351todos para la generaci\363n del grafo de landmarks) endobj 152 0 obj << /S /GoTo /D (subsection.3.4.1) >> endobj 155 0 obj (3.4.1 La aproximaci\363n LM) endobj 156 0 obj << /S /GoTo /D (subsection.3.4.2) >> endobj 159 0 obj (3.4.2 La aproximaci\363n DL) endobj 160 0 obj << /S /GoTo /D (subsection.3.4.3) >> endobj 163 0 obj (3.4.3 La aproximaci\363n DTG) endobj 164 0 obj << /S /GoTo /D (subsection.3.4.4) >> endobj 167 0 obj (3.4.4 La aproximaci\363n Pro) endobj 168 0 obj << /S /GoTo /D (subsection.3.4.5) >> endobj 171 0 obj (3.4.5 Comparativa entre estas aproximaciones) endobj 172 0 obj << /S /GoTo /D (section.3.5) >> endobj 175 0 obj (3.5 Aproximaci\363n FULL) endobj 176 0 obj << /S /GoTo /D (section.3.6) >> endobj 179 0 obj (3.6 Conclusiones) endobj 180 0 obj << /S /GoTo /D (chapter.4) >> endobj 183 0 obj (4 Modelo de Landmarks Temporales ) endobj 184 0 obj << /S /GoTo /D (section.4.1) >> endobj 187 0 obj (4.1 Introducci\363n) endobj 188 0 obj << /S /GoTo /D (section.4.2) >> endobj 191 0 obj (4.2 Problema de Planificaci\363n Temporal con Restricciones) endobj 192 0 obj << /S /GoTo /D (subsection.4.2.1) >> endobj 195 0 obj (4.2.1 Interferencias entre literales del modelo temporal) endobj 196 0 obj << /S /GoTo /D (section.4.3) >> endobj 199 0 obj (4.3 Modelo de Landmarks Temporales) endobj 200 0 obj << /S /GoTo /D (subsection.4.3.1) >> endobj 203 0 obj (4.3.1 Definici\363n de landmark temporal) endobj 204 0 obj << /S /GoTo /D (subsection.4.3.2) >> endobj 207 0 obj (4.3.2 Representaci\363n de deadlines en un modelo de landmarks temporales) endobj 208 0 obj << /S /GoTo /D (subsection.4.3.3) >> endobj 211 0 obj (4.3.3 Relaciones de orden entre landmarks temporales) endobj 212 0 obj << /S /GoTo /D (subsection.4.3.4) >> endobj 215 0 obj (4.3.4 Grafo de Landmarks Temporales) endobj 216 0 obj << /S /GoTo /D (section.4.4) >> endobj 219 0 obj (4.4 Construcci\363n del Grafo de Landmarks Temporales) endobj 220 0 obj << /S /GoTo /D (subsection.4.4.1) >> endobj 223 0 obj (4.4.1 Paso 1: Extracci\363n de landmarks y \363rdenes) endobj 224 0 obj << /S /GoTo /D (subsection.4.4.2) >> endobj 227 0 obj (4.4.2 Paso 2: Propagaci\363n de la informaci\363n temporal) endobj 228 0 obj << /S /GoTo /D (subsection.4.4.3) >> endobj 231 0 obj (4.4.3 Paso 3: An\341lisis de las inconsistencias temporales) endobj 232 0 obj << /S /GoTo /D (section.4.5) >> endobj 235 0 obj (4.5 Conclusiones) endobj 236 0 obj << /S /GoTo /D (chapter.5) >> endobj 239 0 obj (5 TempLM: Planificador basado en Landmarks Temporales) endobj 240 0 obj << /S /GoTo /D (section.5.1) >> endobj 243 0 obj (5.1 Introducci\363n) endobj 244 0 obj << /S /GoTo /D (section.5.2) >> endobj 247 0 obj (5.2 Modelo preliminar de TempLM: aproximaci\363n CSP) endobj 248 0 obj << /S /GoTo /D (section.5.3) >> endobj 251 0 obj (5.3 Proceso de b\372squeda de TempLM) endobj 252 0 obj << /S /GoTo /D (subsection.5.3.1) >> endobj 255 0 obj (5.3.1 Funci\363n de evaluaci\363n) endobj 256 0 obj << /S /GoTo /D (subsection.5.3.2) >> endobj 259 0 obj (5.3.2 Generaci\363n de sucesores) endobj 260 0 obj << /S /GoTo /D (section.5.4) >> endobj 263 0 obj (5.4 Proceso de feedback de TempLM) endobj 264 0 obj << /S /GoTo /D (subsection.5.4.1) >> endobj 267 0 obj (5.4.1 Refinamiento del grafo de landmarks temporales ) endobj 268 0 obj << /S /GoTo /D (subsection.5.4.2) >> endobj 271 0 obj (5.4.2 Feedback V1) endobj 272 0 obj << /S /GoTo /D (subsection.5.4.3) >> endobj 275 0 obj (5.4.3 Feedback V2) endobj 276 0 obj << /S /GoTo /D (section.5.5) >> endobj 279 0 obj (5.5 An\341lisis de la complejidad) endobj 280 0 obj << /S /GoTo /D (section.5.6) >> endobj 283 0 obj (5.6 Conclusiones) endobj 284 0 obj << /S /GoTo /D (chapter.6) >> endobj 287 0 obj (6 Resultados experimentales) endobj 288 0 obj << /S /GoTo /D (section.6.1) >> endobj 291 0 obj (6.1 Introducci\363n) endobj 292 0 obj << /S /GoTo /D (section.6.2) >> endobj 295 0 obj (6.2 Dominios y configuraci\363n de los experimentos) endobj 296 0 obj << /S /GoTo /D (section.6.3) >> endobj 299 0 obj (6.3 Comparativa I: TempLM versus OPTIC, MIPS-XXL y SGPLAN5) endobj 300 0 obj << /S /GoTo /D (section.6.4) >> endobj 303 0 obj (6.4 Comparativa II: beneficios de la utilizaci\363n de landmarks y feedback) endobj 304 0 obj << /S /GoTo /D (subsection.6.4.1) >> endobj 307 0 obj (6.4.1 Problemas originales de las competiciones IPC 2004 e IPC 2006) endobj 308 0 obj << /S /GoTo /D (subsection.6.4.2) >> endobj 311 0 obj (6.4.2 Problemas clasificados como tight) endobj 312 0 obj << /S /GoTo /D (subsection.6.4.3) >> endobj 315 0 obj (6.4.3 Problemas clasificados como irresolubles) endobj 316 0 obj << /S /GoTo /D (subsection.6.4.4) >> endobj 319 0 obj (6.4.4 Problemas no clasificados) endobj 320 0 obj << /S /GoTo /D (section.6.5) >> endobj 323 0 obj (6.5 Comparativa III: comparativa con una nueva aproximaci\363n que utiliza landmarks temporales) endobj 324 0 obj << /S /GoTo /D (section.6.6) >> endobj 327 0 obj (6.6 Conclusiones) endobj 328 0 obj << /S /GoTo /D (chapter.7) >> endobj 331 0 obj (7 Conclusiones y trabajo futuro) endobj 332 0 obj << /S /GoTo /D (section.7.1) >> endobj 335 0 obj (7.1 Introducci\363n) endobj 336 0 obj << /S /GoTo /D (section.7.2) >> endobj 339 0 obj (7.2 Conclusiones) endobj 340 0 obj << /S /GoTo /D (subsection.7.2.1) >> endobj 343 0 obj (7.2.1 Contribuciones de la tesis) endobj 344 0 obj << /S /GoTo /D (subsection.7.2.2) >> endobj 347 0 obj (7.2.2 Publicaciones de la tesis) endobj 348 0 obj << /S /GoTo /D (section.7.3) >> endobj 351 0 obj (7.3 Trabajos futuros) endobj 352 0 obj << /S /GoTo /D (appendix.Alph1) >> endobj 355 0 obj (A Representaci\363n de los dominios en PDDL) endobj 356 0 obj << /S /GoTo /D (section.Alph1.1) >> endobj 359 0 obj (A.1 Especificaci\363n del dominio depots) endobj 360 0 obj << /S /GoTo /D (section.Alph1.2) >> endobj 363 0 obj (A.2 Especificaci\363n del problema del dominio depots del Cap\355tulo 2) endobj 364 0 obj << /S /GoTo /D (section.Alph1.3) >> endobj 367 0 obj (A.3 Especificaci\363n del problema del dominio depots del Cap\355tulo 3) endobj 368 0 obj << /S /GoTo /D (section.Alph1.3) >> endobj 370 0 obj (Bibliograf\355a) endobj 371 0 obj << /S /GoTo /D [372 0 R /Fit] >> endobj 376 0 obj << /Length 621 /Filter /FlateDecode >> stream x]RMs0Wp3EA_ z#tHmbKۃIˌT$f}cG
z^ܑ#3Q~$!"sN}E270,7{6.ۦǃ
v_V&w/ J^{,ʱb| )o76=\#+֩O%Z% F[Hh[V'DTxՋms[Y出*v