東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Cooperative Control for Multi-agent ...

Zhou, Nan.

FindBook

Google Book

Amazon

博客來

Cooperative Control for Multi-agent Persistent Monitoring Problems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Cooperative Control for Multi-agent Persistent Monitoring Problems./
作者:	Zhou, Nan.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2019,
面頁冊數:	155 p.
附註:	Source: Dissertations Abstracts International, Volume: 80-12, Section: B.
Contained By:	Dissertations Abstracts International80-12B.
標題:	Applied Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13858323
ISBN:	9781392246054

Cooperative Control for Multi-agent Persistent Monitoring Problems.
Zhou, Nan.

Cooperative Control for Multi-agent Persistent Monitoring Problems. - Ann Arbor : ProQuest Dissertations & Theses, 2019 - 155 p.

Source: Dissertations Abstracts International, Volume: 80-12, Section: B.

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

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

In persistent monitoring tasks, cooperating mobile agents are used to monitor a dynamically changing environment that cannot be fully covered by a stationary team of agents. The exploration process leads to the discovery of various "points of interest" (targets) to be perpetually monitored. Through an optimal control approach, the first part of this dissertation shows that in a one-dimensional mission space the solution can be reduced to a simpler parametric problem. The behavior of agents under optimal control is described by a hybrid system which can be analyzed using Infinitesimal Perturbation Analysis (IPA) to obtain an on-line solution. IPA allows the modeling of virtually arbitrary stochastic effects in target uncertainty and its event-driven nature renders the solution scalable in the number of events rather than the state space.The second part of this work extends the results of the one-dimensional persistent monitoring problem to a two-dimensional space with constrained agent mobility. Under a general graph setting, the properties of the one-dimensional optimal control solution are largely inherited. The solution involves the design of agent trajectories defined by both the sequence of nodes to be visited and the amount of time spent at each node. A class of distributed threshold-based parametric controllers is proposed to reduce the computational complexity. These parameters are optimized through an event-driven IPA gradient-based algorithm and yield optimal controllers within this family of threshold-based policies. The performance of the threshold-based parametric controller is close to that of the optimal controller derived through dynamic programming and its computational complexity is smaller by orders of magnitude.Although effective, the aforementioned optimal controls are established on the assumption that agents are all connected via a centralized controller which is energy-consuming and unreliable in adversarial environments. The third part of this work extends the previous controls by developing decentralized controllers which distribute functionality to the agents so that each one acts upon local information and sparse communication with neighbors. The complexity of decentralization for persistent monitoring problems is significant given agent mobility and the overall time-varying graph topology. Conditions are identified and a decentralized framework is proposed under which the centralized solution can be exactly recovered in a decentralized event-driven manner based on local information -- except for one event requiring communication from a non-neighbor agent.

ISBN: 9781392246054Subjects--Topical Terms:

1669109
Applied Mathematics.

Cooperative Control for Multi-agent Persistent Monitoring Problems.
LDR:03686nmm a2200325 4500 001 2263199
005 20200214113209.5
008 220629s2019 ||||||||||||||||| ||eng d
020 $a 9781392246054
035 $a (MiAaPQ)AAI13858323
035 $a (MiAaPQ)bu:14621
035 $a AAI13858323
040 $a MiAaPQ $c MiAaPQ
100 1 $a Zhou, Nan. $3 3189677
245 1 0 $a Cooperative Control for Multi-agent Persistent Monitoring Problems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2019
300 $a 155 p.
500 $a Source: Dissertations Abstracts International, Volume: 80-12, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Cassandras, Christos G.
502 $a Thesis (Ph.D.)--Boston University, 2019.
506 $a This item must not be sold to any third party vendors.
520 $a In persistent monitoring tasks, cooperating mobile agents are used to monitor a dynamically changing environment that cannot be fully covered by a stationary team of agents. The exploration process leads to the discovery of various "points of interest" (targets) to be perpetually monitored. Through an optimal control approach, the first part of this dissertation shows that in a one-dimensional mission space the solution can be reduced to a simpler parametric problem. The behavior of agents under optimal control is described by a hybrid system which can be analyzed using Infinitesimal Perturbation Analysis (IPA) to obtain an on-line solution. IPA allows the modeling of virtually arbitrary stochastic effects in target uncertainty and its event-driven nature renders the solution scalable in the number of events rather than the state space.The second part of this work extends the results of the one-dimensional persistent monitoring problem to a two-dimensional space with constrained agent mobility. Under a general graph setting, the properties of the one-dimensional optimal control solution are largely inherited. The solution involves the design of agent trajectories defined by both the sequence of nodes to be visited and the amount of time spent at each node. A class of distributed threshold-based parametric controllers is proposed to reduce the computational complexity. These parameters are optimized through an event-driven IPA gradient-based algorithm and yield optimal controllers within this family of threshold-based policies. The performance of the threshold-based parametric controller is close to that of the optimal controller derived through dynamic programming and its computational complexity is smaller by orders of magnitude.Although effective, the aforementioned optimal controls are established on the assumption that agents are all connected via a centralized controller which is energy-consuming and unreliable in adversarial environments. The third part of this work extends the previous controls by developing decentralized controllers which distribute functionality to the agents so that each one acts upon local information and sparse communication with neighbors. The complexity of decentralization for persistent monitoring problems is significant given agent mobility and the overall time-varying graph topology. Conditions are identified and a decentralized framework is proposed under which the centralized solution can be exactly recovered in a decentralized event-driven manner based on local information -- except for one event requiring communication from a non-neighbor agent.
590 $a School code: 0017.
650 4 $a Applied Mathematics. $3 1669109
650 4 $a Engineering. $3 586835
690 $a 0364
690 $a 0537
710 2 $a Boston University. $b Systems Engineering ENG. $3 3277612
773 0 $t Dissertations Abstracts International $g 80-12B.
790 $a 0017
791 $a Ph.D.
792 $a 2019
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13858323