Share Email Print

Proceedings Paper

Multi-threat containment with dynamic wireless neighborhood networks
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Advances in the areas of robotics have greatly increased the complexity and number of problems that groups of robots are able to solve. This work deals with the use of homogeneous and autonomous robots dynamically forming teams to solve a multi-threat containment problem. The multi-threat containment problem has the robot teams surround a number of threats that may occur randomly. Approaches with and without utilizing wireless communication are proposed and analyzed with a focus on the effects of using wireless. Simulation results show the benefit of the proposed integrated algorithm and its performance in different scenarios.

Paper Details

Date Published: 15 April 2008
PDF: 12 pages
Proc. SPIE 6961, Intelligent Computing: Theory and Applications VI, 69610E (15 April 2008); doi: 10.1117/12.776807
Show Author Affiliations
Nathan A. Ransom, Harris Corp. (United States)
Shanchieh Jay Yang, Rochester Institute of Technology (United States)

Published in SPIE Proceedings Vol. 6961:
Intelligent Computing: Theory and Applications VI
Kevin L. Priddy; Emre Ertin, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?