國立虎尾科技大學 |

Path Planning for Autonomous Aerial Vehicles Using Monte Carlo Tree Search.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Path Planning for Autonomous Aerial Vehicles Using Monte Carlo Tree Search./
Author:	Vasutapituks, Apichart.
Description:	1 online resource (99 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 85-11, Section: B.
Contained By:	Dissertations Abstracts International85-11B.
Subject:	Electrical engineering. -
Online resource:	click for full text (PQDT)
ISBN:	9798382724171

Path Planning for Autonomous Aerial Vehicles Using Monte Carlo Tree Search.
Vasutapituks, Apichart.

Path Planning for Autonomous Aerial Vehicles Using Monte Carlo Tree Search. - 1 online resource (99 pages)

Source: Dissertations Abstracts International, Volume: 85-11, Section: B.

Thesis (Ph.D.)--Colorado State University, 2024.

Includes bibliographical references

Unmanned aerial vehicles (UAVs), or drones, are widely used in civilian and defense applications, such as search and rescue operations, monitoring and surveillance, and aerial photography. This dissertation focuses on autonomous UAVs for tracking mobile ground targets. Our approach builds on optimization-based artificial intelligence for path planning by calculating approximately optimal trajectories. This approach poses a number of challenges, including the need to search over large solution spaces in real-time. To address these challenges, we adopt a technique involving a rapidly-exploring random tree (RRT) and Monte Carlo tree search (MCTS). The RRT technique increases in computational cost as we increase the number of mobile targets and the complexity of the dynamics. Our MCTS approach executes a tree search based on random sampling to generate trajectories in real time. We develop a variant of MCTS for online path-planning to track ground targets together with an associated algorithm called P-UAV. Our algorithm is based on the framework of partially observable Monte Carlo planning, originally developed in the context of MCTS for Markov decision processes. Our real-time approach exploits a parallel-computing strategy with a heuristic random-sampling process. In our framework, We explicitly incorporate threat evasion, obstacle collision avoidance, and resilience to wind. The approach embodies an exploration-exploitation tradeoff in seeking a near-optimal solution in spite of the huge search space. We provide simulation results to demonstrate the effectiveness of our path-planning method.

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

Mode of access: World Wide Web

ISBN: 9798382724171Subjects--Topical Terms:

596380
Electrical engineering.
Subjects--Index Terms:

Unmanned aerial vehiclesIndex Terms--Genre/Form:

554714
Electronic books.

Path Planning for Autonomous Aerial Vehicles Using Monte Carlo Tree Search.
LDR:03043ntm a22004097 4500 001 1148368
005 20240924101907.5
006 m o d
007 cr bn ---uuuuu
008 250605s2024 xx obm 000 0 eng d
020 $a 9798382724171
035 $a (MiAaPQ)AAI31143274
035 $a AAI31143274
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Vasutapituks, Apichart. $3 1474316
245 1 0 $a Path Planning for Autonomous Aerial Vehicles Using Monte Carlo Tree Search.
264 0 $c 2024
300 $a 1 online resource (99 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: Dissertations Abstracts International, Volume: 85-11, Section: B.
500 $a Advisor: Chong, Edwin K. P.
502 $a Thesis (Ph.D.)--Colorado State University, 2024.
504 $a Includes bibliographical references
520 $a Unmanned aerial vehicles (UAVs), or drones, are widely used in civilian and defense applications, such as search and rescue operations, monitoring and surveillance, and aerial photography. This dissertation focuses on autonomous UAVs for tracking mobile ground targets. Our approach builds on optimization-based artificial intelligence for path planning by calculating approximately optimal trajectories. This approach poses a number of challenges, including the need to search over large solution spaces in real-time. To address these challenges, we adopt a technique involving a rapidly-exploring random tree (RRT) and Monte Carlo tree search (MCTS). The RRT technique increases in computational cost as we increase the number of mobile targets and the complexity of the dynamics. Our MCTS approach executes a tree search based on random sampling to generate trajectories in real time. We develop a variant of MCTS for online path-planning to track ground targets together with an associated algorithm called P-UAV. Our algorithm is based on the framework of partially observable Monte Carlo planning, originally developed in the context of MCTS for Markov decision processes. Our real-time approach exploits a parallel-computing strategy with a heuristic random-sampling process. In our framework, We explicitly incorporate threat evasion, obstacle collision avoidance, and resilience to wind. The approach embodies an exploration-exploitation tradeoff in seeking a near-optimal solution in spite of the huge search space. We provide simulation results to demonstrate the effectiveness of our path-planning method.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Electrical engineering. $3 596380
650 4 $a Computer engineering. $3 569006
650 4 $a Computer science. $3 573171
653 $a Unmanned aerial vehicles
653 $a Monte Carlo tree search
653 $a Online path planning
653 $a Markov decision processes
653 $a Path planning
655 7 $a Electronic books. $2 local $3 554714
690 $a 0544
690 $a 0464
690 $a 0984
690 $a 0800
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Colorado State University. $b Electrical and Computer Engineering. $3 1195459
773 0 $t Dissertations Abstracts International $g 85-11B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31143274 $z click for full text (PQDT)