KaydedilenlerDerginizi ekleyin

Dergiler / Istanbul University Journal of Electrical and Electronics Engineering / 2006 / Cilt: 6 - Sayı: 1

Fast calculation of all stabilizing gains for discrete-time systems

Nevra BAYHAN
Mehmet Turan SÖYLEMEZ
Sayfa
19–26
Yayın Tarihi
2022-10-18
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

The second method demonstrates the use of Chebyshev Polynomials in the solution of the problem.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:In this paper, two methods for calculating all stabilizing gains for discrete-time systems are given.
📊
Temel Bulgular & Veri:The first method focuses on converting the problem using a bilinear transformation and then applying a previously developed theorem for continuous time systems.
💡
Sonuç & Katkı:The second method demonstrates the use of Chebyshev Polynomials in the solution of the problem.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri

Abstract

In this paper, two methods for calculating all stabilizing gains for discrete-time systems are given. The first method focuses on converting the problem using a bilinear transformation and then applying a previously developed theorem for continuous time systems. Unlike previous results, the method introduced here does not use the Generalised Hermite-Biehler Theorem and therefore provides a computational advantage. The second method demonstrates the use of Chebyshev Polynomials in the solution of the problem.

🔖

Bu Makaleye Atıf Yap

BAYHAN, N., SÖYLEMEZ, M. T. (2022). Fast calculation of all stabilizing gains for discrete-time systems. Istanbul University Journal of Electrical and Electronics Engineering, Cilt: 6 - Sayı: 1, 19–26. https://ajindex.com/articles/543801

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (10)

  1. Ackermann, J., Kaesbauer, D., Bajcinca, N., “Discrete-Time Robust PID And Three Term Control”, XV IFAC World Congress, Barcelona, 2002
  2. Datta, A., Ho, M.T., Bhattacharyya S.P., Structure and Synthesis of PID Controllers, Springer, London, UK, 2000
  3. Ho, M.T., Datta, A., Bhattacharyya S.P., “ A Linear Programming Characterization Of All Stabilizing PID Controllers”, Proceedings of the Amer. Contr. Conf., pp. 3922-3928, 1997
  4. Keel, L., Bhattacharyya S.P., “Root Counting and Phase Unwrapping With Respect To The Unit circle with applications”, Proc of the 40th IEEE Conf. on Decision and Control, Orlando, Florida USA, pp. 3459-3464, 2001
  5. Keel, L., Bhattacharyya S.P., “Root Counting and Phase Unwrapping Stability And Stabilization Of Discrete Time Systems”, Linear Algebra And Its Applications, Vol. 351, No. 352, pp. 501-517, 2002
  6. Munro, N., Söylemez, M.T., Baki, H., “Computation Of D-Stabilizing Low-Order Compensators”, Control Systems Centre Report, 882, UMIST Manchester, 1999
  7. Munro, N., Söylemez, M.T.,“Fast Calculation Of Stabilizing PID Controllers For Uncertain Parameter Systems”, IFAC ROCOND, Prague, Czech Republic, 2000
  8. Söylemez, M.T., Munro, N., Baki, H., “Fast Calculation Of Stabilizing PID Controllers”, Automatica, Vol: 39, No: 1, pp. 121-126, 2003
  9. Xu, H., Datta, A., Bhattacharyya S.P., “Computation Of All Stabilizing PID Gains For Digital Control Systems”, IEEE Transactions On Automatic Control. Vol: 46 No: 4, pp. 647-652, 2001
  10. Fox, L., Parker, I.B., Chebyshev Polynomials in Numerical Analysis, Oxford University Press, London, 21-64, 1968.