Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/186821
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Corcuera Valverde, José Manuel | - |
dc.contributor.author | Rosell Esau, Keila Ruth | - |
dc.date.accessioned | 2022-06-20T08:36:26Z | - |
dc.date.available | 2022-06-20T08:36:26Z | - |
dc.date.issued | 2022-01-23 | - |
dc.identifier.uri | http://hdl.handle.net/2445/186821 | - |
dc.description | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: José Manuel Corcuera Valverde | ca |
dc.description.abstract | [en] In this thesis we study the optimization method called Dynamic Programming and how it is implemented to solve sequential problems, that is, those problems in which the solution is to make a series of decisions in many different stages in order to maximize a reward, according to a purpose. Different approaches are analyzed, depending on whether all the data is known for the problem, in the deterministic case, or if the data is determined by a probability distribution, in the stochastic case. A distinction will also be made for cases where time evolves in a discrete way or if it does so continuously. For each case we will develop the Hamilton-Jacobi-Bellman equation, which is a central element of the dynamic programming algorithms and is useful in finding and comparing different strategies for the decision-making agent. Finally, dynamic programming is applied to reinforcement learning, which is an area of artificial intelligence that is focused on determining what actions a software agent must choose in a given environment, in order to find the highest reward. | ca |
dc.format.extent | 48 p. | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | spa | ca |
dc.rights | cc-by-nc-nd (c) Keila Ruth Rosell Esau, 2022 | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.source | Treballs Finals de Grau (TFG) - Matemàtiques | - |
dc.subject.classification | Equacions de Hamilton-Jacobi | ca |
dc.subject.classification | Treballs de fi de grau | - |
dc.subject.classification | Programació dinàmica | ca |
dc.subject.classification | Optimització matemàtica | ca |
dc.subject.classification | Processos de Markov | ca |
dc.subject.other | Hamilton-Jacobi equations | en |
dc.subject.other | Bachelor's theses | - |
dc.subject.other | Dynamic programming | en |
dc.subject.other | Mathematical optimization | en |
dc.subject.other | Markov processes | en |
dc.title | Optimización con programación dinámica | ca |
dc.type | info:eu-repo/semantics/bachelorThesis | ca |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca |
Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tfg_rosell_esau_keila_ruth.pdf | Memòria | 628.57 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License