東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Safe Large-Scale Aerial Survey Planning for Multi-Robot Systems.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Safe Large-Scale Aerial Survey Planning for Multi-Robot Systems./
Author:	Shah, Kunal.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
Description:	119 p.
Notes:	Source: Dissertations Abstracts International, Volume: 83-05, Section: B.
Contained By:	Dissertations Abstracts International83-05B.
Subject:	Islands. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28812887
ISBN:	9798494453655

Safe Large-Scale Aerial Survey Planning for Multi-Robot Systems.
Shah, Kunal.

Safe Large-Scale Aerial Survey Planning for Multi-Robot Systems. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 119 p.

Source: Dissertations Abstracts International, Volume: 83-05, Section: B.

Thesis (Ph.D.)--Stanford University, 2021.

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

This thesis provides multi-robot path planning methods for conducting aerial surveys over large areas. In these surveys, Unpersoned Aerial Vehicles (UAVs) collect sets of images with their downward-facing cameras such that the entire area on the ground is covered. We present two novel methods for use in planning and deploying large-scale survey operations. The first method is an offline discrete path planning tool that finds a series of GPS waypoints for each UAV to visit such that the survey coverage requirements are met. The second is an online method that guarantees collision avoidance between UAVs and other objects in their environments despite noisy relative position uncertainty.Our path planning tool is designed to make the best use of limited flight time. Unlike current survey path planning solutions based on geometric patterns, our method, Path Optimization for Population Counting with Overhead Robotic Networks (POPCORN), solves a series of Boolean satisfiability instances of increasing complexity. Each instance yields a set of feasible paths at each iteration and recovers the set of shortest paths after sufficient time. By the addition of a divide-and-conquer scheme, Split And Link Tiles (SALT), these POPCORN instances can be computed in parallel and combined in a scalable manner to produce coverage paths over very large areas-of-interest. To demonstrate this algorithm's capabilities, we implemented our planning algorithm with a team of drones to conduct multiple photographic aerial wildlife surveys of the Cape Crozier Adelie penguin rookery on Ross Island, Antarctica, one of the largest penguin colonies in the world. The colony, which contains over 300,000 nesting pairs and spans over 2 square km, was surveyed in about 3 hours. In contrast, previous human-piloted single-drone surveys of the same colony required over 2 days to complete. We also have deployed our survey system in Mono Lake, CA to survey a California gull colony as well as a 2,000 acre ranch in Marin, CA. This thesis also presents a decentralized collision avoidance method, Collision Avoidance by Reciprocal Projections (CARP) based on safe-reachability. CARP is designed to guarantee avoidance, even when an agent has noisy estimates of the positions and velocities of other agents. The agents sense each other via measurements from noisy on-board sensors to maintain their own individual estimate of all other agents without inter-agent communication. Using these estimates, each agent can solve a convex program on-board that finds a trajectory that is guaranteed to be safe. This optimization problem can be quickly solved in practice, even on embedded systems, making it practical to use for computationally-constrained platforms such as small mobile robots. Furthermore, we show that CARP is an instance in a large class of collision avoidance methods and show that all collision avoidance methods of this class are guaranteed to be collision free. We show that our method can be extended to find smooth polynomial trajectories for higher dynamic systems such as quadrotors, and we present simulations and hardware demonstrations that showcase the capability of this algorithm. Finally, by using similar tools from safe-reachability, we find effective methods for pursuit in multi-agent pursuit-evasion games under uncertainty.

ISBN: 9798494453655Subjects--Topical Terms:

563444
Islands.

