본문

서브메뉴

Theory, Extensions, and Applications of Recursive Least Squares
Theory, Extensions, and Applications of Recursive Least Squares
Theory, Extensions, and Applications of Recursive Least Squares

Detailed Information

자료유형  
 학위논문 서양
최종처리일시  
20260202103646
ISBN  
9798314874868
DDC  
629.1
저자명  
Lai, Brian.
서명/저자  
Theory, Extensions, and Applications of Recursive Least Squares
발행사항  
[Sl] : University of Michigan, 2025
발행사항  
Ann Arbor : ProQuest Dissertations & Theses, 2025
형태사항  
194 p
주기사항  
Source: Dissertations Abstracts International, Volume: 86-11, Section: B.
주기사항  
Advisor: Bernstein, Dennis S.
학위논문주기  
Thesis (Ph.D.)--University of Michigan, 2025.
초록/해제  
요약Recursive least squares (RLS) is a foundational algorithm in systems and control theory for the online identification of fixed parameters. However, a critical flaw of RLS is its inability to track time-varying parameters. RLS with a forgetting factor can track time-varying parameters, but is fragile without persistently exciting (PE) data. This dissertation develops theory and new extensions of RLS, to accomplish with what these classical algorithms cannot. These results are applied to online system identification for adaptive control. Following an introductory chapter, the second chapter presents three derivations of RLS. These derivations introduce important concepts used throughout this dissertation. The third chapter introduces RLS with a forgetting factor, or exponential forgetting (EF) RLS, and presents guaranteed covariance bound for EF-RLS with persistent excitation. These guaranteed bounds serve as a baseline for new algorithms presented later in this dissertation. The fourth chapter addresses efficient RLS identification of parameters in a matrix structure and reveals a tradeoff between computational complexity and algorithm generality. This result is used to dramatically speed up online identification of multi-input-multi-output (MIMO) input/output models in an adaptive control scheme. The fifth chapter studies identification of MIMO input/output models using RLS when model order is higher than system order. We show that in this scenario, data cannot be persistent excitation and address convergence without PE. The sixth and seventh chapters introduce novel extensions of RLS for situations without PE. The sixth chapter presents Subspace of Information Forgetting (SIFt) RLS, a new extension of RLS designed for scenarios when particular directions are excited and others are not. This is accomplished by forgetting in only in the subspace of information, allowing for bounded covariance without PE. The seventh chapter introduces exponential resetting and cyclic resetting RLS, two algorithms which address periods of high excitation and periods of low excitation. These algorithms prevent covariance windup experienced by EF-RLS during periods of low excitation. Finally, the eighth and ninth chapters concern the unification of RLS extensions from the literature. The eighth chapter provides an overarching framework for RLS extensions and provides sufficient conditions for stability and robustness of parameter estimation error. The ninth chapter builds on the eighth chapter to show that extensions of RLS are also special cases of the Kalman filter. This motivates a new class of adaptive Kalman filters for state estimation in the presence of unmodeled disturbances.
일반주제명  
Aerospace engineering
일반주제명  
Computer engineering
일반주제명  
Applied mathematics
키워드  
Recursive least squares
키워드  
System identification
키워드  
Recursive estimation
키워드  
Adaptive control
키워드  
Kalman filter
기타저자  
University of Michigan Aerospace Engineering
기본자료저록  
Dissertations Abstracts International. 86-11B.
전자적 위치 및 접속  
로그인 후 원문을 볼 수 있습니다.

MARC

 008260126s2025        us                              c    eng  d
