Detailed Information on Publication Record
2022
General Optimization Framework for Recurrent Reachability Objectives
KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁKBasic information
Original name
General Optimization Framework for Recurrent Reachability Objectives
Authors
KLAŠKA, David (203 Czech Republic, belonging to the institution), Antonín KUČERA (203 Czech Republic, guarantor, belonging to the institution), Vít MUSIL (203 Czech Republic, belonging to the institution) and Vojtěch ŘEHÁK (203 Czech Republic, belonging to the institution)
Edition
Neuveden, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, p. 4642-4648, 7 pp. 2022
Publisher
ijcai.org
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
electronic version available online
References:
RIV identification code
RIV/00216224:14330/22:00126564
Organization unit
Faculty of Informatics
ISBN
978-1-956792-00-3
ISSN
Keywords in English
recurrent reachability objectives; strategy synthesis
Tags
Tags
International impact, Reviewed
Změněno: 28/3/2023 11:54, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
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.
Links
CZ.02.2.69/0.0/0.0/18_053/0016952, interní kód MU (CEP code: EF18_053/0016952) |
| ||
EF18_053/0016952, research and development project |
| ||
GA21-24711S, research and development project |
| ||
MUNI/A/1145/2021, interní kód MU |
| ||
MUNI/A/1230/2021, interní kód MU |
|