| LDR | | 00000nam u2200205 4500 |
| 001 | | 000000436559 |
| 005 | | 20200228144717 |
| 008 | | 200131s2018 ||||||||||||||||| ||eng d |
| 020 | |
▼a 9781085588065 |
| 035 | |
▼a (MiAaPQ)AAI13418712 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 629.8 |
| 100 | 1 |
▼a Isele, David. |
| 245 | 10 |
▼a Lifelong Reinforcement Learning on Mobile Robots. |
| 260 | |
▼a [S.l.]:
▼b University of Pennsylvania.,
▼c 2018. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2018. |
| 300 | |
▼a 196 p. |
| 500 | |
▼a Source: Dissertations Abstracts International, Volume: 81-02, Section: B. |
| 500 | |
▼a Advisor: Eaton, Eric |
| 502 | 1 |
▼a Thesis (Ph.D.)--University of Pennsylvania, 2018. |
| 506 | |
▼a This item must not be sold to any third party vendors. |
| 520 | |
▼a Machine learning has shown tremendous growth in the past decades, unlocking new capabilities in a variety of fields including computer vision, natural language processing, and robotic control. While the sophistication of individual problems a learning system can handle has greatly advanced, the ability of a system to extend beyond an individual problem to adapt and solve new problems has progressed more slowly. This thesis explores the problem of progressive learning. The goal is to develop methodologies that accumulate, transfer, and adapt knowledge in applied settings where the system is faced with the ambiguity and resource limitations of operating in the physical world.There are undoubtedly many challenges to designing such a system, my thesis looks at the component of this problem related to how knowledge from previous tasks can be a benefit in the domain of reinforcement learning where the agent receives rewards for positive actions. Reinforcement learning is particularly difficult when training on physical systems, like mobile robots, where repeated trials can damage the system and unrestricted exploration is often associated with safety risks. I investigate how knowledge can be efficiently accumulated and applied to future reinforcement learning problems on mobile robots in order to reduce sample complexity and enable systems to adapt to novel settings. Doing this involves mathematical models which can combine knowledge from multiple tasks, methods for restructuring optimizations and data collection to handle sequential updates, and data selection strategies that can be used to address resource limitations. |
| 590 | |
▼a School code: 0175. |
| 650 | 4 |
▼a Artificial intelligence. |
| 650 | 4 |
▼a Robotics. |
| 690 | |
▼a 0800 |
| 690 | |
▼a 0771 |
| 710 | 20 |
▼a University of Pennsylvania.
▼b Computer and Information Science. |
| 773 | 0 |
▼t Dissertations Abstracts International
▼g 81-02B. |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0175 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15490403
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 202002
▼f 2020 |
| 990 | |
▼a ***1816162 |
| 991 | |
▼a E-BOOK |