To read this content please select one of the options below:

Multi-agent target searching with time constraints using game-theoretic approaches

Tanmoy Hazra (Computer Science and Engineering, Defence Institute of Advanced Technology, Pune, India)
C.R.S. Kumar (Computer Science and Engineering, Defence Institute of Advanced Technology, Pune, India)
Manisha Nene (Computer Science and Engineering, Defence Institute of Advanced Technology, Pune, India)

Kybernetes

ISSN: 0368-492X

Article publication date: 4 September 2017

296

Abstract

Purpose

The purpose of this paper is to propose a model for a target searching problem in a two-dimensional region with time constraints. The proposed model facilitates the search operation by minimizing the mission time and fuel usage, and the search operation is performed by a set of agents divided into a number of groups.

Design/methodology/approach

The authors have applied optimization techniques, Cartesian product, inclusion–exclusion principle, cooperative strategy, Shapley value, fuzzy Shapley function and Choquet integral to model the problem.

Findings

The proposed technique optimizes the placement of base stations that minimizes the sortie length of the agents. The results show that the cooperative strategy outperforms the non-cooperative strategy. The Shapley values quantify the rewards of each group based on their contributions to the search operation, whereas the fuzzy Shapley values determine the rewards of each group based on their contributions and level of cooperation in the search operation.

Practical implications

The proposed model can be applied to model many real-time problems such as patrolling in international borders, urban areas, forests and managing rescue operations after natural calamities, etc. Therefore, defence organizations, police departments and other operation management sectors will be benefitted by applying the proposed approach.

Originality/value

To the best of the authors’ knowledge, determining the optimal locations of base stations in a region is not explored in the existing works on target searching problems with fuel constraints. The proposed approach to cooperatively search the targets in a region is new. Introducing the Shapley function and fuzzy Shapley function is a novel idea to quantify the rewards of each group based on their contributions and level of cooperation in the search operation. This paper addresses these unexplored areas.

Keywords

Citation

Hazra, T., Kumar, C.R.S. and Nene, M. (2017), "Multi-agent target searching with time constraints using game-theoretic approaches", Kybernetes, Vol. 46 No. 8, pp. 1278-1302. https://doi.org/10.1108/K-01-2017-0039

Publisher

:

Emerald Publishing Limited

Copyright © 2017, Emerald Publishing Limited

Related articles