Sensor Scheduling Under Energy Constraints.

Sensor Scheduling Under Energy Constraints

[1]  J. Gittins.  Bandit processes and dynamic allocation indices , 1979 .

[2]  Alain Billionnet,et al.  A new upper bound for the 0-1 quadratic knapsack problem , 1999, Eur. J. Oper. Res..

[3]  R. Agrawal,et al.  Multi-armed bandit problems with multiple plays and switching cost , 1990 .

[4]  Demosthenis Teneketzis,et al.  Measurement scheduling for recursive team estimation , 1996 .

[5]  J. Peschon,et al.  Optimal control of measurement subsystems , 1967, IEEE Transactions on Automatic Control.

[6]  M. Athans.  On the Determination of Optimal Costly Measurement Strategies for Linear Stochastic Systems , 1972 .

[7]  E. N. Gilbert.  Optimal Search Strategies , 1959 .

[8]  David W. Matula.  A Periodic Optimal Search , 1964 .

[9]  A. Bensoussan,et al.  Optimal sensor scheduling in nonlinear filtering of diffusion processes , 1989 .

[10]  Ruzena Bajcsy,et al.  The Sensor Selection Problem for Bounded Uncertainty Sensing Models , 2005, IEEE Transactions on Automation Science and Engineering.

[11]  Ingo Wegener,et al.  Discrete Sequential Search with Positive Switch Cost , 1982, Math. Oper. Res..

[12]  J. Kadane.  Discrete search and the Neyman-Pearson Lemma , 1968 .

[13]  Richard Weber.  Optimal search for a randomly moving object , 1986 .

[14]  Milton C. Chew.  A Sequential Search Procedure , 1967 .

[15]  Rudolf Ahlswede,et al.  Search Problems , 1987 .

[16]  Jean Walrand,et al.  Extensions of the multiarmed bandit problem: The discounted case , 1985 .

[17]  William L. Black,et al.  Discrete Sequential Search , 1965, Inf. Control..

[18]  S. Zamir,et al.  Optimal Sequential Search: A Bayesian Approach , 1985 .

[19]  V. I. Arkin.  A Problem of Optimum Distribution of Search Effort , 1964 .

[20]  Ingo Wegener.  The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities , 1980, Math. Oper. Res..

[21]  Kay Römer,et al.  The design space of wireless sensor networks , 2004, IEEE Wireless Communications.

[22]  Nah-Oak Song,et al.  Discrete search with multiple sensors , 2004, Math. Methods Oper. Res..

[23]  Michael Athans,et al.  1972 IFAC congress paper: On the determination of optimal costly measurement strategies for linear stochastic systems , 1972 .

[24]  R. Weber.  On the Gittins Index for Multiarmed Bandits , 1992 .

[25]  S. Martello,et al.  An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .

[26]  A. Mandelbaum.  Discrete multi-armed bandits and multi-parameter processes , 1986 .

[27]  Demosthenis Teneketzis,et al.  ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES , 2000 .

[28]  P. Whittle.  Multi‐Armed Bandits and the Gittins Index , 1980 .

[29]  Keith P. Tognetti,et al.  Letter to the Editor - An Optimal Strategy for a Whereabouts Search , 1968, Oper. Res..

[30]  J. Bather,et al.  Multi‐Armed Bandit Allocation Indices , 1990 .

[31]  Ariela Sharlin.  Optimal search for one of many objects hidden in two boxes , 1987 .

[32]  J. Banks,et al.  Switching Costs and the Gittins Index , 1994 .

[33]  David Assaf,et al.  Dynamic search for a moving target , 1994 .

[34]  Shmuel Zamir,et al.  Continuous and discrete search for one of many objects , 1987 .

[35]  P. Whittle.  Arm-Acquiring Bandits , 1981 .

[36]  Frank Kelly.  On optimal search with unknown detection probabilities , 1982 .

[37]  F. P. Kelly,et al.  A Remark on Search and Sequencing Problems , 1982, Math. Oper. Res..

[38]  Harold J. Kushner,et al.  On the optimum timing of observations for linear control systems with unknown initial state , 1964 .

[39]  Yu-Chi Ho,et al.  The Decentralized Wald Problem , 1987, Inf. Comput..

[40]  Joseph B. Kadane,et al.  Optimal Whereabouts Search for a Moving Target , 1981, Oper. Res..

[41]  Demosthenis Teneketzis,et al.  Multi-Armed Bandit Problems , 2008 .

[42]  J. Walrand,et al.  Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards , 1987 .

[43]  G. Pottie,et al.  Entropy-based sensor selection heuristic for target localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[44]  Kenji Onaga.  Optimal Search for Detecting a Hidden Object , 1971 .

[45]  Ingo Wegener.  Optimal Search With Positive Switch Cost is NP-Hard , 1985, Inf. Process. Lett..

[46]  D. Teneketzis,et al.  On the optimality of the Gittins index rule in multi-armed bandits with multiple plays , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[47]  Mani Srivastava,et al.  Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..

[48]  Demosthenis Teneketzis,et al.  Multi-armed bandits with switching penalties , 1996, IEEE Trans. Autom. Control..