東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Optimal control approaches for persi...

Lin, Xuchao.

FindBook

Google Book

Amazon

博客來

Optimal control approaches for persistent monitoring problems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Optimal control approaches for persistent monitoring problems./
作者:	Lin, Xuchao.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2014,
面頁冊數:	139 p.
附註:	Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.
Contained By:	Dissertation Abstracts International76-08B(E).
標題:	Systems science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3662681
ISBN:	9781321689358

Optimal control approaches for persistent monitoring problems.
Lin, Xuchao.

Optimal control approaches for persistent monitoring problems. - Ann Arbor : ProQuest Dissertations & Theses, 2014 - 139 p.

Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.

Thesis (Ph.D.)--Boston University, 2014.

Persistent monitoring tasks arise when agents must monitor a dynamically changing environment which cannot be fully covered by a stationary team of available agents. It differs from traditional coverage tasks due to the perpetual need to cover a changing environment, i.e., all areas of the mission space must be visited infinitely often. This dissertation presents an optimal control framework for persistent monitoring problems where the objective is to control the movement of multiple cooperating agents to minimize an uncertainty metric in a given mission space. In an one-dimensional mission space, it is shown that the optimal solution is for each agent to move at maximal speed from one switching point to the next, possibly waiting some time at each point before reversing its direction. Thus, the solution is reduced to a simpler parametric optimization problem: determining a sequence of switching locations and associated waiting times at these switching points for each agent. This amounts to a hybrid system which is analyzed using Infinitesimal Perturbation Analysis (IPA), to obtain a complete on-line solution through a gradient-based algorithm. IPA is a method used to provide unbiased gradient estimates of performance metrics with respect to various controllable parameters in Discrete Event Systems (DES) as well as in Hybrid Systems (HS). It is also shown that the solution is robust with respect to the uncertainty model used, i.e., IPA provides an unbiased estimate of the gradient without any detailed knowledge of how uncertainty affects the mission space.

ISBN: 9781321689358Subjects--Topical Terms:

3168411
Systems science.

Optimal control approaches for persistent monitoring problems.
LDR:03966nmm a2200289 4500 001 2127497
005 20180103101919.5
008 180830s2014 ||||||||||||||||| ||eng d
020 $a 9781321689358
035 $a (MiAaPQ)AAI3662681
035 $a AAI3662681
040 $a MiAaPQ $c MiAaPQ
100 1 $a Lin, Xuchao. $3 3289646
245 1 0 $a Optimal control approaches for persistent monitoring problems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2014
300 $a 139 p.
500 $a Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.
500 $a Adviser: Christos G. Cassandras.
502 $a Thesis (Ph.D.)--Boston University, 2014.
520 $a Persistent monitoring tasks arise when agents must monitor a dynamically changing environment which cannot be fully covered by a stationary team of available agents. It differs from traditional coverage tasks due to the perpetual need to cover a changing environment, i.e., all areas of the mission space must be visited infinitely often. This dissertation presents an optimal control framework for persistent monitoring problems where the objective is to control the movement of multiple cooperating agents to minimize an uncertainty metric in a given mission space. In an one-dimensional mission space, it is shown that the optimal solution is for each agent to move at maximal speed from one switching point to the next, possibly waiting some time at each point before reversing its direction. Thus, the solution is reduced to a simpler parametric optimization problem: determining a sequence of switching locations and associated waiting times at these switching points for each agent. This amounts to a hybrid system which is analyzed using Infinitesimal Perturbation Analysis (IPA), to obtain a complete on-line solution through a gradient-based algorithm. IPA is a method used to provide unbiased gradient estimates of performance metrics with respect to various controllable parameters in Discrete Event Systems (DES) as well as in Hybrid Systems (HS). It is also shown that the solution is robust with respect to the uncertainty model used, i.e., IPA provides an unbiased estimate of the gradient without any detailed knowledge of how uncertainty affects the mission space.
520 $a In a two-dimensional mission space, such simple solutions can no longer be derived. An alternative is to optimally assign each agent a linear trajectory, motivated by the one-dimensional analysis. It is proved, however, that elliptical trajectories outperform linear ones. With this motivation, the dissertation formulates a parametric optimization problem to determine such trajectories. It is again shown that the problem can be solved using IPA to obtain performance gradients on line and obtain a complete and scalable solution. Since the solutions obtained are generally locally optimal, a stochastic comparison algorithm is incorporated for deriving globally optimal elliptical trajectories. The dissertation also approaches the problem by representing an agent trajectory in terms of general function families characterized by a set of parameters to be optimized. The approach is applied to the family of Lissajous functions as well as a Fourier series representation of an agent trajectory. Numerical examples indicate that this scalable approach provides solutions that are near-optimal relative to those obtained through a computationally intensive two point boundary value problem (TPBVP) solver. In the end, the problem is tackled using centralized and decentralized Receding Horizon Control (RHC) algorithms, which dynamically determine the control for agents by solving a sequence of optimization problems over a planning horizon and executing them over a shorter action horizon.
590 $a School code: 0017.
650 4 $a Systems science. $3 3168411
690 $a 0790
710 2 $a Boston University. $3 1017454
773 0 $t Dissertation Abstracts International $g 76-08B(E).
790 $a 0017
791 $a Ph.D.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3662681