서브메뉴
검색
Distributed and Time-Varying Optimization for Autonomy and Decision-Making
Distributed and Time-Varying Optimization for Autonomy and Decision-Making
Detailed Information
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20260202105528
- ISBN
- 9798263343958
- DDC
- 153.8
- 서명/저자
- Distributed and Time-Varying Optimization for Autonomy and Decision-Making
- 발행사항
- [Sl] : Georgia Institute of Technology, 2025
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2025
- 형태사항
- 206 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 87-05, Section: A.
- 주기사항
- Advisor: Hale, Matthew.
- 학위논문주기
- Thesis (Ph.D.)--Georgia Institute of Technology, 2025.
- 초록/해제
- 요약As the use of autonomous agents expands, agents are being tasked with completing more complex tasks in increasingly challenging environments. To complete these tasks agents must make decisions with limited information and onboard resources such as low computational power and inexpensive measurement units. One prevailing method to mitigate these challenges is to generate a solution, i.e., a reference trajectory, beforehand and then design a control law for the agents to track the a priori generated solution. Typically,an optimization algorithm uses a priori known data and dynamic models to generate the offline solution. However, in some environments it may not be possible to generate a solution offline. For example, we cannot generate offline optimal trajectories for agents to navigate an unmapped cave system in a search and rescue mission. One approach that has been proposed to enable agents to make decisions online is to use an optimization algorithm with in the control loop. However, vital questions arise regarding stability, performance, and implement ability when proposing to use optimization in-the-loop. Therefore, this dissertation addresses some of these challenges that arise when considering optimization in-the-looponboard agents with limited information and onboard resources.In the first part of this dissertation, we propose distributed algorithms to track the solutions of several classes of time-varying optimization problems which arise from the use of optimization in-the-loop in multi-agent settings. In particular, we show that there exist op-timization problems interconnected with dynamic systems such that we can implement our distributed algorithm to drive the dynamic system to a stable operating point. Furthermore, we derive tracking bounds which quantify the performance of our distributed algorithms on several classes of time-varying optimization problems. We show that these algorithms can account for limited onboard capabilities and operate with limited information from the net-work. In the second part of this dissertation, we address the challenge of implement ability of optimization in-the-loop by running experiments on a space-grade processor for relevant problems in the space domain. Namely, we propose a computationally constrained model predictive control strategy for the autonomous satellite docking problem which explicitly accounts for limited computational capabilities.
- 일반주제명
- Motivation
- 일반주제명
- Satellites
- 일반주제명
- Optimization algorithms
- 일반주제명
- Autonomous vehicles
- 일반주제명
- Decision making
- 일반주제명
- Altitude
- 일반주제명
- Robotics
- 일반주제명
- Aerospace engineering
- 일반주제명
- Transportation
- 기본자료저록
- Dissertations Abstracts International. 87-05A.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008260126s2025 us c eng d■001000017360453
■00520260202105528
■006m o d
■007cr#unu||||||||
■020 ▼a9798263343958
■035 ▼a(MiAaPQ)AAI32309802
■035 ▼a(MiAaPQ)GeorgiaTech77830
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a153.8
■1001 ▼aBehrendt, Gabriel.
■24510▼aDistributed and Time-Varying Optimization for Autonomy and Decision-Making
■260 ▼a[Sl]▼bGeorgia Institute of Technology▼c2025
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2025
■300 ▼a206 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 87-05, Section: A.
■500 ▼aAdvisor: Hale, Matthew.
■5021 ▼aThesis (Ph.D.)--Georgia Institute of Technology, 2025.
■520 ▼aAs the use of autonomous agents expands, agents are being tasked with completing more complex tasks in increasingly challenging environments. To complete these tasks agents must make decisions with limited information and onboard resources such as low computational power and inexpensive measurement units. One prevailing method to mitigate these challenges is to generate a solution, i.e., a reference trajectory, beforehand and then design a control law for the agents to track the a priori generated solution. Typically,an optimization algorithm uses a priori known data and dynamic models to generate the offline solution. However, in some environments it may not be possible to generate a solution offline. For example, we cannot generate offline optimal trajectories for agents to navigate an unmapped cave system in a search and rescue mission. One approach that has been proposed to enable agents to make decisions online is to use an optimization algorithm with in the control loop. However, vital questions arise regarding stability, performance, and implement ability when proposing to use optimization in-the-loop. Therefore, this dissertation addresses some of these challenges that arise when considering optimization in-the-looponboard agents with limited information and onboard resources.In the first part of this dissertation, we propose distributed algorithms to track the solutions of several classes of time-varying optimization problems which arise from the use of optimization in-the-loop in multi-agent settings. In particular, we show that there exist op-timization problems interconnected with dynamic systems such that we can implement our distributed algorithm to drive the dynamic system to a stable operating point. Furthermore, we derive tracking bounds which quantify the performance of our distributed algorithms on several classes of time-varying optimization problems. We show that these algorithms can account for limited onboard capabilities and operate with limited information from the net-work. In the second part of this dissertation, we address the challenge of implement ability of optimization in-the-loop by running experiments on a space-grade processor for relevant problems in the space domain. Namely, we propose a computationally constrained model predictive control strategy for the autonomous satellite docking problem which explicitly accounts for limited computational capabilities.
■590 ▼aSchool code: 0078.
■650 4▼aMotivation
■650 4▼aSatellites
■650 4▼aOptimization algorithms
■650 4▼aAutonomous vehicles
■650 4▼aDecision making
■650 4▼aAltitude
■650 4▼aRobotics
■650 4▼aAerospace engineering
■650 4▼aTransportation
■690 ▼a0771
■690 ▼a0538
■690 ▼a0800
■690 ▼a0709
■71020▼aGeorgia Institute of Technology.
■7730 ▼tDissertations Abstracts International▼g87-05A.
■790 ▼a0078
■791 ▼aPh.D.
■792 ▼a2025
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17360453▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
Preview
Export
ChatGPT Discussion
AI Recommended Related Books
Подробнее информация.
- Бронирование
- не существует
- моя папка
- Первый запрос зрения
- Non-Book Loan Application
- Nighttime Book Loan Application
Available after logging in.


