語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Composable Optimization for Robotics...
~
le Cleach, Simon Pierre Marie.
FindBook
Google Book
Amazon
博客來
Composable Optimization for Robotics Simulation and Control.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Composable Optimization for Robotics Simulation and Control./
作者:
le Cleach, Simon Pierre Marie.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2023,
面頁冊數:
211 p.
附註:
Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
Contained By:
Dissertations Abstracts International84-12B.
標題:
Physics. -
電子資源:
https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30462684
ISBN:
9798379658397
Composable Optimization for Robotics Simulation and Control.
le Cleach, Simon Pierre Marie.
Composable Optimization for Robotics Simulation and Control.
- Ann Arbor : ProQuest Dissertations & Theses, 2023 - 211 p.
Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
Thesis (Ph.D.)--Stanford University, 2023.
Optimization is a fundamental part of robotics and can be seen in various aspects of the field, such as control and simulation. Both of these areas involve finding the best solutions to various optimization problems to achieve desired outcomes.Efficiency is key when it comes to solving these optimization problems. By finding solutions quickly and reliably, we can execute optimization-based controllers in realtime on hardware. The ability to quickly generate large amounts of simulation data is also valuable for offline optimization tasks such as policy optimization, co-design optimization, and system identification.Oftentimes, the optimization problems arising in robotics control and simulation have structure. Some problems directly fit into well-studied categories, for instance, the Linear Quadratic Regulator (LQR), other control problems can be cast as Linear Programs (LP), or Quadratic Programs (QP). For each of these categories there exist efficient and reliable solvers. Fitting your problem into one of these categories is often a safe strategy.However, there exist control and simulation tasks that involve complex optimization problems that do not fit these categories and for which there are currently no satisfactory solvers. In this dissertation, we focus on such problems. We are particularly interested in coupled optimization problems where the solution of one optimization problem is a parameter of another one.These coupled optimization problems can naturally arise in robotic simulation. For instance, the simulation of contact physics requires solving the least action principle and the maximum dissipation principle. We will see in Chapters 6 and 7 that we can solve these two optimization problems jointly. Coupled optimization problems also frequently arise in autonomous driving scenarios where agents are interacting. Indeed, each vehicle or pedestrian in the scene is optimizing its path to rally its destination as fast as possible while avoiding collisions.Conversely, we can deliberately choose to decompose a single complex optimization problem into a set of coupled optimization problems. We will see in Chapter 5 that decomposition is a strategy that can yield significant benefits in terms of the speed and reliability of the solver. In this context, optimization problems exchange gradient information by leveraging differentiable optimization. The strategy behind these choices is what we call composable optimization. In this dissertation, we focus on a few applications in robotics control and simulation namely game-theoretic control, control through contact, physics simulation, and collision detection. For these problems, we leverage composable optimization to exploit problem structure and devise efficient solvers. In some cases, we may combine multiple problems into a single optimization problem, while in other cases we may decompose the problems into simpler chunks. This approach allows us to tackle more complex optimization problems in a structured and efficient manner.
ISBN: 9798379658397Subjects--Topical Terms:
516296
Physics.
Composable Optimization for Robotics Simulation and Control.
LDR
:04055nmm a2200325 4500
001
2403560
005
20241118135829.5
006
m o d
007
cr#unu||||||||
008
251215s2023 ||||||||||||||||| ||eng d
020
$a
9798379658397
035
$a
(MiAaPQ)AAI30462684
035
$a
(MiAaPQ)STANFORDhr221wf1079
035
$a
AAI30462684
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
le Cleach, Simon Pierre Marie.
$3
3773831
245
1 0
$a
Composable Optimization for Robotics Simulation and Control.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2023
300
$a
211 p.
500
$a
Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
500
$a
Advisor: Schwager, Mac;Kennedy, Monroe;Manchester, Zachary.
502
$a
Thesis (Ph.D.)--Stanford University, 2023.
520
$a
Optimization is a fundamental part of robotics and can be seen in various aspects of the field, such as control and simulation. Both of these areas involve finding the best solutions to various optimization problems to achieve desired outcomes.Efficiency is key when it comes to solving these optimization problems. By finding solutions quickly and reliably, we can execute optimization-based controllers in realtime on hardware. The ability to quickly generate large amounts of simulation data is also valuable for offline optimization tasks such as policy optimization, co-design optimization, and system identification.Oftentimes, the optimization problems arising in robotics control and simulation have structure. Some problems directly fit into well-studied categories, for instance, the Linear Quadratic Regulator (LQR), other control problems can be cast as Linear Programs (LP), or Quadratic Programs (QP). For each of these categories there exist efficient and reliable solvers. Fitting your problem into one of these categories is often a safe strategy.However, there exist control and simulation tasks that involve complex optimization problems that do not fit these categories and for which there are currently no satisfactory solvers. In this dissertation, we focus on such problems. We are particularly interested in coupled optimization problems where the solution of one optimization problem is a parameter of another one.These coupled optimization problems can naturally arise in robotic simulation. For instance, the simulation of contact physics requires solving the least action principle and the maximum dissipation principle. We will see in Chapters 6 and 7 that we can solve these two optimization problems jointly. Coupled optimization problems also frequently arise in autonomous driving scenarios where agents are interacting. Indeed, each vehicle or pedestrian in the scene is optimizing its path to rally its destination as fast as possible while avoiding collisions.Conversely, we can deliberately choose to decompose a single complex optimization problem into a set of coupled optimization problems. We will see in Chapter 5 that decomposition is a strategy that can yield significant benefits in terms of the speed and reliability of the solver. In this context, optimization problems exchange gradient information by leveraging differentiable optimization. The strategy behind these choices is what we call composable optimization. In this dissertation, we focus on a few applications in robotics control and simulation namely game-theoretic control, control through contact, physics simulation, and collision detection. For these problems, we leverage composable optimization to exploit problem structure and devise efficient solvers. In some cases, we may combine multiple problems into a single optimization problem, while in other cases we may decompose the problems into simpler chunks. This approach allows us to tackle more complex optimization problems in a structured and efficient manner.
590
$a
School code: 0212.
650
4
$a
Physics.
$3
516296
650
4
$a
Algorithms.
$3
536374
650
4
$a
Sensitivity analysis.
$3
3560752
650
4
$a
Games.
$3
525308
650
4
$a
Parameter estimation.
$3
567557
650
4
$a
Robotics.
$3
519753
690
$a
0605
690
$a
0771
710
2
$a
Stanford University.
$3
754827
773
0
$t
Dissertations Abstracts International
$g
84-12B.
790
$a
0212
791
$a
Ph.D.
792
$a
2023
793
$a
English
856
4 0
$u
https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30462684
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9511880
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入