arXiv subjects

Ricardo G. Sanfelice

Publications and source records attributed to Ricardo G. Sanfelice.

At least 19 recordsLinked to original sources

arXiv2026

Geometric Hybrid Dynamical Systems: Part I - Modeling and Stability

We present a framework for the modeling and analysis of geometric hybrid dynamical systems as hybrid inclusions on $C^1$-manifolds. Using tools from nonsmooth and set-valued analysis on manifolds, we derive coordinate-independent sufficient conditions for the existence of nontrivial solutions to this type of systems. We present geometric notions of uniform stability and attractivity of compact sets, and establish their equivalence to metric-based stability notions when the manifold is endowed with a Riemannian structure. We also introduce nonsmooth Lyapunov functions and a hybrid Lyapunov theorem providing sufficient conditions for uniform global asymptotic stability of compact sets. Finally, by characterizing $ω$-limit sets of precompact solutions, we derive a hybrid invariance principle for geometric hybrid dynamical systems. The results are demonstrated through several running examples.

math.DS↗

arXiv2026

Model Predictive Control of Hybrid Dynamical Systems

The problem of controlling hybrid dynamical systems using model predictive control (MPC) is formulated and sufficient conditions for asymptotic stability of a set are provided. Hybrid dynamical systems are modeled in terms of hybrid equations, involving a differential equation and a difference equation with inputs and constraints. The proposed hybrid MPC algorithm uses a suitable prediction and control horizon construction inspired by hybrid time domains. Structural properties of the hybrid optimization problem, its feasible set, and its value function are provided. Checkable conditions to guarantee asymptotic stability of a set are provided. These conditions are given in terms of properties on the stage cost, terminal cost, and the existence of static state-feedback laws, related through a control Lyapunov function condition. Examples illustrate the results throughout the paper.

math.OC↗

arXiv2026

Weighted Flow Matching and Physics-Informed Nonlinear Filtering for Parameter Estimation in Digital Twins

Digital twins (DTs) rely on continuous synchronization between physical systems and their virtual counterparts through online parameter estimation under uncertainty. In many practical settings, however, this task is challenged by low observability, weak excitation, nonlinear dynamics, and noisy or biased measurements. In this work, we develop a new mathematical framework that integrates Weighted Flow Matching (WFM) generative modeling with physics-informed nonlinear filtering to enhance parameter estimation in DTs. WFM relies on dynamic reweighting of training samples, which guides the generative model toward parameter regimes most informative of the evolving system state. This generative component is tightly coupled with a physics-informed filtering architecture based on the Unscented Kalman Filter (UKF), yielding a unified DT framework that combines data-driven probability transport with physically consistent state and parameter estimation. The effectiveness of the new integrated framework is demonstrated within a spacecraft DT architecture, where stable moment of inertia estimation is achieved under uncertain and noisy sensing, with significant performance improvements over established approaches such as Extended Kalman Filtering (EKF) and Ensemble Kalman Filtering (EnKF). These results highlight the potential of weighted generative modeling as a core mechanism for real-time DT synchronization in operational and mission-critical systems.

cs.CE↗

arXiv2026

Distributed Nonconvex Optimization with Exponential Convergence Rate via Hybrid Systems Methods

We present a hybrid systems framework for distributed multi-agent optimization in which agents execute computations in continuous time and communicate in discrete time. The optimization algorithm is analogous to a continuous-time form of parallelized coordinate descent. Agents implement an update-and-hold strategy in which gradients are computed at communication times and held constant during flows between communications. The completeness of solutions under these hybrid dynamics is established. Then, we prove that this system is globally exponentially stable to a minimizer of a possibly nonconvex, smooth objective function that satisfies the Polyak-Lojasiewicz (PL) condition. Simulation results are presented for three different applications and illustrate the convergence rates and the impact of initial conditions upon convergence.

math.OC↗

arXiv2026

Robust Hybrid Finite-Time Parameter Estimation Without Persistence of Excitation

In this paper, we consider the problem of estimating parameters of a linear regression model. Using a hybrid systems framework, a hybrid algorithm is proposed allowing the estimate to converge to the exact value of the unknown parameters in predetermined finite time. Interestingly, we show that for the case of constant parameters, the convergence property of the hybrid algorithm holds while only requiring the regressor to be exciting on a given interval. For the case of piecewise constant parameters, the classical persistency of excitation condition is required to guarantee the convergence. Robustness of the proposed algorithm with respect to measurements noise is analysed. Finally, illustrative examples are provided showing the merits of the proposed approach in terms of scalability and the applicability for the general class of time-varying unknown parameters

eess.SY↗

arXiv2026

Autonomous Satellite Rendezvous via Hybrid Feedback Optimization

As satellites have proliferated, interest has increased in autonomous rendezvous, proximity operations, and docking (ARPOD). A fundamental challenge in these tasks is the uncertainties when operating in space, e.g., in measurements of satellites' states, which can make future states difficult to predict. Another challenge is that satellites' onboard processors are typically much slower than their terrestrial counterparts. Therefore, to address these challenges we propose to solve an ARPOD problem with feedback optimization, which computes inputs to a system by measuring its outputs, feeding them into an optimization algorithm in the loop, and computing some number of iterations towards an optimal input. We focus on satellite rendezvous, and satellites' dynamics are modeled using the continuous-time Clohessy-Wiltshire equations, which are marginally stable. We develop an asymptotically stabilizing controller for them, and we use discrete-time gradient descent in the loop to compute inputs to them. Then, we analyze the hybrid feedback optimization system formed by the stabilized Clohessy-Wiltshire equations with gradient descent in the loop. We show that this model is well-posed and that maximal solutions are both complete and non-Zeno. Then, we show that solutions converge exponentially fast to a ball around a rendezvous point, and we bound the radius of that ball in terms of system parameters. Simulations show that this approach provides up to a 98.4\% reduction in the magnitude of disturbances across a range of simulations, which illustrates the viability of hybrid feedback optimization for autonomous satellite rendezvous.

eess.SY↗

arXiv2025

Two-Player Zero-Sum Hybrid Games

In this paper, we formulate a two-player zero-sum game under dynamic constraints defined by hybrid dynamical equations. The game consists of a min-max problem involving a cost functional that depends on the actions and resulting solutions to the hybrid system, defined as functions of hybrid time and, hence, can flow or jump. A terminal set conveniently defined allows to recast both finite and infinite horizon problems. We present sufficient conditions given in terms of Hamilton-Jacobi-Bellman-Isaacs-like equations to guarantee to attain a solution to the game. It is shown that when the players select the optimal strategy, the value function can be evaluated without computing solutions to the hybrid system. Under additional conditions, we show that the optimal state-feedback laws render a set of interest asymptotically stable for the resulting hybrid closed-loop system. Applications of these games, presented here as robust control problems, include disturbance rejection and security problems.

math.OC↗

arXiv2025

HyRRT-Connect: Bidirectional Motion Planning for Hybrid Dynamical Systems

This paper proposes a bidirectional rapidly-exploring random trees (RRT) algorithm to solve the motion planning problem for hybrid systems. The proposed algorithm, called HyRRT-Connect, propagates in both forward and backward directions in hybrid time until an overlap between the forward and backward propagation results is detected. Then, HyRRT-Connect constructs a motion plan through the reversal and concatenation of functions defined on hybrid time domains, ensuring that the motion plan satisfies the given hybrid dynamics. To address the potential discontinuity along the flow caused by tolerating some distance between the forward and backward partial motion plans, we reconstruct the backward partial motion plan by a forward-in-hybrid-time simulation from the final state of the forward partial motion plan. effectively eliminating the discontinuity. The proposed algorithm is applied to an actuated bouncing ball system and a walking robot example to highlight its computational improvement.

cs.RO↗

arXiv2025

Control Barrier Function based Attack-Recovery with Provable Guarantees

This paper studies provable security guarantees for cyber-physical systems (CPS) under actuator attacks. In particular, we consider CPS safety and propose a new attack detection mechanism based on zeroing control barrier function (ZCBF) conditions. In addition, we design an adaptive recovery mechanism based on how close the system is to violating safety. We show that under certain conditions, the attack-detection mechanism is sound, i.e., there are no false negatives for adversarial attacks. We propose sufficient conditions for the initial conditions and input constraints so that the resulting CPS is secure by design. We also propose a novel hybrid control to account for attack detection delays and avoid Zeno behavior. Next, to efficiently compute the set of initial conditions, we propose a sampling-based method to verify whether a set is a viability domain. Specifically, we devise a method for checking a modified barrier function condition on a finite set of points to assess whether a set can be rendered forward invariant. Then, we propose an iterative algorithm to compute the set of initial conditions and input constraints set to limit the effect of an adversary if it compromises vulnerable inputs. Finally, we use a Quadratic Programming (QP) approach for online recovery (as well as nominal) control synthesis. We demonstrate the effectiveness of the proposed method in a simulation case study involving a quadrotor with an attack on its motors.

eess.SY↗

arXiv2025

A Safe Hybrid Control Framework for Car-like Robot with Guaranteed Global Path-Invariance using a Control Barrier Function

This work proposes a hybrid framework for car-like robots with obstacle avoidance, global convergence, and safety, where safety is interpreted as path invariance, namely, once the robot converges to the path, it never leaves the path. Given a priori obstacle-free feasible path where obstacles can be around the path, the task is to avoid obstacles while reaching the path and then staying on the path without leaving it. The problem is solved in two stages. Firstly, we define a ``tight'' obstacle-free neighborhood along the path and design a local controller to ensure convergence to the path and path invariance. The control barrier function technology is involved in the control design to steer the system away from its singularity points, where the local path invariant controller is not defined. Secondly, we design a hybrid control framework that integrates this local path-invariant controller with any global tracking controller from the existing literature without path invariance guarantee, ensuring convergence from any position to the desired path, namely, global convergence. This framework guarantees path invariance and robustness to sensor noise. Detailed simulation results affirm the effectiveness of the proposed scheme.

cs.RO↗

arXiv2024

Motion Planning for Hybrid Dynamical Systems: Framework, Algorithm Template, and a Sampling-based Approach

This paper focuses on the motion planning problem for the systems exhibiting both continuous and discrete behaviors, which we refer to as hybrid dynamical systems. Firstly, the motion planning problem for hybrid systems is formulated using the hybrid equation framework, which is general to capture most hybrid systems. Secondly, a propagation algorithm template is proposed that describes a general framework to solve the motion planning problem for hybrid systems. Thirdly, a rapidly-exploring random trees (RRT) implementation of the proposed algorithm template is designed to solve the motion planning problem for hybrid systems. At each iteration, the proposed algorithm, called HyRRT, randomly picks a state sample and extends the search tree by flow or jump, which is also chosen randomly when both regimes are possible. Through a definition of concatenation of functions defined on hybrid time domains, we show that HyRRT is probabilistically complete, namely, the probability of failing to find a motion plan approaches zero as the number of iterations of the algorithm increases. This property is guaranteed under mild conditions on the data defining the motion plan, which include a relaxation of the usual positive clearance assumption imposed in the literature of classical systems. The motion plan is computed through the solution of two optimization problems, one associated with the flow and the other with the jumps of the system. The proposed algorithm is applied to an actuated bouncing ball system and a walking robot system so as to highlight its generality and computational features.

cs.RO↗

arXiv2024

HyRRT-Connect: A Bidirectional Rapidly-Exploring Random Trees Motion Planning Algorithm for Hybrid Systems

This paper proposes a bidirectional rapidly-exploring random trees (RRT) algorithm to solve the motion planning problem for hybrid systems. The proposed algorithm, called HyRRT-Connect, propagates in both forward and backward directions in hybrid time until an overlap between the forward and backward propagation results is detected. Then, HyRRT-Connect constructs a motion plan through the reversal and concatenation of functions defined on hybrid time domains, ensuring the motion plan thoroughly satisfies the given hybrid dynamics. To address the potential discontinuity along the flow caused by tolerating some distance between the forward and backward partial motion plans, we reconstruct the backward partial motion plan by a forward-in-hybrid-time simulation from the final state of the forward partial motion plan. By applying the reversed input of the backward partial motion plan, the reconstruction process effectively eliminates the discontinuity and ensures that as the tolerance distance decreases to zero, the distance between the endpoint of the reconstructed motion plan and the final state set approaches zero. The proposed algorithm is applied to an actuated bouncing ball example and a walking robot example so as to highlight its generality and computational improvement.

cs.RO↗

arXiv2023

Notions, Stability, Existence, and Robustness of Limit Cycles in Hybrid Dynamical Systems

This paper deals with existence and robust stability of hybrid limit cycles for a class of hybrid systems given by the combination of continuous dynamics on a flow set and discrete dynamics on a jump set. For this purpose, the notion of Zhukovskii stability, typically stated for continuous-time systems, is extended to the hybrid systems. Necessary conditions, particularly, a condition using a forward invariance notion, for existence of hybrid limit cycles are first presented. In addition, a sufficient condition, related to Zhukovskii stability, for the existence of (or lack of) hybrid limit cycles is established. Furthermore, under mild assumptions, we show that asymptotic stability of such hybrid limit cycles is not only equivalent to asymptotic stability of a fixed point of the associated Poincaré map but also robust to perturbations. Specifically, robustness to generic perturbations, which capture state noise and unmodeled dynamics, and to inflations of the flow and jump sets are established in terms of $\mathcal{KL}$ bounds. Furthermore, results establishing relationships between the properties of a computed Poincaré map, which is necessarily affected by computational error, and the actual asymptotic stability properties of a hybrid limit cycle are proposed. In particular, it is shown that asymptotic stability of the exact Poincaré map is preserved when computed with enough precision. Several examples, including a congestion control system and spiking neurons, are presented to illustrate the notions and results throughout the paper.

