Page 1 |
Save page Remove page | Previous | 1 of 135 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
MOBILITY-BASED TOPOLOGY CONTROL OF ROBOT NETWORKS
by
Sameera Poduri
A Dissertation Presented to the
FACULTY OF THE GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER SCIENCE)
August 2008
Copyright 2008 Sameera Poduri
Object Description
| Title | Mobility-based topology control of robot networks |
| Author | Poduri, Sameera |
| Author email | sameera@usc.edu; sameera.poduri@gmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science |
| School | Viterbi School of Engineering |
| Date defended/completed | 2008-05-06 |
| Date submitted | 2008 |
| Restricted until | Unrestricted |
| Date published | 2008-08-05 |
| Advisor (committee chair) | Sukhatme, Gaurav S. |
| Advisor (committee member) |
Golubchik, Leana Krishnamachari, Bhaskar |
| Abstract | A fundamental problem that arises in realizing large-scale wireless networks of mobile robots is that of controlling the communication topology. This thesis makes three contributions to the area of mobility-based topology control in robot networks.; First, this work proposes local, geometric conditions on robot positions that guarantee global network connectivity. When combined with distributed controllers for mobile robots, these conditions maximize sensing coverage while maintaining connectivity. The key idea is the introduction of a new construct -- a Neighbor-Every-Theta (NET) graph -- in which each node has at least one neighbor in every angular sector of size theta. We prove that for theta < pi, NET graphs are guaranteed to have an edge-connectivity of at least floor(2 pi/theta), even with an irregular radio communication range. The NET conditions are integrated into an artificial potential field-based controller for distributed deployment.; Second, for robots communicating over unreliable wireless links, a coalescence behavior is introduced, in which disconnected robots recover connectivity by searching for others. Our contribution is an asymptotic analysis of coalescence time which quantifies the trade-off between the cost of maintaining connectivity and that of repairing connectivity -- the first such guideline for designing controllers for robot networks.; Finally, having shown how to construct and maintain robot networks with maximal coverage, we address a problem motivated by the performance of cheap, low-resolution cameras in complex outdoor environments. This variation of the sensor coverage problem is the first to address the case where the sensing performance of each robot carrying a camera depends on the local environmental conditions. We present a distributed reconfiguration algorithm for this case, and validate it using a network of real Cyclops cameras placed in environments with varying illumination and backgrounds. |
| Keyword | robot networks; deployment; topology control; coverage optimization |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m1535 |
| Contributing entity | University of Southern California |
| Rights | Poduri, Sameera |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | cisadmin@lib.usc.edu |
| Filename | etd-Poduri-2184 |
| Archival file | uscthesesreloadpub_Volume14/etd-Poduri-2184-0.pdf |
Description
| Title | Page 1 |
| Contributing entity | University of Southern California |
| Repository email | cisadmin@lib.usc.edu |
| Full text | MOBILITY-BASED TOPOLOGY CONTROL OF ROBOT NETWORKS by Sameera Poduri A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) August 2008 Copyright 2008 Sameera Poduri |
