東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Multi-Agent Persistent Monitoring of...

Yu, Xi.

FindBook

Google Book

Amazon

博客來

Multi-Agent Persistent Monitoring of a Finite Set of Targets.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Multi-Agent Persistent Monitoring of a Finite Set of Targets./
作者:	Yu, Xi.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	136 p.
附註:	Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.
Contained By:	Dissertation Abstracts International79-08B(E).
標題:	Mechanical engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10689771
ISBN:	9780355744347

Multi-Agent Persistent Monitoring of a Finite Set of Targets.
Yu, Xi.

Multi-Agent Persistent Monitoring of a Finite Set of Targets. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 136 p.

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

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

The general problem of multi-agent persistent monitoring finds applications in a variety of domains ranging from meter to kilometer-scale systems, such as surveillance or environmental monitoring, down to nano-scale systems such as tracking biological macromolecules for studying basic biology and disease. The problem can be cast as moving the agents between targets, acquiring information from or in some fashion controlling the states of the targets. Under this formulation, at least two questions need to be addressed. The first is the design of motion trajectories for the agents as they move among the spatially distributed targets and jointly optimize a given cost function that describes some desired application. The second is the design of the controller that an agent will use at a target to steer the target's state as desired. The first question can be viewed in at least two ways: first, as an optimal control problem with the domain of the targets described as a continuous space, and second as a discrete scheduling task. In this work we focus on the second approach, which formulates the target dynamics as a hybrid automaton, and the geometry of the targets as a graph. We show how to find solutions by translating the scheduling problem into a search for the optimal route. With a route specifying the visiting sequence in place, we derive the optimal time the agent spends at each target analytically.

ISBN: 9780355744347Subjects--Topical Terms:

649730
Mechanical engineering.

Multi-Agent Persistent Monitoring of a Finite Set of Targets.
LDR:03433nmm a2200313 4500 001 2203138
005 20190528072650.5
008 201008s2018 ||||||||||||||||| ||eng d
020 $a 9780355744347
035 $a (MiAaPQ)AAI10689771
035 $a (MiAaPQ)bu:13515
035 $a AAI10689771
040 $a MiAaPQ $c MiAaPQ
100 1 $a Yu, Xi. $3 2096719
245 1 0 $a Multi-Agent Persistent Monitoring of a Finite Set of Targets.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 136 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.
500 $a Adviser: Sean B. Andersson.
502 $a Thesis (Ph.D.)--Boston University, 2018.
520 $a The general problem of multi-agent persistent monitoring finds applications in a variety of domains ranging from meter to kilometer-scale systems, such as surveillance or environmental monitoring, down to nano-scale systems such as tracking biological macromolecules for studying basic biology and disease. The problem can be cast as moving the agents between targets, acquiring information from or in some fashion controlling the states of the targets. Under this formulation, at least two questions need to be addressed. The first is the design of motion trajectories for the agents as they move among the spatially distributed targets and jointly optimize a given cost function that describes some desired application. The second is the design of the controller that an agent will use at a target to steer the target's state as desired. The first question can be viewed in at least two ways: first, as an optimal control problem with the domain of the targets described as a continuous space, and second as a discrete scheduling task. In this work we focus on the second approach, which formulates the target dynamics as a hybrid automaton, and the geometry of the targets as a graph. We show how to find solutions by translating the scheduling problem into a search for the optimal route. With a route specifying the visiting sequence in place, we derive the optimal time the agent spends at each target analytically.
520 $a The second question, namely that of steering the target's state, can be formulated from the perspective of the target, rather than the agent. The mobile nature of the agents leads to intermittent control, such that the controller is assumed to be disconnected when no agent is at the target. The design of the visiting schedule of agents to one target can affect the reachability (controllability) of this target's control system and the design of any specific controller. Existing test techniques for reachability are combined with the idea of lifting to provide conditions on systems such that reachability is maintained in the presence of periodic disconnections from the controller. While considering an intermittently connected control with constraints on the control authority and in the presence of a disturbance, the concept of degree of controllability is introduced. The degree is measured by a region of states that can be brought back to the origin in a given finite time. The size of this region is estimated to evaluate the performance of a given sequence.
590 $a School code: 0017.
650 4 $a Mechanical engineering. $3 649730
650 4 $a Robotics. $3 519753
690 $a 0548
690 $a 0771
710 2 $a Boston University. $b Mechanical Engineering ENG. $3 3181571
773 0 $t Dissertation Abstracts International $g 79-08B(E).
790 $a 0017
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10689771