| 書目名稱 | Qualitative Spatial Abstraction in Reinforcement Learning |
| 編輯 | Lutz Frommberger |
| 視頻video | http://file.papertrans.cn/781/780180/780180.mp4 |
| 概述 | Book introduces many original ideas.Significant contribution to the field of reinforcement learning.Contains pointers to future research |
| 叢書名稱 | Cognitive Technologies |
| 圖書封面 |  |
| 描述 | .Reinforcement learning has developed as a successful learning approach for domains that are not fully understood and that are too complex to be described in closed form. However, reinforcement learning does not scale well to large and continuous problems. Furthermore, acquired knowledge specific to the learned task, and transfer of knowledge to new tasks is crucial..?.In this book the author investigates whether deficiencies of reinforcement learning can be overcome by suitable abstraction methods. He discusses various forms of spatial abstraction, in particular qualitative abstraction, a form of representing knowledge that has been thoroughly investigated and successfully applied in spatial cognition research. With his approach, he exploits spatial structures and structural similarity to support the learning process by abstracting from less important features and stressing the essential ones. The author demonstrates his learning approach and the transferability of knowledge by having his system learn in a virtual robot simulation system and consequently transfer the acquired knowledge to a physical robot. The approach is influenced by findings from cognitive science. .?.The book |
| 出版日期 | Book 2010 |
| 關(guān)鍵詞 | Spatial Abstraction; State Space Representation; Temporal Abstraction; Transfer Learni; artificial intel |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-16590-0 |
| isbn_softcover | 978-3-642-26600-3 |
| isbn_ebook | 978-3-642-16590-0Series ISSN 1611-2482 Series E-ISSN 2197-6635 |
| issn_series | 1611-2482 |
| copyright | Springer-Verlag Berlin Heidelberg 2010 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-7 17:56
發(fā)表于 2025-3-21 19:44:15
