dc.contributor.author | LEFEBVRE, Mario | |
dc.date.accessioned | 2024-12-08T09:40:29Z | |
dc.date.available | 2024-12-08T09:40:29Z | |
dc.date.issued | 2024 | |
dc.identifier.citation | LEFEBVRE, Mario. An optimal landing problem for a bessel process. In: Electronics, Communications and Computing (IC ECCO-2024): The conference program and abstract book: 13th intern. conf., Chişinău, 17-18 Oct. 2024. Technical University of Moldova. Chişinău: Tehnica-UTM, 2024, pp. 149-150. ISBN 978-9975-64-480-8 (PDF). | en_US |
dc.identifier.isbn | 978-9975-64-480-8 | |
dc.identifier.uri | http://repository.utm.md/handle/5014/28789 | |
dc.description | Only Abstract | en_US |
dc.description.abstract | This type of problem, in which the optimizer controls a stochastic process until a certain event occurs, is known as a homing problem. The above problem can be interpreted as an optimal landing problem, with d representing ground level. Because the parameter 𝜆 is positive, the optimizer tries to reach d as soon as possible, while taking the control costs into account. Therefore, the optimal control 𝑢∗[𝑋(𝑡)] should in general be negative. Moreover, 𝜃 is a risk parameter. If 𝜃 < 1 (respectively, 𝜃 > 1) the optimizer is risk-averse (resp., risk-seeking) and does not want to land too rapidly (resp., wants to land rapidly). | en_US |
dc.language.iso | en | en_US |
dc.publisher | Technical University of Moldova | en_US |
dc.relation.ispartofseries | Electronics, Communications and Computing (IC ECCO-2024): 13th intern. conf., 17-18 Oct. 2024; | |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | stochastic control | en_US |
dc.subject | homing problem | en_US |
dc.subject | first-passage time | en_US |
dc.subject | dynamic programming | en_US |
dc.subject | risk parameter | en_US |
dc.title | An optimal landing problem for a bessel process | en_US |
dc.type | Article | en_US |
The following license files are associated with this item: