Related papers: Introducing Speculation in Self-Stabilization - An…
Speculative execution is a hardware optimisation technique where a processor, while waiting on the completion of a computation required for an instruction, continues to execute later instructions based on a predicted value of the pending…
Absolute stability of discrete-time teleoperation systems can be jeopardized by choosing inappropriate sampling time architecture. A modified structure is presented for the bilateral teleoperation system including continuous-time slave…
A scheme for stabilizing stochastic approximation iterates by adaptively scaling the step sizes is proposed and analyzed. This scheme leads to the same limiting differential equation as the original scheme and therefore has the same…
This paper study the parameter selection of predefined-time sliding mode and try to design a general nonsingular predefined-time terminal sliding mode. 1). On parameter selection: Some existing predefined-time sliding modes are designed to…
Message propagation is fundamental in constructing distributed systems upon sparsely connected communication networks. For providing easy message propagation primitives, the mutual-exclusive propagation (MEP) of one-bit messages is…
A self-stabilizing protocol tolerates by definition transient faults (faults of finite duration). Recently, a new class of self-stabilizing protocols that are able to tolerate a given number of permanent faults. In this paper, we focus on…
This paper studies the emulation-based stabilization of nonlinear networked control systems with two time scales. We address the challenge of using a single communication channel for transmitting both fast and slow variables between the…
Time distributed optimization is an implementation strategy that can significantly reduce the computational burden of model predictive control by exploiting its robustness to incomplete optimization. When using this strategy, optimization…
We propose an algorithm to restrict the switching signals of a constrained switched system in order to guarantee its stability, while at the same time attempting to keep the largest possible set of allowed switching signals. Our work is…
We consider a family of conforming space-time finite element discretizations for the wave equation based on splines of maximal regularity in time. Traditional techniques may require a CFL condition to guarantee stability. Recent works by O.…
The two-step time discretization proposed by Dahlquist, Liniger and Nevanlinna is variable step $G$-stable. (In contrast, for increasing time steps, the BDF2 method loses $A$-stability and suffers non-physical energy growth in the…
We consider the Cahn-Hilliard equation with standard double-well potential. We employ a prototypical class of first order in time semi-implicit methods with implicit treatment of the linear dissipation term and explicit extrapolation of the…
We present a self-stabilizing algorithm for the (asynchronous) unison problem which achieves an efficient trade-off between time, workload, and space in a weak model. Precisely, our algorithm is defined in the atomic-state model and works…
Classical discrete-time adaptive controllers provide asymptotic stabilization. While the original adaptive controllers did not handle noise or unmodelled dynamics well, redesigned versions were proven to have some tolerance; however,…
We study the optimal portfolio liquidation problem over a finite horizon in a limit order book with bid-ask spread and temporary market price impact penalizing speedy execution trades. We use a continuous-time modeling framework, but in…
We consider the numerical behavior of the fixed-stress splitting method for coupled poromechanics as undrained regimes are approached. We explain that pressure stability is related to the splitting error of the scheme, not the fact that the…
In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…
In distributed model predictive control (DMPC), where a centralized optimization problem is solved in distributed fashion using dual decomposition, it is important to keep the number of iterations in the solution algorithm, i.e. the amount…
We consider finite element discretizations of the Biot's consolidation model in poroelasticity with MINI and stabilized P1-P1 elements. We analyze the convergence of the fully discrete model based on spatial discretization with these types…
Stochastic approximation is a framework unifying many random iterative algorithms occurring in a diverse range of applications. The stability of the process is often difficult to verify in practical applications and the process may even be…