skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Invariance-like Results for Nonautonomous Switched Systems
This paper generalizes the LaSalle–Yoshizawa Theorem to switched nonsmooth systems. The Filippov and Krasovskii regularizations of a switched system are shown to be contained within the convex hull of the Filippov and Krasovskii regularizations of the subsystems, respectively. A common candidate Lyapunov function that has a negative semidefinite generalized time derivative along the trajectories of the subsystems is shown to be sufficient to establish LaSalle–Yoshizawa-like results for the switched system. Of independent interest, are the results on approximate continuity and Filippov regularization of set-valued maps, reduction of differential inclusions using Lipschitz continuous regular functions, and comparative remarks on different generalizations of the time derivative along the trajectories of a nonsmooth system.  more » « less
Award ID(s):
1762829
PAR ID:
10088849
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
IEEE Transactions on Automatic Control
Volume:
64
Issue:
2
ISSN:
0018-9286
Page Range / eLocation ID:
614-627
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract This paper concerns first-order approximation of the piecewise-differentiable flow generated by a class of nonsmooth vector fields. Specifically, we represent and compute the Bouligand (or B-)derivative of the piecewise-differentiable flow generated by a vector field with event-selected discontinuities. Our results are remarkably efficient: although there are factorially many “pieces” of the derivative, we provide an algorithm that evaluates its action on a tangent vector using polynomial time and space, and verify the algorithm's correctness by deriving a representation for the B-derivative that requires “only” exponential time and space to construct. We apply our methods in two classes of illustrative examples: piecewise-constant vector fields and mechanical systems subject to unilateral constraints. 
    more » « less
  2. Kilgour, D_M; Kunze, H; Makarov, R_N; Melnik, R; Wang, X (Ed.)
    This article focuses on sensitivity and control theory for linear complementarity systems (LCSs), a type of dynamical system that experiences hybrid continuous/discrete behavior and is therefore nonsmooth. In particular, a sensitivity theory is given that characterizes generalized derivative information of solutions of LCSs with respect to parametric perturbations. With this theory in hand, a computationally-relevant open-loop optimal control theory is provided using a direct method (i.e., the control is parametrically discretized and generalized gradients of the objective function are described). The approach here is based on lexicographic directional differentiation theory, a relatively new tool in nonsmooth analysis, being applied to nonlinear complementarity systems (NCSs). The optimal control theory is illustrated with an example. As a byproduct of the sensitivity theory, well-posedness results for a new class of hybrid dynamical system, called the lexicographic linear complementarity system (LexLCS), are also established. 
    more » « less
  3. This paper considers the problem of error in variables identification for switched affine models. Since it is well known that this problem is generically NP hard, several relaxations have been proposed in the literature. However, while these approaches work well for low dimensional systems with few subsystems, they scale poorly with both the number of subsystems and their memory. To address this difficulty, we propose a computationally efficient alternative, based on embedding the data in the manifold of positive semidefinite matrices, and using a manifold metric there to perform the identification. Our main result shows that, under dwell-time assumptions, the proposed algorithm is convergent, in the sense that it is guaranteed to identify the system for suitably low noise. In scenarios with larger noise levels, we provide experimental results showing that the proposed method outperforms existing ones. The paper concludes by illustrating these results with academic examples and a non-trivial application: action video segmentation. 
    more » « less
  4. This paper addresses the problem of identification of error in variables switched linear models from experimental input/output data. This problem is known to be generically NP hard and thus computationally expensive to solve. To address this difficulty, several relaxations have been proposed in the past few years. While solvable in polynomial time these (convex) relaxations tend to scale poorly with the number of points and number/order of the subsystems, effectively limiting their applicability to scenarios with relatively small number of data points. To address this difficulty, in this paper we propose an efficient method that only requires performing (number of subsystems) singular value decompositions of matrices whose size is independent of the number of points. The underlying idea is to obtain a sum-of-squares polynomial approximation of the support of each subsystem one-at-a-time, and use these polynomials to segment the data into sets, each generated by a single subsystem. As shown in the paper, exploiting ideas from Christoffel's functions allows for finding these polynomial approximations simply by performing SVDs. The parameters of each subsystem can then be identified from the segmented data using existing error-in-variables (EIV) techniques. 
    more » « less
  5. A modified form of Legendre-Gauss orthogonal direct collocation is developed for solving optimal control problems whose solutions are nonsmooth due to control discon- tinuities. This new method adds switch time variables, control variables, and collocation conditions at both endpoints of a mesh interval, whereas these new variables and collocation con- ditions are not included in standard Legendre-Gauss orthogonal collocation. The modified Legendre-Gauss collocation method alters the search space of the resulting nonlinear programming problem and optimizes the switch point of the control solution. The transformed adjoint system of the modified Legendre- Gauss collocation method is then derived and shown to satisfy the necessary conditions for optimality. Finally, an example is provided where the optimal control is bang-bang and contains multiple switches. This method is shown to be capable of solving complex optimal control problems with nonsmooth solutions. 
    more » « less