본문

서브메뉴

Fixed-time Reinforcement Learning-based Control for Safe Autonomy
Fixed-time Reinforcement Learning-based Control for Safe Autonomy
Fixed-time Reinforcement Learning-based Control for Safe Autonomy

Detailed Information

자료유형  
 학위논문 서양
최종처리일시  
20260202105504
ISBN  
9798263324872
DDC  
500
저자명  
Kokolakis, Nick Marios.
서명/저자  
Fixed-time Reinforcement Learning-based Control for Safe Autonomy
발행사항  
[Sl] : Georgia Institute of Technology, 2024
발행사항  
Ann Arbor : ProQuest Dissertations & Theses, 2024
형태사항  
198 p
주기사항  
Source: Dissertations Abstracts International, Volume: 87-05, Section: B.
주기사항  
Advisor: Vamvoudakis, Kyriakos G.
학위논문주기  
Thesis (Ph.D.)--Georgia Institute of Technology, 2024.
초록/해제  
요약Exploiting the benefits of learning can enhance the performance and ensure the safety of autonomous systems in complex and unknown environments. Nonetheless, existing safe learning architectures lack finite time convergence guarantees, rendering these algorithms impractical for real-world applications. In this dissertation, we enable safe autonomy by endowing autonomous systems with safety-critical control frameworks predicated on online reinforcement learning mechanisms with fixed-time convergence guarantees. Specifically, we develop a safe pursuit-evasion game for enabling finite-time capture, optimal performance, and adaptation to an unknown cluttered environment. Then, we leverage ideas from behavioral game theory to construct a learning-based evader assignment algorithm to address the problem of multiple bounded rational pursuers against multiple bounded rational evaders, wherein the assignment is performed based on the agent rationality level. Subsequently, we design an online reinforcement learning architecture with fixed-time convergence guarantees to address the optimal fixed-time stabilization problem. Finally, we address a safety-critical control problem using reachability analysis and design an online reinforcement learning-based mechanism for learning the solution to the safety-critical control problem in a fixed time.
일반주제명  
Kinematics
일반주제명  
Graph representations
일반주제명  
Decision making
일반주제명  
Controllers
일반주제명  
Adaptation
일반주제명  
Unmanned aerial vehicles
일반주제명  
Rationality
일반주제명  
Dynamical systems
일반주제명  
Visualization
일반주제명  
Games
일반주제명  
Aerospace engineering
일반주제명  
Mathematics
일반주제명  
Robotics
기타저자  
Georgia Institute of Technology.
기본자료저록  
Dissertations Abstracts International. 87-05B.
전자적 위치 및 접속  
로그인 후 원문을 볼 수 있습니다.

MARC

 008260126s2024        us                              c    eng  d
■001000017360305
■00520260202105504
■006m          o    d                
■007cr#unu||||||||
■020    ▼a9798263324872
■035    ▼a(MiAaPQ)AAI32307977
■035    ▼a(MiAaPQ)GeorgiaTech78556
■040    ▼aMiAaPQ▼cMiAaPQ
■0820  ▼a500
■1001  ▼aKokolakis,  Nick  Marios.
■24510▼aFixed-time  Reinforcement  Learning-based  Control  for  Safe  Autonomy
■260    ▼a[Sl]▼bGeorgia  Institute  of  Technology▼c2024
■260  1▼aAnn  Arbor▼bProQuest  Dissertations  &  Theses▼c2024
■300    ▼a198  p
■500    ▼aSource:  Dissertations  Abstracts  International,  Volume:  87-05,  Section:  B.
■500    ▼aAdvisor:  Vamvoudakis,  Kyriakos  G.
■5021  ▼aThesis  (Ph.D.)--Georgia  Institute  of  Technology,  2024.
■520    ▼aExploiting  the  benefits  of  learning  can  enhance  the  performance  and  ensure  the  safety  of  autonomous  systems  in  complex  and  unknown  environments.  Nonetheless,  existing  safe  learning  architectures  lack  finite  time  convergence  guarantees,  rendering  these  algorithms  impractical  for  real-world  applications.  In  this  dissertation,  we  enable  safe  autonomy  by  endowing  autonomous  systems  with  safety-critical  control  frameworks  predicated  on  online  reinforcement  learning  mechanisms  with  fixed-time  convergence  guarantees.  Specifically,  we  develop  a  safe  pursuit-evasion  game  for  enabling  finite-time  capture,  optimal  performance,  and  adaptation  to  an  unknown  cluttered  environment.  Then,  we  leverage  ideas  from  behavioral  game  theory  to  construct  a  learning-based  evader  assignment  algorithm  to  address  the  problem  of  multiple  bounded  rational  pursuers  against  multiple  bounded  rational  evaders,  wherein  the  assignment  is  performed  based  on  the  agent  rationality  level.  Subsequently,  we  design  an  online  reinforcement  learning  architecture  with  fixed-time  convergence  guarantees  to  address  the  optimal  fixed-time  stabilization  problem.  Finally,  we  address  a  safety-critical  control  problem  using  reachability  analysis  and  design  an  online  reinforcement  learning-based  mechanism  for  learning  the  solution  to  the  safety-critical  control  problem  in  a  fixed  time.
■590    ▼aSchool  code:  0078.
■650  4▼aKinematics
■650  4▼aGraph  representations
■650  4▼aDecision  making
■650  4▼aControllers
■650  4▼aAdaptation
■650  4▼aUnmanned  aerial  vehicles
■650  4▼aRationality
■650  4▼aDynamical  systems
■650  4▼aVisualization
■650  4▼aGames
■650  4▼aAerospace  engineering
■650  4▼aMathematics
■650  4▼aRobotics
■690    ▼a0800
■690    ▼a0538
■690    ▼a0405
■690    ▼a0771
■71020▼aGeorgia  Institute  of  Technology.
■7730  ▼tDissertations  Abstracts  International▼g87-05B.
■790    ▼a0078
■791    ▼aPh.D.
■792    ▼a2024
■793    ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17360305▼nKERIS▼z이  자료의  원문은  한국교육학술정보원에서  제공합니다.

Preview

Export

ChatGPT Discussion

AI Recommended Related Books


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

    Подробнее информация.

    • Бронирование
    • не существует
    • моя папка
    • Первый запрос зрения
    • Non-Book Loan Application
    • Nighttime Book Loan Application
    материал
    Reg No. Количество платежных Местоположение статус Ленд информации
    TF18973 전자도서 대출가능 My Folder 부재도서신고 비도서대출신청 야간 도서대출신청

    * Бронирование доступны в заимствований книги. Чтобы сделать предварительный заказ, пожалуйста, нажмите кнопку бронирование

    Books borrowed together with this book

    Related Popular Books

    Available after logging in.