東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Multi-robot coordination in domains ...

Jones, E. Gil.

Linked to FindBook

Google Book

Amazon

博客來

Multi-robot coordination in domains with intra-path constraints.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Multi-robot coordination in domains with intra-path constraints./
Author:	Jones, E. Gil.
Description:	186 p.
Notes:	Source: Dissertation Abstracts International, Volume: 71-08, Section: B, page: 5087.
Contained By:	Dissertation Abstracts International71-08B.
Subject:	Engineering, Robotics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3470166
ISBN:	9781124122786

Multi-robot coordination in domains with intra-path constraints.
Jones, E. Gil.

Multi-robot coordination in domains with intra-path constraints. - 186 p.

Source: Dissertation Abstracts International, Volume: 71-08, Section: B, page: 5087.

Thesis (Ph.D.)--Carnegie Mellon University, 2010.

Many applications require teams of robots to cooperatively execute tasks. Among these domains are those in which successful coordination must respect intra-path constraints, which are constraints that occur on the paths of agents and affect route planning. One such domain is disaster response with intra-path constraints, a compelling application that is not well addressed by current coordination methods. In this domain a group of fire truck robots attempt to address a number of fires spread throughout a city in the wake of a large-scale disaster. The disaster has also caused many city roads to be blocked by impassable debris, which can be cleared by bulldozer robots. To produce coordinated agent behavior that satisfies the requirements of this domain entails not only allocating fires to fire trucks, but also determining what routes fire trucks should take given the presence of debris piles and which bulldozers should be assigned to clear debris along those routes. To determine high quality coordinated plans in domains with intra-path constraints requires that agent interactions be considered when making path planning, allocation, and scheduling decisions. This thesis addresses the problem of coordinating agents in such domains, with the goal of determining high quality coordinated behavior while minimizing the time required for computation.

ISBN: 9781124122786Subjects--Topical Terms:

1018454
Engineering, Robotics.

Multi-robot coordination in domains with intra-path constraints.
LDR:04066nam 2200301 4500 001 1393872
005 20110415112006.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124122786
035 $a (UMI)AAI3470166
035 $a AAI3470166
040 $a UMI $c UMI
100 1 $a Jones, E. Gil. $3 1672451
245 1 0 $a Multi-robot coordination in domains with intra-path constraints.
300 $a 186 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-08, Section: B, page: 5087.
500 $a Advisers: M. Bernadine Dias; Anthony Stentz.
502 $a Thesis (Ph.D.)--Carnegie Mellon University, 2010.
520 $a Many applications require teams of robots to cooperatively execute tasks. Among these domains are those in which successful coordination must respect intra-path constraints, which are constraints that occur on the paths of agents and affect route planning. One such domain is disaster response with intra-path constraints, a compelling application that is not well addressed by current coordination methods. In this domain a group of fire truck robots attempt to address a number of fires spread throughout a city in the wake of a large-scale disaster. The disaster has also caused many city roads to be blocked by impassable debris, which can be cleared by bulldozer robots. To produce coordinated agent behavior that satisfies the requirements of this domain entails not only allocating fires to fire trucks, but also determining what routes fire trucks should take given the presence of debris piles and which bulldozers should be assigned to clear debris along those routes. To determine high quality coordinated plans in domains with intra-path constraints requires that agent interactions be considered when making path planning, allocation, and scheduling decisions. This thesis addresses the problem of coordinating agents in such domains, with the goal of determining high quality coordinated behavior while minimizing the time required for computation.
520 $a Different scenarios involving domains with intra-path constraints will vary in terms of the nature of the constraints, the level of uncertainty in the environment, and the time available for computation. The central contribution of this thesis is a suite of different approaches for effectively coordinating behavior in domains with intra-path constraints, each of which has strengths and weakness and each of which may be most appropriate given scenario requirements and specifications. One technique we employ is greedy, market-based coordination. In our market-based approaches we seek to exploit the structure and independence inherent in domains with intra-path constraints to develop heuristics and bounding routines that serve to improve the quality of agent behavior while limiting the required computation. Our other primary technique is a randomized evolutionary search method that employs genetic algorithms. The genetic algorithm approach can potentially avoid local performance maxima that can result from using the market-based methods but requires orders of magnitude more computation.
520 $a In addition to our suite of approaches this thesis formulates domains with intra-path constraints as a distinct problem space within multi-robot literature and comprehensively treats the scenario factors that must be considered in approach design. Further contributions include a tiered auction methodology that extends market-based methods to domains where forming accurate bids requires soliciting the help of other agents; the first tractable time-extended allocation approach to domains with intra-path constraints; and the first approach that employs genetic algorithms within a domain where allocation and path-planning are inter-constrained.
590 $a School code: 0041.
650 4 $a Engineering, Robotics. $3 1018454
690 $a 0771
710 2 $a Carnegie Mellon University. $3 1018096
773 0 $t Dissertation Abstracts International $g 71-08B.
790 1 0 $a Dias, M. Bernadine, $e advisor
790 1 0 $a Stentz, Anthony, $e advisor
790 $a 0041
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3470166