33 research outputs found

    Controllability and controller-observer design for a class of linear time-varying systems

    Get PDF
    “The final publication is available at Springer via http://dx.doi.org/10.1007/s10852-012-9212-6"In this paper a class of linear time-varying control systems is considered. The time variation consists of a scalar time-varying coefficient multiplying the state matrix of an otherwise time-invariant system. Under very weak assumptions of this coefficient, we show that the controllability can be assessed by an algebraic rank condition, Kalman canonical decomposition is possible, and we give a method for designing a linear state-feedback controller and Luenberger observer

    Time-optimal control of a third-order plant

    Get PDF

    Stabilization of First-order Systems with Time Delay

    No full text

    Modal Expansion of Structural Systems with Time Delays

    No full text

    A Comparative Approach for Time-Delay Fractional Optimal Control Problems: Discrete Versus Continuous Chebyshev Polynomials

    No full text
    This paper aims to demonstrate the superiority of the discrete Chebyshev polynomials over the classical Chebyshev polynomials for solving time-delay fractional optimal control problems (TDFOCPs). The discrete Chebyshev polynomials have been introduced and their properties are investigated thoroughly. Then, the fractional derivative of the state function in the dynamic constraint of TDFOCPs is approximated by these polynomials with unknown coefficients. The operational matrix of fractional integration together with the dynamical constraints is used to approximate the control function directly as a function of the state function. Finally, these approximations were put in the performance index and necessary conditions for optimality transform the under consideration TDFOCPs into an algabric system. A comparison has been made between the required CPU time and accuracy of the discrete and continuous Chebyshev polynomials methods. The obtained numerical results reveal that utilizing discrete Chebyshev polynomials is more efficient and less time-consuming in comparison to the continuous Chebyshev polynomials
    corecore