Nonmyopic sensor scheduling and its efficient implementation for target tracking applications

DOI10.1155/ASP/2006/31520zbMath1099.90539OpenAlexW2065948537MaRDI QIDQ2500911

Amit S. Chhetri, Antonia Papandreou-Suppappola, Darryl Morrell

Publication date: 28 August 2006

Published in: EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/asp/2006/31520

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Mathematical programming techniques for sensor networks ⋮ On efficient sensor scheduling for linear dynamical systems ⋮ On the convergence of the modified Riccati equation ⋮ Partially observable Markov decision process approximations for adaptive sensing ⋮ Stochastic dynamic programming model for optimal resource allocation in vehicular ad hoc networks ⋮ UTS-based foresight optimization of sensor scheduling for low interception risk tracking ⋮ A risk-based multisensor optimization scheduling method for target threat assessment

Cites Work

• Unnamed Item

This page was built for publication: Nonmyopic sensor scheduling and its efficient implementation for target tracking applications