國立虎尾科技大學 |

Algorithms for routing unmanned vehicles with motions, resource, and communication constraints.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Algorithms for routing unmanned vehicles with motions, resource, and communication constraints./
作者:	Sundar, Kaarthik.
面頁冊數:	1 online resource (135 pages)
附註:	Source: Dissertation Abstracts International, Volume: 78-02(E), Section: B.
Contained By:	Dissertation Abstracts International78-02B(E).
標題:	Mechanical engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9781339990859

Algorithms for routing unmanned vehicles with motions, resource, and communication constraints.
Sundar, Kaarthik.

Algorithms for routing unmanned vehicles with motions, resource, and communication constraints. - 1 online resource (135 pages)

Source: Dissertation Abstracts International, Volume: 78-02(E), Section: B.

Thesis (Ph.D.)

Includes bibliographical references

Multiple small autonomous or unmanned aerial and ground vehicles are being used together with stationary sensing devices for a wide variety of data gathering, monitoring and surveillance applications in military, civilian, and agricultural applications, to name a few. Even though there are several advantages due to the small platforms for these vehicles, they pose a variety of challenges. This dissertation aims to address the following challenges to routing multiple small autonomous aerial or ground vehicles: (i) limited communication capabilities of the stationary sensing devices, (ii) dynamics of the vehicles, (iii) varying sensing capabilities of all the vehicles, and (iv) resource constraints in the form of fuel restrictions on each vehicle. The dissertation formulates four different routing problems for multiple unmanned vehicles, one for each of the aforementioned constraints, as mixed-integer linear programs and develops numerically efficient algorithms based on the branch-and-cut paradigm to compute optimal solutions for practically reasonable size of test instances.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781339990859Subjects--Topical Terms:

557493
Mechanical engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Algorithms for routing unmanned vehicles with motions, resource, and communication constraints.
LDR:02425ntm a2200361Ki 4500 001 909428
005 20180426100011.5
006 m o u
007 cr mn||||a|a||
008 190606s2016 xx obm 000 0 eng d
020 $a 9781339990859
035 $a (MiAaPQ)AAI10143892
035 $a (MiAaPQ)0803vireo:17026Sundar
035 $a AAI10143892
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Sundar, Kaarthik. $3 1180217
245 1 0 $a Algorithms for routing unmanned vehicles with motions, resource, and communication constraints.
264 0 $c 2016
300 $a 1 online resource (135 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 78-02(E), Section: B.
500 $a Adviser: Sivakumar Rathinam.
502 $a Thesis (Ph.D.) $c Texas A&M University $d 2016.
504 $a Includes bibliographical references
520 $a Multiple small autonomous or unmanned aerial and ground vehicles are being used together with stationary sensing devices for a wide variety of data gathering, monitoring and surveillance applications in military, civilian, and agricultural applications, to name a few. Even though there are several advantages due to the small platforms for these vehicles, they pose a variety of challenges. This dissertation aims to address the following challenges to routing multiple small autonomous aerial or ground vehicles: (i) limited communication capabilities of the stationary sensing devices, (ii) dynamics of the vehicles, (iii) varying sensing capabilities of all the vehicles, and (iv) resource constraints in the form of fuel restrictions on each vehicle. The dissertation formulates four different routing problems for multiple unmanned vehicles, one for each of the aforementioned constraints, as mixed-integer linear programs and develops numerically efficient algorithms based on the branch-and-cut paradigm to compute optimal solutions for practically reasonable size of test instances.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Mechanical engineering. $3 557493
650 4 $a Robotics. $3 561941
650 4 $a Industrial engineering. $3 679492
655 7 $a Electronic books. $2 local $3 554714
690 $a 0548
690 $a 0771
690 $a 0546
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Texas A&M University. $b Mechanical Engineering. $3 1180218
773 0 $t Dissertation Abstracts International $g 78-02B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10143892 $z click for full text (PQDT)