Maintaining Connectivity in Environments with Obstacles
2010-01-29
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Maintaining Connectivity in Environments with Obstacles
Published Date
2010-01-29
Publisher
Type
Report
Abstract
Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users on-demand. Robotic routers are especially appealing for applications in which there is a single user whose connectivity to a base station must be maintained in an environment that is large compared to the wireless range. In this paper, we study the problem of computing motion strategies for robotic routers in such scenarios, as well as the minimum number of robotic routers necessary to enact our motion strategies. Assuming that the routers are as fast as the user, we present an optimal solution for cases where the environment is a simply-connected polygon, a constant factor approximation for cases where the environment has a single obstacle, and an O(h) approximation for cases where the environment has h circular obstacles. The O(h) approximation also holds for cases where the environment has h arbitrary polygonal obstacles, provided they satisfy certain geometric constraints - e.g. when the set of their minimum bounding circles is disjoint.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Tekdas, Onur; Plonski, Patrick A.; Karnad, Nikhil. (2010). Maintaining Connectivity in Environments with Obstacles. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215820.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.