ML Anthology

General Optimization Framework for Recurrent Reachability Objectives

David Klaska, Antonín Kucera, Vít Musil, Vojtech Rehák
IJCAI 2022 pp. 4642-4648
doi:10.24963/IJCAI.2022/644 /ijcai/2022/klaska2022ijcai-general/

Abstract

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.

PDF IJCAI Semantic Scholar

Cite

Text

Klaska et al. "General Optimization Framework for Recurrent Reachability Objectives." International Joint Conference on Artificial Intelligence, 2022. doi:10.24963/IJCAI.2022/644

Markdown

[Klaska et al. "General Optimization Framework for Recurrent Reachability Objectives." International Joint Conference on Artificial Intelligence, 2022.](https://mlanthology.org/ijcai/2022/klaska2022ijcai-general/) doi:10.24963/IJCAI.2022/644

BibTeX

@inproceedings{klaska2022ijcai-general,
  title     = {{General Optimization Framework for Recurrent Reachability Objectives}},
  author    = {Klaska, David and Kucera, Antonín and Musil, Vít and Rehák, Vojtech},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2022},
  pages     = {4642-4648},
  doi       = {10.24963/IJCAI.2022/644},
  url       = {https://mlanthology.org/ijcai/2022/klaska2022ijcai-general/}
}