■001000017358113
■00520260202103646
■006m          o    d                
■007cr#unu||||||||
■020    ▼a9798314874868
■035    ▼a(MiAaPQ)AAI32092624
■035    ▼a(MiAaPQ)umichrackham006000
■040    ▼aMiAaPQ▼cMiAaPQ
■0820  ▼a629.1
■1001  ▼aLai,  Brian.
■24510▼aTheory,  Extensions,  and  Applications  of  Recursive  Least  Squares
■260    ▼a[Sl]▼bUniversity  of  Michigan▼c2025
■260  1▼aAnn  Arbor▼bProQuest  Dissertations  &  Theses▼c2025
■300    ▼a194  p
■500    ▼aSource:  Dissertations  Abstracts  International,  Volume:  86-11,  Section:  B.
■500    ▼aAdvisor:  Bernstein,  Dennis  S.
■5021  ▼aThesis  (Ph.D.)--University  of  Michigan,  2025.
■520    ▼aRecursive  least  squares  (RLS)  is  a  foundational  algorithm  in  systems  and  control  theory  for  the  online  identification  of  fixed  parameters.  However,  a  critical  flaw  of  RLS  is  its  inability  to  track  time-varying  parameters.  RLS  with  a  forgetting  factor  can  track  time-varying  parameters,  but  is  fragile  without  persistently  exciting  (PE)  data.  This  dissertation  develops  theory  and  new  extensions  of  RLS,  to  accomplish  with  what  these  classical  algorithms  cannot.  These  results  are  applied  to  online  system  identification  for  adaptive  control.    Following  an  introductory  chapter,  the  second  chapter  presents  three  derivations  of  RLS.  These  derivations  introduce  important  concepts  used  throughout  this  dissertation.  The  third  chapter  introduces  RLS  with  a  forgetting  factor,  or  exponential  forgetting  (EF)  RLS,  and  presents  guaranteed  covariance  bound  for  EF-RLS  with  persistent  excitation.  These  guaranteed  bounds  serve  as  a  baseline  for  new  algorithms  presented  later  in  this  dissertation.  The  fourth  chapter  addresses  efficient  RLS  identification  of  parameters  in  a  matrix  structure  and  reveals  a  tradeoff  between  computational  complexity  and  algorithm  generality.  This  result  is  used  to  dramatically  speed  up  online  identification  of  multi-input-multi-output  (MIMO)  input/output  models  in  an  adaptive  control  scheme.  The  fifth  chapter  studies  identification  of  MIMO  input/output  models  using  RLS  when  model  order  is  higher  than  system  order.  We  show  that  in  this  scenario,  data  cannot  be  persistent  excitation  and  address  convergence  without  PE.  The  sixth  and  seventh  chapters  introduce  novel  extensions  of  RLS  for  situations  without  PE.  The  sixth  chapter  presents  Subspace  of  Information  Forgetting  (SIFt)  RLS,  a  new  extension  of  RLS  designed  for  scenarios  when  particular  directions  are  excited  and  others  are  not.  This  is  accomplished  by  forgetting  in  only  in  the  subspace  of  information,  allowing  for  bounded  covariance  without  PE.  The  seventh  chapter  introduces  exponential  resetting  and  cyclic  resetting  RLS,  two  algorithms  which  address  periods  of  high  excitation  and  periods  of  low  excitation.  These  algorithms  prevent  covariance  windup  experienced  by  EF-RLS  during  periods  of  low  excitation.  Finally,  the  eighth  and  ninth  chapters  concern  the  unification  of  RLS  extensions  from  the  literature.  The  eighth  chapter  provides  an  overarching  framework  for  RLS  extensions  and  provides  sufficient  conditions  for  stability  and  robustness  of  parameter  estimation  error.  The  ninth  chapter  builds  on  the  eighth  chapter  to  show  that  extensions  of  RLS  are  also  special  cases  of  the  Kalman  filter.  This  motivates  a  new  class  of  adaptive  Kalman  filters  for  state  estimation  in  the  presence  of  unmodeled  disturbances.
■590    ▼aSchool  code:  0127.
■650  4▼aAerospace  engineering
■650  4▼aComputer  engineering
■650  4▼aApplied  mathematics
■653    ▼aRecursive  least  squares
■653    ▼aSystem  identification
■653    ▼aRecursive  estimation
■653    ▼aAdaptive  control
■653    ▼aKalman  filter
■690    ▼a0538
■690    ▼a0464
■690    ▼a0364
■71020▼aUniversity  of  Michigan▼bAerospace  Engineering.
■7730  ▼tDissertations  Abstracts  International▼g86-11B.
■790    ▼a0127
■791    ▼aPh.D.
■792    ▼a2025
■793    ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17358113▼nKERIS▼z이  자료의  원문은  한국교육학술정보원에서  제공합니다.

Preview

Export

ChatGPT Discussion

AI Recommended Related Books


    New Books MORE
    Statistics for the past 3 years. Go to brief

    Buch Status

    • Reservierung
    • frei buchen
    • Meine Mappe
    • Erste Aufräumarbeiten Anfrage
    • Non-Book Loan Application
    • Nighttime Book Loan Application
    Sammlungen
    Registrierungsnummer callnumber Standort Verkehr Status Verkehr Info
    TF15994 전자도서 대출가능 My Folder 부재도서신고 비도서대출신청 야간 도서대출신청

    * Kredite nur für Ihre Daten gebucht werden. Wenn Sie buchen möchten Reservierungen, klicken Sie auf den Button.

    Books borrowed together with this book

    Related Popular Books

    Available after logging in.