東華大學圖書館 |

Data-Driven Approaches for Mixed Integer Convex Programming in Robot Control.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Data-Driven Approaches for Mixed Integer Convex Programming in Robot Control./
作者:	Cauligi, Abhishek Srihari.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	112 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-09, Section: B.
Contained By:	Dissertations Abstracts International83-09B.
標題:	Software. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29003871
ISBN:	9798209784982

Data-Driven Approaches for Mixed Integer Convex Programming in Robot Control.
Cauligi, Abhishek Srihari.

Data-Driven Approaches for Mixed Integer Convex Programming in Robot Control. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 112 p.

Source: Dissertations Abstracts International, Volume: 83-09, Section: B.

Thesis (Ph.D.)--Stanford University, 2021.

This item must not be sold to any third party vendors.

Advances in sensing and actuation capabilities have allowed for the proliferation of robots across many fields, including aerial, industrial, and automotive applications. A driving factor in being able to deploy such robots in everyday applications is algorithms that imbue real-time decision making capabilities. Such decision-making capabilities can be formulated using the modeling framework of optimization programs. However, such optimization-based approaches are still limited by computational resources available on robot platforms. For example, in many aerospace applications, spacecraft robotic systems are equipped with embedded computers much less capable than the hardware typically used to solve such optimization algorithms. Thus, there is a pressing need to be able to scale and extend optimization-based planning and control algorithms to robotics applications with severely constrained computational resources. In this work, we turn towards recent advances in nonlinear optimization, supervised learning, and control theory to accelerate solving optimization-based controllers for online deployment. We then show how data-driven approaches can exploit powerful computational resources offline to learn the underlying structure of optimization problems such that the online decision making problem can be reduced to an approximate problem that is much easier to solve on embedded computers.In the first part of this dissertation, we present a local trajectory optimization framework known as Guaranteed Sequential Trajectory Optimization (GuSTO) that provides a theoretically-motivated algorithm that iteratively solves a series of convex optimization problems until convergence. We demonstrate how this framework can accommodate a broad class of trajectory optimization problems, including free-final time, free final-state, and problems on a manifold. We further discuss how GuSTO enables new applications, specifically in the domain of spacecraft robotic manipulation, and discuss the development of a novel gecko-inspired adhesive robot gripper design for the Astrobee assistive free-flying robot.In the second part of this dissertation, we turn towards global trajectory optimization problems, specifically those that can be formulated as mixed-integer convex programs (MICPs). MICPs are a popular modeling framework that can be used to model planning and control problems that are inherently combinatorial or discrete. However, existing algorithms fall short in being able to provide reliable solution approaches that can be deployed for real-time applications (i.e., 10-100Hz computation rates) on embedded systems. In this work, we turn towards data-driven approaches that can be used to find high quality feasible solutions to such MICPs and present Combinatorial Offline, Convex Online (CoCo). We demonstrate how such approaches can leverage the underlying structure of optimal control problems and compare our proposed approach against state-of-the-art commercial solvers. Numerical simulations are provided through this work to demonstrate the efficacy of our proposed approach and present hardware results on a free-flying spacecraft robotic test bed.

ISBN: 9798209784982Subjects--Topical Terms:

619355
Software.

Data-Driven Approaches for Mixed Integer Convex Programming in Robot Control.
LDR:04272nmm a2200337 4500 001 2345736
005 20220613063807.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798209784982
035 $a (MiAaPQ)AAI29003871
035 $a (MiAaPQ)STANFORDmx142wx7479
035 $a AAI29003871
040 $a MiAaPQ $c MiAaPQ
100 1 $a Cauligi, Abhishek Srihari. $3 3684731
245 1 0 $a Data-Driven Approaches for Mixed Integer Convex Programming in Robot Control.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 112 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-09, Section: B.
500 $a Advisor: Pavone, Marco;Cutkosky, Mark R. ;Schwager, Mac.
502 $a Thesis (Ph.D.)--Stanford University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Advances in sensing and actuation capabilities have allowed for the proliferation of robots across many fields, including aerial, industrial, and automotive applications. A driving factor in being able to deploy such robots in everyday applications is algorithms that imbue real-time decision making capabilities. Such decision-making capabilities can be formulated using the modeling framework of optimization programs. However, such optimization-based approaches are still limited by computational resources available on robot platforms. For example, in many aerospace applications, spacecraft robotic systems are equipped with embedded computers much less capable than the hardware typically used to solve such optimization algorithms. Thus, there is a pressing need to be able to scale and extend optimization-based planning and control algorithms to robotics applications with severely constrained computational resources. In this work, we turn towards recent advances in nonlinear optimization, supervised learning, and control theory to accelerate solving optimization-based controllers for online deployment. We then show how data-driven approaches can exploit powerful computational resources offline to learn the underlying structure of optimization problems such that the online decision making problem can be reduced to an approximate problem that is much easier to solve on embedded computers.In the first part of this dissertation, we present a local trajectory optimization framework known as Guaranteed Sequential Trajectory Optimization (GuSTO) that provides a theoretically-motivated algorithm that iteratively solves a series of convex optimization problems until convergence. We demonstrate how this framework can accommodate a broad class of trajectory optimization problems, including free-final time, free final-state, and problems on a manifold. We further discuss how GuSTO enables new applications, specifically in the domain of spacecraft robotic manipulation, and discuss the development of a novel gecko-inspired adhesive robot gripper design for the Astrobee assistive free-flying robot.In the second part of this dissertation, we turn towards global trajectory optimization problems, specifically those that can be formulated as mixed-integer convex programs (MICPs). MICPs are a popular modeling framework that can be used to model planning and control problems that are inherently combinatorial or discrete. However, existing algorithms fall short in being able to provide reliable solution approaches that can be deployed for real-time applications (i.e., 10-100Hz computation rates) on embedded systems. In this work, we turn towards data-driven approaches that can be used to find high quality feasible solutions to such MICPs and present Combinatorial Offline, Convex Online (CoCo). We demonstrate how such approaches can leverage the underlying structure of optimal control problems and compare our proposed approach against state-of-the-art commercial solvers. Numerical simulations are provided through this work to demonstrate the efficacy of our proposed approach and present hardware results on a free-flying spacecraft robotic test bed.
590 $a School code: 0212.
650 4 $a Software. $2 gtt. $3 619355
650 4 $a Success. $3 518195
650 4 $a Decision making. $3 517204
650 4 $a Robots. $3 529507
650 4 $a Design. $3 518875
650 4 $a Convex analysis. $3 3681761
650 4 $a Space stations. $3 789352
650 4 $a Astronauts. $3 809182
650 4 $a Adhesives. $3 871837
650 4 $a Optimization algorithms. $3 3683616
650 4 $a Ground stations. $3 3683603
650 4 $a Robotics. $3 519753
650 4 $a Computer science. $3 523869
650 4 $a Mathematics. $3 515831
690 $a 0771
690 $a 0389
690 $a 0984
690 $a 0405
710 2 $a Stanford University. $3 754827
773 0 $t Dissertations Abstracts International $g 83-09B.
790 $a 0212
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29003871