A paper about recurrent reachability objectives accepted to IJCAI 2022

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 variance 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.

25 Apr 2022 Antonín Kučera

No description

Title: General Optimization Framework for Recurrent Reachability Objectives
Authors: David Klaška, Antonín Kučera, Vít Musil, Vojtěch Řehák

More articles

All articles

You are running an old browser version. We recommend updating your browser to its latest version.

More info