Multi-threat containment with dynamic wireless neighborhood networks

Nathan A. Ransom; Shanchieh Jay Yang

doi:10.1117/12.776807

15 April 2008 Multi-threat containment with dynamic wireless neighborhood networks

Proceedings Volume 6961, Intelligent Computing: Theory and Applications VI; 69610E (2008) https://doi.org/10.1117/12.776807
Event: SPIE Defense and Security Symposium, 2008, Orlando, Florida, United States

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.

Citation Download Citation

Nathan A. Ransom and Shanchieh Jay Yang "Multi-threat containment with dynamic wireless neighborhood networks", Proc. SPIE 6961, Intelligent Computing: Theory and Applications VI, 69610E (15 April 2008); https://doi.org/10.1117/12.776807

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available