東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Efficient method for computing strat...

Jensen, Reed.

FindBook

Google Book

Amazon

博客來

Efficient method for computing strategies for successive pursuit differential games.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Efficient method for computing strategies for successive pursuit differential games./
作者:	Jensen, Reed.
面頁冊數:	94 p.
附註:	Source: Masters Abstracts International, Volume: 52-06.
Contained By:	Masters Abstracts International52-06(E).
標題:	Engineering, Electronics and Electrical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1554741
ISBN:	9781303859281

Efficient method for computing strategies for successive pursuit differential games.
Jensen, Reed.

Efficient method for computing strategies for successive pursuit differential games. - 94 p.

Source: Masters Abstracts International, Volume: 52-06.

Thesis (M.S.)--Northeastern University, 2014.

In successive pursuit, a pursuer seeks to capture as many evaders as possible in succession in the shortest amount of time. At the same time, a coalition of evaders seeks to maximize capture time (or prevent capture entirely) with or without the knowledge of the pursuer's control law or preferred capture order. This study seeks to obtain a control strategy for both the pursuer and the coalition of evaders that is robust to uncertainty and variation in the pursuer or evader coalition strategy and that can be computed in a reasonable amount of time. A combination of techniques from differential game theory and discrete optimization are employed to compute such a strategy. In particular, a sub-optimal numerical approach using limited lookahead and a Monte Carlo tree search algorithm are used to obtain solutions in the presence of a high-dimensional action space. Examples are presented for both simple pursuit dynamics and the dynamics of the so-called Homicidal Chauffeur game.

ISBN: 9781303859281Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Efficient method for computing strategies for successive pursuit differential games.
LDR:02103nam a2200289 4500 001 1967015
005 20141112075746.5
008 150210s2014 ||||||||||||||||| ||eng d
020 $a 9781303859281
035 $a (MiAaPQ)AAI1554741
035 $a AAI1554741
040 $a MiAaPQ $c MiAaPQ
100 1 $a Jensen, Reed. $3 2103923
245 1 0 $a Efficient method for computing strategies for successive pursuit differential games.
300 $a 94 p.
500 $a Source: Masters Abstracts International, Volume: 52-06.
500 $a Adviser: Bahram Shafai.
502 $a Thesis (M.S.)--Northeastern University, 2014.
520 $a In successive pursuit, a pursuer seeks to capture as many evaders as possible in succession in the shortest amount of time. At the same time, a coalition of evaders seeks to maximize capture time (or prevent capture entirely) with or without the knowledge of the pursuer's control law or preferred capture order. This study seeks to obtain a control strategy for both the pursuer and the coalition of evaders that is robust to uncertainty and variation in the pursuer or evader coalition strategy and that can be computed in a reasonable amount of time. A combination of techniques from differential game theory and discrete optimization are employed to compute such a strategy. In particular, a sub-optimal numerical approach using limited lookahead and a Monte Carlo tree search algorithm are used to obtain solutions in the presence of a high-dimensional action space. Examples are presented for both simple pursuit dynamics and the dynamics of the so-called Homicidal Chauffeur game.
520 $a This work is sponsored by the Department of the Air Force under Air Force Contract FA8721-05-C-0002. Opinions, interpretations, conclusions and recommendations are those of the author and are not necessarily endorsed by the United States Government.
590 $a School code: 0160.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Engineering, Computer. $3 1669061
690 $a 0544
690 $a 0464
710 2 $a Northeastern University. $b Electrical and Computer Engineering. $3 1018491
773 0 $t Masters Abstracts International $g 52-06(E).
790 $a 0160
791 $a M.S.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1554741