Zobrazeno 1 - 10
of 1 710
pro vyhledávání: '"So, Oswin"'
Current reinforcement-learning methods are unable to directly learn policies that solve the minimum cost reach-avoid problem to minimize cumulative costs subject to the constraints of reaching the goal and avoiding unsafe states, as the structure of
Externí odkaz:
http://arxiv.org/abs/2410.22600
Autor:
Knoedler, Luzia, So, Oswin, Yin, Ji, Black, Mitchell, Serlin, Zachary, Tsiotras, Panagiotis, Alonso-Mora, Javier, Fan, Chuchu
Control Barrier Functions (CBFs) have proven to be an effective tool for performing safe control synthesis for nonlinear systems. However, guaranteeing safety in the presence of disturbances and input constraints for high relative degree systems is a
Externí odkaz:
http://arxiv.org/abs/2410.11157
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of different
Externí odkaz:
http://arxiv.org/abs/2410.09922
Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in $GM_\mathcal{P}$ are conn
Externí odkaz:
http://arxiv.org/abs/2410.06139
This paper provides an overview, analysis, and comparison of second-order dynamic optimization algorithms, i.e., constrained Differential Dynamic Programming (DDP) and Sequential Quadratic Programming (SQP). Although a variety of these algorithms has
Externí odkaz:
http://arxiv.org/abs/2409.11649
Autor:
Aichholzer, Oswin, Obmann, Julia, Paták, Pavel, Perz, Daniel, Tkadlec, Josef, Vogtenhuber, Birgit
Two plane drawings of graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. Let $S$ be a convex point set of $2n \geq 10$ points and let $\mathcal{H}$ be a family of plane draw
Externí odkaz:
http://arxiv.org/abs/2409.03579
Autor:
So, Oswin
Autonomous robots in the real world have nonlinear dynamics with actuators that are subject to constraints. The combination of the two poses complicates the task of designing stabilizing controllers that can guarantee safety, which we denote as the s
Externí odkaz:
https://hdl.handle.net/1721.1/155344
We show that each set of $n\ge 2$ points in the plane in general position has a straight-line matching with at least $(5n+1)/27$ edges whose segments form a connected set, and such a matching can be computed in $O(n \log n)$ time. As an upper bound,
Externí odkaz:
http://arxiv.org/abs/2407.06131
We present QDarts, an efficient simulator for realistic charge stability diagrams of quantum dot array (QDA) devices in equilibrium states. It allows for pinpointing the location of concrete charge states and their transitions in a high-dimensional v
Externí odkaz:
http://arxiv.org/abs/2404.02064
Which polyominoes can be folded into a cube, using only creases along edges of the square lattice underlying the polyomino, with fold angles of $\pm 90^\circ$ and $\pm 180^\circ$, and allowing faces of the cube to be covered multiple times? Prior res
Externí odkaz:
http://arxiv.org/abs/2402.14965