Back to search

University of Minnesota

Swarm dispersion via leader election, potential fields, and counting hops.

Abstract

dc:description.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.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Pakanati, Anuraag

Subjects

dc:subject × 4

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier 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.

Chain of custody

source
Harvested from
University of Minnesota
Base URL
conservancy.umn.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Pakanati, Anuraag. Swarm dispersion via leader election, potential fields, and counting hops.. 2010. http://purl.umn.edu/60742