Sensor resource allocation for tracking using outer approximation

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

In this letter, we consider the problem of activating the optimal combination of sensors to track a target moving through a network of sensors. Our objective is to minimize the predicted approximate error in the target position estimate subject to constraints on sensor usage and sensor-usage costs. We formulate the scheduling problem as a binary convex programming problem and solve it using the outer approximation (OA) algorithm. We apply the proposed OA scheduling method to the scenario of tracking an underwater target using a network of active sensors. We demonstrate using Monte Carlo simulations that our OA scheduling method obtains optimal solutions to scheduling problems of up to 70 sensors in the order of seconds.

Original languageEnglish (US)
Pages (from-to)213-216
Number of pages4
JournalIEEE Signal Processing Letters
Volume14
Issue number3
DOIs
StatePublished - Mar 2007

Fingerprint

Outer Approximation
Resource Allocation
Resource allocation
Sensor
Sensors
Scheduling
Scheduling Problem
Target
Moving Target
Convex optimization
Convex Programming
Approximation algorithms
Approximation Algorithms
Monte Carlo Simulation
Optimal Solution
Binary
Minimise
Scenarios
Costs
Estimate

Keywords

  • Binary programming
  • Outer approximation (OA)
  • Resource allocation
  • Sensor scheduling
  • Target tracking

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

Sensor resource allocation for tracking using outer approximation. / Chhetri, Amit S.; Morrell, Darryl; Papandreou-Suppappola, Antonia.

In: IEEE Signal Processing Letters, Vol. 14, No. 3, 03.2007, p. 213-216.

Research output: Contribution to journalArticle

@article{e23088754b024a2ca833185e32c60368,
title = "Sensor resource allocation for tracking using outer approximation",
abstract = "In this letter, we consider the problem of activating the optimal combination of sensors to track a target moving through a network of sensors. Our objective is to minimize the predicted approximate error in the target position estimate subject to constraints on sensor usage and sensor-usage costs. We formulate the scheduling problem as a binary convex programming problem and solve it using the outer approximation (OA) algorithm. We apply the proposed OA scheduling method to the scenario of tracking an underwater target using a network of active sensors. We demonstrate using Monte Carlo simulations that our OA scheduling method obtains optimal solutions to scheduling problems of up to 70 sensors in the order of seconds.",
keywords = "Binary programming, Outer approximation (OA), Resource allocation, Sensor scheduling, Target tracking",
author = "Chhetri, {Amit S.} and Darryl Morrell and Antonia Papandreou-Suppappola",
year = "2007",
month = "3",
doi = "10.1109/LSP.2006.884007",
language = "English (US)",
volume = "14",
pages = "213--216",
journal = "IEEE Signal Processing Letters",
issn = "1070-9908",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Sensor resource allocation for tracking using outer approximation

AU - Chhetri, Amit S.

AU - Morrell, Darryl

AU - Papandreou-Suppappola, Antonia

PY - 2007/3

Y1 - 2007/3

N2 - In this letter, we consider the problem of activating the optimal combination of sensors to track a target moving through a network of sensors. Our objective is to minimize the predicted approximate error in the target position estimate subject to constraints on sensor usage and sensor-usage costs. We formulate the scheduling problem as a binary convex programming problem and solve it using the outer approximation (OA) algorithm. We apply the proposed OA scheduling method to the scenario of tracking an underwater target using a network of active sensors. We demonstrate using Monte Carlo simulations that our OA scheduling method obtains optimal solutions to scheduling problems of up to 70 sensors in the order of seconds.

AB - In this letter, we consider the problem of activating the optimal combination of sensors to track a target moving through a network of sensors. Our objective is to minimize the predicted approximate error in the target position estimate subject to constraints on sensor usage and sensor-usage costs. We formulate the scheduling problem as a binary convex programming problem and solve it using the outer approximation (OA) algorithm. We apply the proposed OA scheduling method to the scenario of tracking an underwater target using a network of active sensors. We demonstrate using Monte Carlo simulations that our OA scheduling method obtains optimal solutions to scheduling problems of up to 70 sensors in the order of seconds.

KW - Binary programming

KW - Outer approximation (OA)

KW - Resource allocation

KW - Sensor scheduling

KW - Target tracking

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

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

U2 - 10.1109/LSP.2006.884007

DO - 10.1109/LSP.2006.884007

M3 - Article

AN - SCOPUS:33947575394

VL - 14

SP - 213

EP - 216

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

SN - 1070-9908

IS - 3

ER -