Informace o publikaci

General Optimization Framework for Recurrent Reachability Objectives

Logo poskytovatele
Logo poskytovatele
Autoři

KLAŠKA David KUČERA Antonín MUSIL Vít ŘEHÁK Vojtěch

Rok publikování 2022
Druh Článek ve sborníku
Konference Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www Paper URL
Doi http://dx.doi.org/10.24963/ijcai.2022/644
Klíčová slova recurrent reachability objectives; strategy synthesis
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info