On the use of binary programming for sensor scheduling

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

In this paper, we propose two myopic sensor scheduling algorithms for target tracking scenarios in which there is a tradeoff between tracking performance and sensor-usage costs. Specifically, we consider the problem of activating the lowest cost combination of at most L sensors that maintains a desired squared-error accuracy in the target's position estimate. For sensors that provide position information only, we develop a binary (01) mixed integer programming formulation for the scheduling problem and solve it using a linear programming relaxation-based branch-and-bound technique. For sensors that provide both position and velocity information, we pose the scheduling problem as a binary convex programming problem and solve it using the outer approximation algorithm. We apply our scheduling procedures in a network of sensors where the sensor-usage costs correspond to network energy consumption. Our simulation results demonstrate that scheduling using binary programming allows us to obtain optimal solutions to scheduling involving up to 5070 sensors typically in the order of seconds.

Original languageEnglish (US)
Pages (from-to)2826-2839
Number of pages14
JournalIEEE Transactions on Signal Processing
Volume55
Issue number6 II
DOIs
StatePublished - Jun 2007

Fingerprint

Scheduling
Sensors
Costs
Convex optimization
Integer programming
Approximation algorithms
Scheduling algorithms
Target tracking
Linear programming
Energy utilization

Keywords

  • Binary programming
  • Resource management
  • Sensor scheduling
  • Target tracking

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

On the use of binary programming for sensor scheduling. / Chhetri, Amit S.; Morrell, Darryl; Papandreou-Suppappola, Antonia.

In: IEEE Transactions on Signal Processing, Vol. 55, No. 6 II, 06.2007, p. 2826-2839.

Research output: Contribution to journalArticle

@article{a1c099366977451280f284b2a47429f0,
title = "On the use of binary programming for sensor scheduling",
abstract = "In this paper, we propose two myopic sensor scheduling algorithms for target tracking scenarios in which there is a tradeoff between tracking performance and sensor-usage costs. Specifically, we consider the problem of activating the lowest cost combination of at most L sensors that maintains a desired squared-error accuracy in the target's position estimate. For sensors that provide position information only, we develop a binary (01) mixed integer programming formulation for the scheduling problem and solve it using a linear programming relaxation-based branch-and-bound technique. For sensors that provide both position and velocity information, we pose the scheduling problem as a binary convex programming problem and solve it using the outer approximation algorithm. We apply our scheduling procedures in a network of sensors where the sensor-usage costs correspond to network energy consumption. Our simulation results demonstrate that scheduling using binary programming allows us to obtain optimal solutions to scheduling involving up to 5070 sensors typically in the order of seconds.",
keywords = "Binary programming, Resource management, Sensor scheduling, Target tracking",
author = "Chhetri, {Amit S.} and Darryl Morrell and Antonia Papandreou-Suppappola",
year = "2007",
month = "6",
doi = "10.1109/TSP.2007.893968",
language = "English (US)",
volume = "55",
pages = "2826--2839",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6 II",

}

TY - JOUR

T1 - On the use of binary programming for sensor scheduling

AU - Chhetri, Amit S.

AU - Morrell, Darryl

AU - Papandreou-Suppappola, Antonia

PY - 2007/6

Y1 - 2007/6

N2 - In this paper, we propose two myopic sensor scheduling algorithms for target tracking scenarios in which there is a tradeoff between tracking performance and sensor-usage costs. Specifically, we consider the problem of activating the lowest cost combination of at most L sensors that maintains a desired squared-error accuracy in the target's position estimate. For sensors that provide position information only, we develop a binary (01) mixed integer programming formulation for the scheduling problem and solve it using a linear programming relaxation-based branch-and-bound technique. For sensors that provide both position and velocity information, we pose the scheduling problem as a binary convex programming problem and solve it using the outer approximation algorithm. We apply our scheduling procedures in a network of sensors where the sensor-usage costs correspond to network energy consumption. Our simulation results demonstrate that scheduling using binary programming allows us to obtain optimal solutions to scheduling involving up to 5070 sensors typically in the order of seconds.

AB - In this paper, we propose two myopic sensor scheduling algorithms for target tracking scenarios in which there is a tradeoff between tracking performance and sensor-usage costs. Specifically, we consider the problem of activating the lowest cost combination of at most L sensors that maintains a desired squared-error accuracy in the target's position estimate. For sensors that provide position information only, we develop a binary (01) mixed integer programming formulation for the scheduling problem and solve it using a linear programming relaxation-based branch-and-bound technique. For sensors that provide both position and velocity information, we pose the scheduling problem as a binary convex programming problem and solve it using the outer approximation algorithm. We apply our scheduling procedures in a network of sensors where the sensor-usage costs correspond to network energy consumption. Our simulation results demonstrate that scheduling using binary programming allows us to obtain optimal solutions to scheduling involving up to 5070 sensors typically in the order of seconds.

KW - Binary programming

KW - Resource management

KW - Sensor scheduling

KW - Target tracking

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

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

U2 - 10.1109/TSP.2007.893968

DO - 10.1109/TSP.2007.893968

M3 - Article

AN - SCOPUS:34249804157

VL - 55

SP - 2826

EP - 2839

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 6 II

ER -