Branch and bound method for sensor scheduling in discrete time

DOI10.3934/JIMO.2005.1.499MaRDI QIDQ2583324zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 16 January 2006

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2005.1.499

Mathematics Subject Classification ID

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

Recommendations

• Hybrid method for a general optimal sensor scheduling problem in discrete time
• Optimal sensor scheduling in continuous time
• The problem of optimal robust sensor scheduling
• Optimal periodic scheduling of sensor networks: a branch and bound approach
• Global optimization method for continuous-time sensor scheduling

Cited in

(12)

• Optimal switching signal design with a cost on switching action
• On the global optimal solution for linear quadratic problems of switched system
• Hybrid method for a general optimal sensor scheduling problem in discrete time
• On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
• Sensor deployment for pipeline leakage detection via optimal boundary control strategies
• Robust design of sensor fusion problem in discrete time
• Optimal periodic scheduling of sensor networks: a branch and bound approach
• Global optimization method for continuous-time sensor scheduling
• Optimal sensor scheduling in continuous time
• Manifold relaxations for integer programming
• Optimal Sensor Scheduling in Nonlinear Filtering of Diffusion Processes
• Simulation-based optimal sensor scheduling with application to observer trajectory planning

This page was built for publication: Branch and bound method for sensor scheduling in discrete time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583324)