東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Iterative Methods in Switched System...

Caldwell, Timothy.

Linked to FindBook

Google Book

Amazon

博客來

Iterative Methods in Switched System Optimal Control.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Iterative Methods in Switched System Optimal Control./
Author:	Caldwell, Timothy.
Description:	175 p.
Notes:	Source: Dissertation Abstracts International, Volume: 75-01(E), Section: B.
Contained By:	Dissertation Abstracts International75-01B(E).
Subject:	Engineering, Mechanical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3595564
ISBN:	9781303414015

Iterative Methods in Switched System Optimal Control.
Caldwell, Timothy.

Iterative Methods in Switched System Optimal Control. - 175 p.

Source: Dissertation Abstracts International, Volume: 75-01(E), Section: B.

Thesis (Ph.D.)--Northwestern University, 2013.

This thesis considers the problem of scheduling events of a switched system so that an optimal performance is achieved. Two problems are considered: optimizing the switching times with a fixed mode sequence and optimizing the full mode schedule. Efficient calculations for the switching time gradient and Hessian are given. Furthermore, the switching time optimization problem for time-varying linear switched systems subject to quadratic cost is formulated so that only a single set of differential equations need to be solved prior to optimization. As for the mode scheduling problem, the presented approach has guarantees on convergence and computational complexity which parallel derivative-based iterative optimization but in the infinite dimensional, integer constrained setting of mode scheduling. In comparison to methods relying on mixed integer programming, the presented approach does not require a priori discretizations of time or state. Furthermore, in comparison to embedding and relaxation methods, every iteration of our algorithm returns a dynamically feasible solution such that switching time optimization is applicable. A large class of problems call for optimal mode scheduling, including calculating the timing of discrete changes to the parameters of a multimachine power network for synchronization, which is the concluding example in the thesis.

ISBN: 9781303414015Subjects--Topical Terms:

783786
Engineering, Mechanical.

Iterative Methods in Switched System Optimal Control.
LDR:02242nam a2200289 4500 001 1967149
005 20141112080136.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303414015
035 $a (MiAaPQ)AAI3595564
035 $a AAI3595564
040 $a MiAaPQ $c MiAaPQ
100 1 $a Caldwell, Timothy. $3 2104092
245 1 0 $a Iterative Methods in Switched System Optimal Control.
300 $a 175 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-01(E), Section: B.
500 $a Adviser: Todd D. Murphey.
502 $a Thesis (Ph.D.)--Northwestern University, 2013.
520 $a This thesis considers the problem of scheduling events of a switched system so that an optimal performance is achieved. Two problems are considered: optimizing the switching times with a fixed mode sequence and optimizing the full mode schedule. Efficient calculations for the switching time gradient and Hessian are given. Furthermore, the switching time optimization problem for time-varying linear switched systems subject to quadratic cost is formulated so that only a single set of differential equations need to be solved prior to optimization. As for the mode scheduling problem, the presented approach has guarantees on convergence and computational complexity which parallel derivative-based iterative optimization but in the infinite dimensional, integer constrained setting of mode scheduling. In comparison to methods relying on mixed integer programming, the presented approach does not require a priori discretizations of time or state. Furthermore, in comparison to embedding and relaxation methods, every iteration of our algorithm returns a dynamically feasible solution such that switching time optimization is applicable. A large class of problems call for optimal mode scheduling, including calculating the timing of discrete changes to the parameters of a multimachine power network for synchronization, which is the concluding example in the thesis.
590 $a School code: 0163.
650 4 $a Engineering, Mechanical. $3 783786
650 4 $a Engineering, Robotics. $3 1018454
650 4 $a Applied Mathematics. $3 1669109
690 $a 0548
690 $a 0771
690 $a 0364
710 2 $a Northwestern University. $b Mechanical Engineering. $3 1018403
773 0 $t Dissertation Abstracts International $g 75-01B(E).
790 $a 0163
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3595564