Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1306.3680

Optimum Weight Selection Based LQR Formulation for the Design of Fractional Order PIλDμ Controllers to Handle a Class of Fractional Order Systems

Saptarshi Das·Indranil Pan·Kaushik Halder·Shantanu Das·Amitava Gupta
View original source ↗Read source document ↗Export metadata ↓

Abstract

A weighted summation of Integral of Time Multiplied Absolute Error (ITAE) and Integral of Squared Controller Output (ISCO) minimization based time domain optimal tuning of fractional-order (FO) PID or PIλDμ controller is proposed in this paper with a Linear Quadratic Regulator (LQR) based technique that minimizes the change in trajectories of the state variables and the control signal. A class of fractional order systems having single non-integer order element which show highly sluggish and oscillatory open loop responses have been tuned with an LQR based FOPID controller. The proposed controller design methodology is compared with the existing time domain optimal tuning techniques with respect to change in the trajectory of state variables, tracking performance for change in set-point, magnitude of control signal and also the capability of load disturbance suppression. A real coded genetic algorithm (GA) has been used for the optimal choice of weighting matrices while designing the quadratic regulator by minimizing the time domain integral performance index. Credible simulation studies have been presented to justify the proposition.

Explore related subjects

math.OCcs.SYeess.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saptarshi Das, Indranil Pan, Kaushik Halder, Shantanu Das, Amitava Gupta. 2013-06-16. Optimum Weight Selection Based LQR Formulation for the Design of Fractional Order PIλDμ Controllers to Handle a Class of Fractional Order Systems. https://doi.org/10.1109/iccci.2013.6466137

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

KEEP EXPLORING

Related papers

arXiv2026

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC↗
arXiv2026

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC↗
arXiv2026

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC↗