Safe Large-Scale Aerial Survey Planning for Multi-Robot Systems.
LDR:04438nmm a2200337 4500 001 2344695
005 20220531064628.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798494453655
035 $a (MiAaPQ)AAI28812887
035 $a (MiAaPQ)STANFORDdg865dp7819
035 $a AAI28812887
040 $a MiAaPQ $c MiAaPQ
100 1 $a Shah, Kunal. $3 1913941
245 1 0 $a Safe Large-Scale Aerial Survey Planning for Multi-Robot Systems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 119 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-05, Section: B.
500 $a Advisor: Cutkosky, Mark;Schwager, Mac;Kochenderfer, Mykel;Sadigh, Dorsa.
502 $a Thesis (Ph.D.)--Stanford University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a This thesis provides multi-robot path planning methods for conducting aerial surveys over large areas. In these surveys, Unpersoned Aerial Vehicles (UAVs) collect sets of images with their downward-facing cameras such that the entire area on the ground is covered. We present two novel methods for use in planning and deploying large-scale survey operations. The first method is an offline discrete path planning tool that finds a series of GPS waypoints for each UAV to visit such that the survey coverage requirements are met. The second is an online method that guarantees collision avoidance between UAVs and other objects in their environments despite noisy relative position uncertainty.Our path planning tool is designed to make the best use of limited flight time. Unlike current survey path planning solutions based on geometric patterns, our method, Path Optimization for Population Counting with Overhead Robotic Networks (POPCORN), solves a series of Boolean satisfiability instances of increasing complexity. Each instance yields a set of feasible paths at each iteration and recovers the set of shortest paths after sufficient time. By the addition of a divide-and-conquer scheme, Split And Link Tiles (SALT), these POPCORN instances can be computed in parallel and combined in a scalable manner to produce coverage paths over very large areas-of-interest. To demonstrate this algorithm's capabilities, we implemented our planning algorithm with a team of drones to conduct multiple photographic aerial wildlife surveys of the Cape Crozier Adelie penguin rookery on Ross Island, Antarctica, one of the largest penguin colonies in the world. The colony, which contains over 300,000 nesting pairs and spans over 2 square km, was surveyed in about 3 hours. In contrast, previous human-piloted single-drone surveys of the same colony required over 2 days to complete. We also have deployed our survey system in Mono Lake, CA to survey a California gull colony as well as a 2,000 acre ranch in Marin, CA. This thesis also presents a decentralized collision avoidance method, Collision Avoidance by Reciprocal Projections (CARP) based on safe-reachability. CARP is designed to guarantee avoidance, even when an agent has noisy estimates of the positions and velocities of other agents. The agents sense each other via measurements from noisy on-board sensors to maintain their own individual estimate of all other agents without inter-agent communication. Using these estimates, each agent can solve a convex program on-board that finds a trajectory that is guaranteed to be safe. This optimization problem can be quickly solved in practice, even on embedded systems, making it practical to use for computationally-constrained platforms such as small mobile robots. Furthermore, we show that CARP is an instance in a large class of collision avoidance methods and show that all collision avoidance methods of this class are guaranteed to be collision free. We show that our method can be extended to find smooth polynomial trajectories for higher dynamic systems such as quadrotors, and we present simulations and hardware demonstrations that showcase the capability of this algorithm. Finally, by using similar tools from safe-reachability, we find effective methods for pursuit in multi-agent pursuit-evasion games under uncertainty.
590 $a School code: 0212.
650 4 $a Islands. $3 563444
650 4 $a Aircraft. $3 832698
650 4 $a Embedded systems. $2 gtt $3 1068308
650 4 $a Boolean. $3 3683493
650 4 $a Open source software. $3 581998
650 4 $a Planning. $3 552734
650 4 $a Optimization. $3 891104
650 4 $a Robots. $3 529507
650 4 $a Algorithms. $3 536374
650 4 $a Pilots. $3 3681649
650 4 $a Rain. $3 3560372
650 4 $a Robotics. $3 519753
650 4 $a Aerospace engineering. $3 1002622
650 4 $a Computer science. $3 523869
650 4 $a Engineering. $3 586835
690 $a 0771
690 $a 0538
690 $a 0984
690 $a 0537
710 2 $a Stanford University. $3 754827
773 0 $t Dissertations Abstracts International $g 83-05B.
790 $a 0212
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28812887