General Optimization Framework for Recurrent Reachability Objectives

David Klaska; Antonin Kucera; Vit Musil; Vojtech Rehak

IJCAI 2022poster0 citations

General Optimization Framework for Recurrent Reachability Objectives

David Klaska, Antonin Kucera, Vit Musil, Vojtech Rehak

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.

Planning and Scheduling: Robot PlanningAgent-based and Multi-agent Systems: Algorithmic Game TheoryAgent-based and Multi-agent Systems: Mechanism DesignPlanning and Scheduling: Planning AlgorithmsPlanning and Scheduling: Theoretical Foundations of Planning

BibTeX

@inproceedings{ijcai2022p644,
  title     = {General Optimization Framework for Recurrent Reachability Objectives},
  author    = {Klaska, David and Kucera, Antonin and Musil, Vit and Rehak, Vojtech},
  booktitle = {Proceedings of the Thirty-First International Joint Conference on
               Artificial Intelligence, {IJCAI-22}},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},
  editor    = {Lud De Raedt},
  pages     = {4642--4648},
  year      = {2022},
  month     = {7},
  note      = {Main Track},
  doi       = {10.24963/ijcai.2022/644},
  url       = {https://doi.org/10.24963/ijcai.2022/644},
}