eess.SY↗

arXiv2023

Uniting Nesterov and Heavy Ball Methods for Uniform Global Asymptotic Stability of the Set of Minimizers

We propose a hybrid control algorithm that guarantees fast convergence and uniform global asymptotic stability of the unique minimizer of a continuously differentiable, convex objective function. The algorithm, developed using hybrid system tools, employs a uniting control strategy, in which Nesterov's accelerated gradient descent is used "globally" and the heavy ball method is used "locally," relative to the minimizer. Without knowledge of its location, the proposed hybrid control strategy switches between these accelerated methods to ensure convergence to the minimizer without oscillations, with a (hybrid) convergence rate that preserves the convergence rates of the individual optimization algorithms. We analyze key properties of the resulting closed-loop system including existence of solutions, uniform global asymptotic stability, and convergence rate. Additionally, stability properties of Nesterov's method are analyzed, and extensions on convergence rate results in the existing literature are presented. Numerical results validate the findings and demonstrate the robustness of the uniting algorithm.

math.OC↗

arXiv2023

Robust Parameter Estimation for Hybrid Dynamical Systems

We consider the problem of estimating a vector of unknown constant parameters for a class of hybrid dynamical systems -- that is, systems whose state variables exhibit both continuous (flow) and discrete (jump) evolution. Using a hybrid systems framework, we propose a hybrid estimation algorithm that can operate during both flows and jumps that, under a notion of hybrid persistence of excitation, guarantees convergence of the parameter estimate to the true value. Furthermore, we show that the parameter estimate is input-to-state stable with respect to a class of hybrid disturbances. Simulation results including a spacecraft application show the merits of our proposed approach.

math.OC↗

arXiv2023

HySST: A Stable Sparse Rapidly-Exploring Random Trees Optimal Motion Planning Algorithm for Hybrid Dynamical Systems

This paper proposes a stable sparse rapidly-exploring random trees (SST) algorithm to solve the optimal motion planning problem for hybrid systems. At each iteration, the proposed algorithm, called HySST, selects a vertex with the lowest cost among all the vertices within the neighborhood of a randomly selected sample and then extends the search tree by flow or jump, which is also chosen randomly when both regimes are possible. In addition, HySST maintains a static set of witness points such that all the vertices within the neighborhood of each witness are pruned except the vertex with the lowest cost. Through a definition of concatenation of functions defined on hybrid time domains, we show that HySST is asymptotically near optimal, namely, the probability of failing to find a motion plan such that its cost is close to the optimal cost approaches zero as the number of iterations of the algorithm increases to infinity. This property is guaranteed under mild conditions on the data defining the motion plan, which include a relaxation of the usual positive clearance assumption imposed in the literature of classical systems. The proposed algorithm is applied to an actuated bouncing ball system and a collision-resilient tensegrity multicopter system so as to highlight its generality and computational features.

cs.RO↗

arXiv2023

Convergence of Nonlinear Observers on R^n with a Riemannian Metric (Part III)

This paper is the third and final component of a three-part effort on observers contracting a Riemannian distance between the state of the system and its estimate. In Part I, we showed that such a contraction property holds if the system dynamics and the Riemannian metric satisfy two key conditions: a differential detectability property and a geodesic monotonicity property. With the former condition being the focus of Part II, in this Part III, we study the latter condition in relationship to the nullity of the second fundamental form of the output function. We formulate sufficient and necessary conditions for it to hold. We establish a link between it and the infinite gain margin property, and we provide a systematic way for constructing a metric satisfying this condition. Finally, we illustrate cases where both conditions hold and propose ways to facilitate the satisfaction of these two conditions together.

eess.SY↗

arXiv2023

An Observer-based Switching Algorithm for Safety under Sensor Denial-of-Service Attacks

The design of safe-critical control algorithms for systems under Denial-of-Service (DoS) attacks on the system output is studied in this work. We aim to address scenarios where attack-mitigation approaches are not feasible, and the system needs to maintain safety under adversarial attacks. We propose an attack-recovery strategy by designing a switching observer and characterizing bounds in the error of a state estimation scheme by specifying tolerable limits on the time length of attacks. Then, we propose a switching control algorithm that renders forward invariant a set for the observer. Thus, by satisfying the error bounds of the state estimation, we guarantee that the safe set is rendered conditionally invariant with respect to a set of initial conditions. A numerical example illustrates the efficacy of the approach.

eess.SY↗