Sensor scheduling using a 0-1 mixed integer programming framework

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

In this paper, we propose a novel myopic sensor scheduling methodology for tracking a target moving through a network of energy-constrained acoustic sensors. Specifically, we address the problem of activating the minimum-energy combination of sensors in a network that maintains a desired squared-error accuracy in the target's position estimate. We first formulate the scheduling problem as a binary (0-1) nonlinear programming (NLP) problem. Using a linearization technique, we then convert the 0-1 NLP problem into a 0-1 mixed integer programming (MIP) problem. We solve the reformulated 0-1 MIP problem using a linear programming relaxation based branch-and-bound technique. We demonstrate through Monte Carlo simulations that our proposed MIP scheduling method is very computational efficient as we can find optimal solutions to scheduling problems involving 50-60 sensors with processing time in the order of seconds.

Original languageEnglish (US)
Title of host publication2006 IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006
Pages471-475
Number of pages5
StatePublished - 2006
Event4th IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006 - Waltham, MA, United States
Duration: Jul 12 2006Jul 14 2006

Other

Other4th IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006
CountryUnited States
CityWaltham, MA
Period7/12/067/14/06

Fingerprint

Integer programming
Scheduling
Sensors
Nonlinear programming
Linearization
Linear programming
Acoustics
Processing

ASJC Scopus subject areas

  • Signal Processing
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Chhetri, A. S., Morrell, D., & Papandreou-Suppappola, A. (2006). Sensor scheduling using a 0-1 mixed integer programming framework. In 2006 IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006 (pp. 471-475)

Sensor scheduling using a 0-1 mixed integer programming framework. / Chhetri, Amit S.; Morrell, Darryl; Papandreou-Suppappola, Antonia.

2006 IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006. 2006. p. 471-475.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chhetri, AS, Morrell, D & Papandreou-Suppappola, A 2006, Sensor scheduling using a 0-1 mixed integer programming framework. in 2006 IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006. pp. 471-475, 4th IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006, Waltham, MA, United States, 7/12/06.
Chhetri AS, Morrell D, Papandreou-Suppappola A. Sensor scheduling using a 0-1 mixed integer programming framework. In 2006 IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006. 2006. p. 471-475
Chhetri, Amit S. ; Morrell, Darryl ; Papandreou-Suppappola, Antonia. / Sensor scheduling using a 0-1 mixed integer programming framework. 2006 IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006. 2006. pp. 471-475
@inproceedings{64792b4075704597ad12a6ad4f2625f3,
title = "Sensor scheduling using a 0-1 mixed integer programming framework",
abstract = "In this paper, we propose a novel myopic sensor scheduling methodology for tracking a target moving through a network of energy-constrained acoustic sensors. Specifically, we address the problem of activating the minimum-energy combination of sensors in a network that maintains a desired squared-error accuracy in the target's position estimate. We first formulate the scheduling problem as a binary (0-1) nonlinear programming (NLP) problem. Using a linearization technique, we then convert the 0-1 NLP problem into a 0-1 mixed integer programming (MIP) problem. We solve the reformulated 0-1 MIP problem using a linear programming relaxation based branch-and-bound technique. We demonstrate through Monte Carlo simulations that our proposed MIP scheduling method is very computational efficient as we can find optimal solutions to scheduling problems involving 50-60 sensors with processing time in the order of seconds.",
author = "Chhetri, {Amit S.} and Darryl Morrell and Antonia Papandreou-Suppappola",
year = "2006",
language = "English (US)",
isbn = "1424403081",
pages = "471--475",
booktitle = "2006 IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006",

}

TY - GEN

T1 - Sensor scheduling using a 0-1 mixed integer programming framework

AU - Chhetri, Amit S.

AU - Morrell, Darryl

AU - Papandreou-Suppappola, Antonia

PY - 2006

Y1 - 2006

N2 - In this paper, we propose a novel myopic sensor scheduling methodology for tracking a target moving through a network of energy-constrained acoustic sensors. Specifically, we address the problem of activating the minimum-energy combination of sensors in a network that maintains a desired squared-error accuracy in the target's position estimate. We first formulate the scheduling problem as a binary (0-1) nonlinear programming (NLP) problem. Using a linearization technique, we then convert the 0-1 NLP problem into a 0-1 mixed integer programming (MIP) problem. We solve the reformulated 0-1 MIP problem using a linear programming relaxation based branch-and-bound technique. We demonstrate through Monte Carlo simulations that our proposed MIP scheduling method is very computational efficient as we can find optimal solutions to scheduling problems involving 50-60 sensors with processing time in the order of seconds.

AB - In this paper, we propose a novel myopic sensor scheduling methodology for tracking a target moving through a network of energy-constrained acoustic sensors. Specifically, we address the problem of activating the minimum-energy combination of sensors in a network that maintains a desired squared-error accuracy in the target's position estimate. We first formulate the scheduling problem as a binary (0-1) nonlinear programming (NLP) problem. Using a linearization technique, we then convert the 0-1 NLP problem into a 0-1 mixed integer programming (MIP) problem. We solve the reformulated 0-1 MIP problem using a linear programming relaxation based branch-and-bound technique. We demonstrate through Monte Carlo simulations that our proposed MIP scheduling method is very computational efficient as we can find optimal solutions to scheduling problems involving 50-60 sensors with processing time in the order of seconds.

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

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

M3 - Conference contribution

AN - SCOPUS:34250615438

SN - 1424403081

SN - 9781424403080

SP - 471

EP - 475

BT - 2006 IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAM 2006

ER -