Minimizing maximum cost in task coverage problem with multiple mobile sensors: A heuristic approach based on all-pairs shortest path

Hyeun Jeong Min and Hyo-Sang Lim

International Journal of Distributed Sensor Networks, 2017, vol. 13, issue 11, 1550147717741265

Abstract: We address a task coverage problem to cover all given tasks with a given number of mobile sensors. In this context, we consider tasks as certain points or regions that should be probed by sensors. Our work is to find initial tasks to deploy sensors in advance, and find an efficient set of search paths from the initial tasks that completely covers all tasks and minimizes the maximum cost among paths. This is a challenging issue for various sensor applications, particularly those related to time-critical missions, such as search and rescue operations. We propose an algorithm that selects a set of all-pairs shortest paths with fewer duplicated tasks and extends each path using remaining tasks while covering all tasks and avoiding cost increases. Experimental results demonstrate that the proposed algorithm provides efficient solutions compared to existing algorithms in terms of coverage and maximum path costs.

Keywords: Mobile sensors; distributed coordinated search; task coverage problem; time-critical coverage; multi-robot system (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/1550147717741265 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717741265

DOI: 10.1177/1550147717741265

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().