View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams
| dc.contributor.author | Budhiraja, Ashish Kumar | en |
| dc.contributor.committeechair | Tokekar, Pratap | en |
| dc.contributor.committeemember | Furukawa, Tomonari | en |
| dc.contributor.committeemember | Williams, Ryan K. | en |
| dc.contributor.department | Electrical and Computer Engineering | en |
| dc.date.accessioned | 2017-09-06T08:01:14Z | en |
| dc.date.available | 2017-09-06T08:01:14Z | en |
| dc.date.issued | 2017-09-05 | en |
| dc.description.abstract | We study the problem of viewpoint planning in static and dynamic scenes using multi-robot teams. This work is motivated by two applications: bridge inspection and environmental monitoring using Unmanned Aerial Vehicles. For static scenes, we are given a set of target points in a polygonal environment that must be monitored using robots with cameras. The goal is to compute a tour for all the robots such that every target is visible from at least one tour. We solve this problem optimally by reducing it to Generalized Travelling Salesman Problem. For dynamic scenes, we study the multi-robot assignment problem for multi-target tracking. The problem can be viewed as the mixed packing and covering problem. We optimally solve the problem using Mixed Quadratic Integer Linear Program to maximize the total number of targets covered. In addition to theoretical contribution, we also present our hardware system design and findings from field experiments. | en |
| dc.description.abstractgeneral | We study the problem of viewpoint planning in static and dynamic scenes using multi-robot teams. This work is motivated by two applications: bridge inspection and environmental monitoring using Unmanned Aerial Vehicles. For static scenes, we are given a set of target points in a static 2D or 3D environment such as a bridge. Target points are key locations that we are interested to monitor using cameras on the robots. The goal is to compute a tour for all the robots such that every target location is visible from at least one robot’s tour. We want to minimize the sum of lengths of all the robot’s tours combined. We find the best possible solution for this problem. For dynamic scenes, we study the multi-robot trajectory assignment problem for multi-target tracking. Here, the target points may be moving, e.g., expanding plumes in an oil spill. The goal in this is to maximize the total number of targets covered at each time step. We provide the best possible solution in this case. In addition to theoretical contribution, we also present our hardware system design and findings from field experiments. | en |
| dc.description.degree | Master of Science | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:12641 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/78807 | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | Multi-Robot Coordination | en |
| dc.subject | Traveling Salesman Problem | en |
| dc.subject | Target Tracking | en |
| dc.title | View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | Computer Engineering | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | masters | en |
| thesis.degree.name | Master of Science | en |
Files
Original bundle
1 - 1 of 1