Other formats:
BibTeX
LaTeX
RIS
@inproceedings{2214541,
author = {Klaška, David and Kučera, Antonín and Musil, Vít and Řehák, Vojtěch},
address = {Neuveden},
booktitle = {Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022},
doi = {http://dx.doi.org/10.24963/ijcai.2022/644},
editor = {Luc De Raedt},
keywords = {recurrent reachability objectives; strategy synthesis},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Neuveden},
isbn = {978-1-956792-00-3},
pages = {4642-4648},
publisher = {ijcai.org},
title = {General Optimization Framework for Recurrent Reachability Objectives},
url = {https://doi.org/10.24963/ijcai.2022/644},
year = {2022}
}
TY - JOUR
ID - 2214541
AU - Klaška, David - Kučera, Antonín - Musil, Vít - Řehák, Vojtěch
PY - 2022
TI - General Optimization Framework for Recurrent Reachability Objectives
PB - ijcai.org
CY - Neuveden
SN - 9781956792003
KW - recurrent reachability objectives
KW - strategy synthesis
UR - https://doi.org/10.24963/ijcai.2022/644
N2 - We consider the mobile robot path planning problem for a class of recurrent reachability objectives. These objectives are parameterized by the expected time needed to visit one position from another, the expected square of this time, and also the frequency of moves between two neighboring locations. We design an efficient strategy synthesis algorithm for recurrent reachability objectives and demonstrate its functionality on non-trivial instances.
ER -
KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁK. General Optimization Framework for Recurrent Reachability Objectives. Online. In Luc De Raedt. \textit{Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022}. Neuveden: ijcai.org, 2022, p.~4642-4648. ISBN~978-1-956792-00-3. Available from: https://dx.doi.org/10.24963/ijcai.2022/644.
|
