Tracking of Multiple Targets using Optimal Number of UAVs

Arun Das, Shahrzad Shirazipourazad, David Hay, Arunabha Sen

Research output: Contribution to journalArticle

Abstract

In this paper we study the problem of mobile target tracking using the fewest number of mobile trackers for two different types of targets. Given the target trajectories and the period of observation, we propose techniques to compute the minimum number of trackers and their trajectories required to track all mobile targets. Two classes of mobile targets are considered in this paper: (i) targets that need tracking for the entire duration of observation, and (ii) targets that need tracking at least once during the period of observation. We show that even when target trajectories are known in advance, the problem is computationally hard, i.e., NP-Complete. We formulate the problem as a network flow problem and propose algorithms for its solution. We evaluate the performance of our algorithms through simulation and study the impact of parameters such as the speed and sensing range of the trackers.

Original languageEnglish (US)
JournalIEEE Transactions on Aerospace and Electronic Systems
DOIs
StateAccepted/In press - Jan 1 2018

Fingerprint

Unmanned aerial vehicles (UAV)
Trajectories
Target tracking

Keywords

  • Drones
  • Land vehicles
  • mobile targets
  • mobile trackers
  • network flow optimization
  • path planning
  • Sensors
  • Target tracking
  • target tracking
  • Trajectory
  • trajectory planning
  • Wireless sensor networks

ASJC Scopus subject areas

  • Aerospace Engineering
  • Electrical and Electronic Engineering

Cite this

Tracking of Multiple Targets using Optimal Number of UAVs. / Das, Arun; Shirazipourazad, Shahrzad; Hay, David; Sen, Arunabha.

In: IEEE Transactions on Aerospace and Electronic Systems, 01.01.2018.

Research output: Contribution to journalArticle

@article{981ab0dbf50f471581268aeaafd4f409,
title = "Tracking of Multiple Targets using Optimal Number of UAVs",
abstract = "In this paper we study the problem of mobile target tracking using the fewest number of mobile trackers for two different types of targets. Given the target trajectories and the period of observation, we propose techniques to compute the minimum number of trackers and their trajectories required to track all mobile targets. Two classes of mobile targets are considered in this paper: (i) targets that need tracking for the entire duration of observation, and (ii) targets that need tracking at least once during the period of observation. We show that even when target trajectories are known in advance, the problem is computationally hard, i.e., NP-Complete. We formulate the problem as a network flow problem and propose algorithms for its solution. We evaluate the performance of our algorithms through simulation and study the impact of parameters such as the speed and sensing range of the trackers.",
keywords = "Drones, Land vehicles, mobile targets, mobile trackers, network flow optimization, path planning, Sensors, Target tracking, target tracking, Trajectory, trajectory planning, Wireless sensor networks",
author = "Arun Das and Shahrzad Shirazipourazad and David Hay and Arunabha Sen",
year = "2018",
month = "1",
day = "1",
doi = "10.1109/TAES.2018.2875573",
language = "English (US)",
journal = "IEEE Transactions on Aerospace and Electronic Systems",
issn = "0018-9251",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Tracking of Multiple Targets using Optimal Number of UAVs

AU - Das, Arun

AU - Shirazipourazad, Shahrzad

AU - Hay, David

AU - Sen, Arunabha

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In this paper we study the problem of mobile target tracking using the fewest number of mobile trackers for two different types of targets. Given the target trajectories and the period of observation, we propose techniques to compute the minimum number of trackers and their trajectories required to track all mobile targets. Two classes of mobile targets are considered in this paper: (i) targets that need tracking for the entire duration of observation, and (ii) targets that need tracking at least once during the period of observation. We show that even when target trajectories are known in advance, the problem is computationally hard, i.e., NP-Complete. We formulate the problem as a network flow problem and propose algorithms for its solution. We evaluate the performance of our algorithms through simulation and study the impact of parameters such as the speed and sensing range of the trackers.

AB - In this paper we study the problem of mobile target tracking using the fewest number of mobile trackers for two different types of targets. Given the target trajectories and the period of observation, we propose techniques to compute the minimum number of trackers and their trajectories required to track all mobile targets. Two classes of mobile targets are considered in this paper: (i) targets that need tracking for the entire duration of observation, and (ii) targets that need tracking at least once during the period of observation. We show that even when target trajectories are known in advance, the problem is computationally hard, i.e., NP-Complete. We formulate the problem as a network flow problem and propose algorithms for its solution. We evaluate the performance of our algorithms through simulation and study the impact of parameters such as the speed and sensing range of the trackers.

KW - Drones

KW - Land vehicles

KW - mobile targets

KW - mobile trackers

KW - network flow optimization

KW - path planning

KW - Sensors

KW - Target tracking

KW - target tracking

KW - Trajectory

KW - trajectory planning

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=85055698194&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85055698194&partnerID=8YFLogxK

U2 - 10.1109/TAES.2018.2875573

DO - 10.1109/TAES.2018.2875573

M3 - Article

JO - IEEE Transactions on Aerospace and Electronic Systems

JF - IEEE Transactions on Aerospace and Electronic Systems

SN - 0018-9251

ER -