Constrained Parameter Update Law for Adaptive Control

Ashwin P. Dani

Home/Archive/arXiv

arXiv · 2504.19412

Constrained Parameter Update Law for Adaptive Control

Ashwin P. Dani

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, constrained parameter update laws for adaptive control are developed using barrier constraints. An interpretation of the parameter update law from a constrained optimization problem, in which a regularized Barrier saddle function is formulated to incorporate parameter constraints using inverse and logarithmic barrier functions from interior-point methods. The resulting constrained update law is integrated with an adaptive trajectory tracking controller, enabling online learning of the unknown system model parameters. Forward invariance of the parameter estimate is established and Lyapunov stability of the closed-loop system with the constrained parameter update law is derived. The effectiveness of the proposed constrained adaptive control law is demonstrated through simulations, which validate its ability to maintain parameter estimates within prescribed bounds while ensuring convergence to the true parameter values and achieving steady state tracking performance.

Explore related subjects

math.OC cs.SY eess.SP eess.SY

Keep this discovery

BibTeX RIS

Ashwin P. Dani. 2026-08-27. Constrained Parameter Update Law for Adaptive Control. https://arxiv.org/abs/2504.19412

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.SY subject eess.SP subject eess.SY subject math.OC subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

arXiv2026

Enhancing Interpretability of Stochastic Programming Solutions: A Multiparametric Approach

Stochastic programming (SP) is a powerful framework for decision-making under uncertainty, but its practical adoption in industry is often hindered by the difficulty in understanding the causal relationships that drive optimal solutions. In the two-stage SP, strategic first-stage decisions are coupled with operational second-stage recourse decisions. When the number of scenarios under consideration is large, understanding the direct link between the uncertainty realization and optimal recourse strategy becomes computationally and cognitively demanding. Common approaches to improve interpretability include trained classification trees or scenario reduction, replacing the large scenario set with a representative subset. This is often achieved through post-hoc clustering (e.g., k-means) based on uncertainty realizations or optimal recourse decisions. While useful, these methods only provide a statistical approximation of the solution space and may fail to reveal the underlying structural properties of the recourse problem that drive optimal first-stage decisions. This work introduces a novel, deterministic approach to explainability using multiparametric programming (mp) within a Benders decomposition framework. We reformulate the recourse subproblem as a multiparametric linear program, generating an explicit map of Critical Regions (CRs), which are polyhedral partitions of the uncertainty space. This allows us to cluster scenarios analytically rather than statistically. We demonstrate this methodology on a supply chain planning under demand uncertainty. Our results show that 100 stochastic scenarios map to exactly six critical region clusters. This mapping allows us to explain optimal capacity planning decisions as a precise trade-off between specific operational modes, providing a fully transparent interpretation of the stochastic solution.

math.OC↗

arXiv2026

Rates of Convergence in the Central Limit Theorem for Markov Chains, with an Application to TD Learning

We prove a non-asymptotic central limit theorem for vector-valued martingale differences using Stein's method, and use Poisson's equation to extend the result to functions of Markov Chains. We then show that these results can be applied to establish a non-asymptotic central limit theorem for Temporal Difference (TD) learning with averaging.

math.PR↗

arXiv2026

Quiver Semistability and Structured Kalman Decompositions for Networked Linear Dynamical Systems

We introduce new notions of controllability and observability for networked linear time-invariant (LTI) systems based on $σ$-semistability of quiver representations. Utilizing King's criterion for $σ$-semistability, we define a network generalization of the Kalman decomposition for networked LTI systems, which systematically decomposes the local and interconnection dynamics while respecting the underlying network structure. Furthermore, we present efficient algorithms for deciding the proposed controllability and observability of a given networked LTI system and for finding the Kalman-type decomposition. We also show efficient algorithms for deciding the $σ$-semistability of representations of acyclic quivers with self-loops if the weight $σ$ has the same sign for all vertices with self-loops. Such quiver representations and weights arise from networked LTI systems.

math.OC↗