General Optimization Framework for Recurrent Reachability Objectives

05/27/2022
by   David Klaška, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/18/2023

Quantitative Reachability Stackelberg-Pareto Synthesis is NEXPTIME-Complete

In this paper, we deepen the study of two-player Stackelberg games playe...
research
05/17/2023

Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems

We consider the problem of synthesizing resilient and stochastically sta...
research
05/08/2020

Stochastic Games with Lexicographic Reachability-Safety Objectives

We study turn-based stochastic zero-sum games with lexicographic prefere...
research
03/02/2022

Stackelberg-Pareto Synthesis (Extended Version)

We study the framework of two-player Stackelberg games played on graphs ...
research
07/21/2017

The Complexity of Concurrent Rational Synthesis

In this paper, we investigate the rational synthesis problem for concurr...
research
10/22/2021

Pairwise Reachability Oracles and Preservers under Failures

In this paper, we consider reachability oracles and reachability preserv...
research
01/29/2018

Bounded Policy Synthesis for POMDPs with Safe-Reachability Objectives

Planning robust executions under uncertainty is a fundamental challenge ...

Please sign up or login with your details

Forgot password? Click here to reset