Swarm dispersion via leader election, potential fields, and counting hops.
2010-03
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Swarm dispersion via leader election, potential fields, and counting hops.
Authors
Published Date
2010-03
Publisher
Type
Thesis or Dissertation
Abstract
Robot swarm dispersion is an important area of research with many applications
including the deployment of sensor networks for military, search and rescue, emergency
response, intruder alert, and other applications. In this work, we examine how
robots with only laser data and the ability to communicate within a certain radius
may disperse in a complex unknown environment. We present a python framework
for running and evaluating robot swarms using controllers within the Player/Stage
framework. Finally, we demonstrate a modular state-based algorithm for robot dispersion
which attempts to maximize coverage while minimizing loss of connectivity
during deployment. We demonstrate using the Player/Stage environment that this
can in fact reliably achieve over a 100% percent increase in coverage over a variety of
different environments.
Description
University of Minnesota M.S. thesis. March 2010. Major: Computer Science. Advisor: Maria Gini. 1 computer file (PDF); ix, 80 pages.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Pakanati, Anuraag. (2010). Swarm dispersion via leader election, potential fields, and counting hops.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/60742.
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.