Cooperative mobile agents search using beehive partitioned structure and Tabu Random search algorithm

Saba Ramazani; Delvin L. Jackson; Rastko R. Selmic

doi:10.1117/12.2016273

17 May 2013 Cooperative mobile agents search using beehive partitioned structure and Tabu Random search algorithm

Saba Ramazani, Delvin L. Jackson, Rastko R. Selmic

Proceedings Volume 8741, Unmanned Systems Technology XV; 874108 (2013) https://doi.org/10.1117/12.2016273
Event: SPIE Defense, Security, and Sensing, 2013, Baltimore, Maryland, United States

Abstract

In search and surveillance operations, deploying a team of mobile agents provides a robust solution that has multiple advantages over using a single agent in efficiency and minimizing exploration time. This paper addresses the challenge of identifying a target in a given environment when using a team of mobile agents by proposing a novel method of mapping and movement of agent teams in a cooperative manner. The approach consists of two parts. First, the region is partitioned into a hexagonal beehive structure in order to provide equidistant movements in every direction and to allow for more natural and flexible environment mapping. Additionally, in search environments that are partitioned into hexagons, mobile agents have an efficient travel path while performing searches due to this partitioning approach. Second, we use a team of mobile agents that move in a cooperative manner and utilize the Tabu Random algorithm to search for the target. Due to the ever-increasing use of robotics and Unmanned Aerial Vehicle (UAV) platforms, the field of cooperative multi-agent search has developed many applications recently that would benefit from the use of the approach presented in this work, including: search and rescue operations, surveillance, data collection, and border patrol. In this paper, the increased efficiency of the Tabu Random Search algorithm method in combination with hexagonal partitioning is simulated, analyzed, and advantages of this approach are presented and discussed.

Citation Download Citation

Saba Ramazani, Delvin L. Jackson, and Rastko R. Selmic "Cooperative mobile agents search using beehive partitioned structure and Tabu Random search algorithm", Proc. SPIE 8741, Unmanned Systems Technology XV, 874108 (17 May 2013); https://doi.org/10.1117/12.2016273

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