activity
20162023
most citedJuliaReach: a Toolbox for Set-Based Reachability

97 citations · 198 across the 9 of their papers we have counts for

collaborators

9 papers

cs.MA2023★ 1 cited

Online Reachability Analysis and Space Convexification for Autonomous Racing

Sergiy Bogomolov, Taylor T. Johnson, Diego Manzanas Lopez +2

This paper presents an optimisation-based approach for an obstacle avoidance problem within an autonomous vehicle racing context. Our control regime leverages online reachability a…

eess.SY2021★ 6 cited

Reachability of Black-Box Nonlinear Systems after Koopman Operator Linearization

Stanley Bak, Sergiy Bogomolov, Parasara Sridhar Duggirala +2

Reachability analysis of nonlinear dynamical systems is a challenging and computationally expensive task. Computing the reachable states for linear systems, in contrast, can often…

eess.SY2019★ 11 cited

Reachability analysis of linear hybrid systems via block decomposition

Sergiy Bogomolov, Marcelo Forets, Goran Frehse +2

Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Re…

eess.SY2019★ 97 cited

JuliaReach: a Toolbox for Set-Based Reachability

Sergiy Bogomolov, Marcelo Forets, Goran Frehse +2

We present JuliaReach, a toolbox for set-based reachability analysis of dynamical systems. JuliaReach consists of two main packages: Reachability, containing implementations of rea…

eess.SY2018★ 62 cited

Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices

Sergiy Bogomolov, Marcelo Forets, Goran Frehse +3

Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the…

eess.SY2017

Proceedings 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis

Erika Ábrahám, Sergiy Bogomolov

Hybrid systems are complex dynamical systems that combine discrete and continuous components. Reachability questions, regarding whether a system can run into a certain subset of it…

cs.AI2016

Instrumenting an SMT Solver to Solve Hybrid Network Reachability Problems

Daniel Bryce, Sergiy Bogomolov, Alexander Heinz +1

PDDL+ planning has its semantics rooted in hybrid automata (HA) and recent work has shown that it can be modeled as a network of HAs. Addressing the complexity of nonlinear PDDL+ p…

cs.DC2016★ 20 cited

Parallel Reachability Analysis for Hybrid Systems

Amit Gurung, Arup Deka, Ezio Bartocci +3

We propose two parallel state-space exploration algorithms for hybrid systems with the goal of enhancing performance on multi-core shared memory systems. The first is an adaption o…

math.OC2016★ 1 cited

Invariant Clusters for Hybrid Systems

Hui Kong, Sergiy Bogomolov, Christian Schilling +2

In this paper, we propose an approach to automatically compute invariant clusters for semialgebraic hybrid systems. An invariant cluster for an ordinary differential equation (ODE)…