Smart abstraction based on iterative cover and non-uniform cells

Abstract

We propose a multi-scale approach for computing abstractions of dynamical systems, that incorporates both local and global optimal control to construct a goal-specific abstraction. For a local optimal control problem, we not only design the controller ensuring the transition between every two subsets (cells) of the state space but also incorporate the volume and shape of these cells into the optimization process. This integrated approach enables the design of non-uniform cells, effectively reducing the complexity of the abstraction. These local optimal controllers are then combined into a digraph, which is globally optimized to obtain the entire trajectory. The global optimizer attempts to lazily build the abstraction along the optimal trajectory, which is less affected by an increase in the number of dimensions. Since the optimal trajectory is generally unknown in practice, we propose a methodology based on the RRT* algorithm to determine it incrementally. Finally, we provide a tractable implementation of this algorithm for the optimal control of L-smooth nonlinear dynamical systems.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…