Stochastic steepest descent optimization of multiple-objective mobile sensor coverage

IEEE Transactions on Vehicular Technology

Volumn 61, Issue 4, 2012, Pages 1810-1822

  Ma, Chris Y T ^a   Yau, David K Y ^a,b   Yip, Nung Kwan ^c   Rao, Nageswara S V ^d   Chen, Jiming ^e,f  

^a ADVANCED DIGITAL SCIENCES CENTER   (Singapore)

^b Purdue University   (United States)

^c PURDUE UNIVERSITY   (United States)

^d OAK RIDGE NATIONAL LABORATORY   (United States)

^e ZHEJIANG UNIVERSITY   (China)

^f STATE KEY LABORATORY OF INDUSTRIAL CONTROL TECHNOLOGY   (China)

Author keywords

Mobile sensor network; multiple objective optimization; steepest descent

Indexed keywords

EXPOSURE TIME; FAST CONVERGENCE; HIGH PROBABILITY; INITIAL PARAMETER; LOCAL OPTIMA; MOBILE SENSOR NETWORKS; MOBILE SENSORS; MULTIPLE-OBJECTIVE OPTIMIZATION; OPTIMAL CONTROLS; OPTIMAL TRADEOFFS; PERFORMANCE OBJECTIVE; POINTS OF INTEREST; SCHEDULING DECISIONS; SEARCH PROCESS; SOLUTION SPACE; STEEPEST DESCENT; STEEPEST DESCENT OPTIMIZATION; STEP SIZE; STOCHASTIC SCHEDULING; TRANSITION PROBABILITIES;

CONTROL; CONTROL SYSTEM ANALYSIS; ENERGY EFFICIENCY; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; SCHEDULING; SENSOR NETWORKS; STOCHASTIC SYSTEMS;

OPTIMIZATION;

EID: 84861168752     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2012.2189591     Document Type: Article

References (24)

1. P. McKenney, "Stochastic fairness queuing," in Proc. IEEE INFOCOM, Mar. 1990, pp. 733-740.
2. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single-node case," IEEE/ACM Trans. Netw., vol. 1, no. 3, pp. 344-357, Jun. 1993.
3. C. A. Waldspurger and W. E. Weihl, "Lottery scheduling: Flexible proportional-share resource management," in Proc. 1st Symp. Oper. Syst. Des. Implementation, 1994, pp. 1-11.
4. C. A. Waldspurger, "Lottery and stride scheduling: Flexible proportionalshare resource management," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, MA, Sep., 1995.
5. J. C. R. Bennett and H. Zhang, "WF2Q: Worst case fair weighted fair queuing," in Proc. IEEE INFOCOM, 1996, pp. 120-128.
6. N. Bisnik, A. Abouzeid, and V. Isler, "Stochastic event capture using mobile sensors subject to a quality metric," in Proc. MOBICOM, Sep. 2006, pp. 98-109. (Pubitemid 44758707)
7. Z. Butler and D. Rus, "Event-based motion control for mobile sensor networks," IEEE Pervasive Comput., vol. 2, no. 4, pp. 34-42, Oct.-Dec. 2003.
8. P. Ogren, E. Fiorelli, and N. Leonard, "Cooperative control of mobile sensor networks: Adaptive gradient climbing in a distributed environment," IEEE Trans. Autom. Control, vol. 49, no. 8, pp. 1292-1302, Aug. 2004.
9. R. Murray, R. Janke, W. E. Hart, J. W. Berry, T. Taxon, and J. Uber, "Sensor network design of contamination warning systems: A decision framework," J. Amer. Water Works Assoc., vol. 100, no. 11, pp. 97-109, 2008.
10. A. Ostfeld, J. G. Uber, and E. Salomons, "Battle of water sensor networks: A design challenge for engineers and algorithms," in Proc. 8th Symp. Water Distrib. Syst. Anal., 2006, pp. 1-3.
11. M. J. Stealey, A. Singh, M. A. Batalin, B. Jordan, and W. J. Kaiser, "NIMS-AQ: A novel system for autonomous sensing of aquatic environments," in Proc. IEEE/RSJ Int. Conf. Robot. Autom., 2008, pp. 621-628.
12. W. K. Hastings, "Monte Carlo sampling methods using Markov chains and their applications," Biometrika, vol. 57, no. 1, pp. 97-109, Apr. 1970.
13. N. A. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, "Equation of state calculations by fast computing machines," J. Chem. Phys., vol. 21, no. 6, pp. 1087-1092, Jun. 1953.
14. R. L. Cruz, "Quality-of-service guarantees in virtual circuit switched networks," IEEE J. Sel. Areas Commun., vol. 13, no. 6, pp. 1048-1056, Aug. 1995.
15. L. Koralov and Y. G. Sinai, Theory of Probability and Random Processes. New York: Springer-Verlag, 2007.
16. C. D. Meyer, "The role of the group generalized inverse in the theory of finite Markov chains," SIAM Rev., vol. 17, no. 3, pp. 443-464, Jul. 1975.
17. J. G. Kemeny and J. L. Snell, Finite Markov Chains. NewYork:Van Nostrand, 1960.
18. P. J. Schweitzer, "Perturbation theory and finite Markov chains," J. Appl. Prob., vol. 5, no. 2, pp. 401-413, Aug. 1968.
19. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by Simulated Annealing," Science, New Ser., vol. 220, no. 4598, pp. 671-680, May 1983.
20. S. Geman and C. R. Hwang, "Diffusion for global optimization," SIAM J. Control Optim., vol. 24, pp. 1031-1043, 1986.
21. B. Hajek, "Cooling schedules for optimal annealing," Math. Oper. Res., vol. 13, no. 2, pp. 311-329, May 1988.
22. P. Brémaud, Markov Chains: Gibbs Fields, Monte Carlo Simulations and Queues. Berlin, Germany: Springer-Verlag, 1999.
23. R. L. Yang, "Convergence of the simulated annealing algorithm for continuous global optimization," J. Opt. Theory Appl., vol. 104, no. 3, pp. 691-716, Mar. 2000.
24. C. Y. T. Ma, D. K. Y. Yau, N. K. Yip, N. S. V. Rao, and J. Chen, "Stochastic steepest descent optimization of multiple-objective mobile sensor coverage," Purdue Univ., West Lafayette, IN, Dec. 2011.