Zobrazeno 1 - 10
of 99
pro vyhledávání: '"Ratschan, Stefan"'
This paper introduces a new approach to solving a continuous-time version of the multi-agent path finding problem. The algorithm translates the problem into an extension of the classical Boolean satisfiability problem, satisfiability modulo theories
Externí odkaz:
http://arxiv.org/abs/2312.08051
Autor:
Ratschan, Stefan
The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about
Externí odkaz:
http://arxiv.org/abs/2306.16505
Autor:
Lipparini, Enrico, Ratschan, Stefan
For typical first-order logical theories, satisfying assignments have a straightforward finite representation that can directly serve as a certificate that a given assignment satisfies the given formula. For non-linear real arithmetic with transcende
Externí odkaz:
http://arxiv.org/abs/2303.16582
Autor:
Fejlek, Jiří, Ratschan, Stefan
This paper introduces an extension of the LQR-tree algorithm, which is a feedback-motion-planning algorithm for stabilizing a system of ordinary differential equations from a bounded set of initial conditions to a goal. The constructed policies are r
Externí odkaz:
http://arxiv.org/abs/2303.00553
Autor:
Kolárik, Tomáš, Ratschan, Stefan
Railway scheduling is a problem that exhibits both non-trivial discrete and continuous behavior. In this paper, we simulate train networks at a low level, where a number of timing and ordering constraints can appear. We model this problem using a com
Externí odkaz:
http://arxiv.org/abs/2212.05382
Autor:
Fejlek, Jiří, Ratschan, Stefan
Publikováno v:
In European Journal of Control November 2024 80 Part B
Autor:
Fejlek, Jiří, Ratschan, Stefan
In this paper, we present an~algorithm that computes funnels along trajectories of systems of ordinary differential equations. A funnel is a time-varying set of states containing the given trajectory, for which the evolution from within the set at an
Externí odkaz:
http://arxiv.org/abs/2109.11420
Autor:
Dang, Thao, Ratschan, Stefan
Publikováno v:
EPTCS 331, 2021
The proceedings of the 6th International Workshop on Symbolic-Numeric Methods for Reasoning about CPS and IoT (SNR 2020) contains papers underlying talks presented at the workshop. SNR focuses on the combination of symbolic and numeric methods for re
Externí odkaz:
http://arxiv.org/abs/2101.05256
Autor:
Fejlek, Jiří, Ratschan, Stefan
A common approach in robotics is to learn tasks by generalizing from special cases given by a so-called demonstrator. In this paper, we apply this paradigm and present an algorithm that uses a demonstrator (typically given by a trajectory optimizer)
Externí odkaz:
http://arxiv.org/abs/2011.12639
Autor:
Ratschan, Stefan
In this paper, we present an algorithm for synthesizing certificates---so-called barrier certificates---for safety of hybrid dynamical systems. Unlike the usual approach of using constraint solvers to compute the certificate from the system dynamics,
Externí odkaz:
http://arxiv.org/abs/1707.00879