To explore or not to explore: Regret-based LTL planning in partially-known environments
In this paper, we investigate the optimal robot path planning problem for high-level
specifications described by co-safe linear temporal logic (LTL) formulae. We consider the …
specifications described by co-safe linear temporal logic (LTL) formulae. We consider the …
Determinization of Integral Discounted-Sum Automata is Decidable
S Almagor, N Dafni - International Conference on Foundations of Software …, 2024 - Springer
Abstract Nondeterministic Discounted-Sum Automata (NDAs) are nondeterministic finite
automata equipped with a discounting factor λ> 1, and whose transitions are labelled by …
automata equipped with a discounting factor λ> 1, and whose transitions are labelled by …