메뉴 건너뛰기




Volumn 23, Issue 4, 2007, Pages 676-692

Stochastic event capture using mobile sensors subject to a quality metric

Author keywords

Algorithms; Mobile robot motion planning; Mobile sensor networks; Robot sensing systems

Indexed keywords

HEURISTIC ALGORITHMS; MOTION PLANNING; OPTIMIZATION; PROBABILITY; SENSOR NETWORKS; STOCHASTIC MODELS; VELOCITY;

EID: 34548161471     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2007.900628     Document Type: Article
Times cited : (47)

References (42)
  • 2
    • 0345851235 scopus 로고    scopus 로고
    • Wireless integrated network sensors
    • G. J. Pottie and W. J. Kaiser, "Wireless integrated network sensors," Commun. ACM, vol. 43, no. 5, pp. 51-58, 2000.
    • (2000) Commun. ACM , vol.43 , Issue.5 , pp. 51-58
    • Pottie, G.J.1    Kaiser, W.J.2
  • 19
    • 77952010176 scopus 로고    scopus 로고
    • Cambridge, UK, Cambridge Univ. Press [Online, Available
    • S. M. LaValle. (2006). Planning algorithms. Cambridge, UK.: Cambridge Univ. Press [Online]. Available http://msl.cs.uiuc.edu/ planning/
    • (2006) Planning algorithms
    • LaValle, S.M.1
  • 21
    • 3042785829 scopus 로고    scopus 로고
    • Network coverage using low duty-cycled sensors: Random & coordinated sleep algorithms
    • New Yor: ACM Press
    • C. fan Hsin and M. Liu, "Network coverage using low duty-cycled sensors: Random & coordinated sleep algorithms," in Proc. 4th Int. Symp. Inf. Process. Sensor Netw. (IPSN), New Yor: ACM Press, 2004, pp. 433-442.
    • (2004) Proc. 4th Int. Symp. Inf. Process. Sensor Netw. (IPSN) , pp. 433-442
    • fan Hsin, C.1    Liu, M.2
  • 23
    • 0036983403 scopus 로고    scopus 로고
    • A coverage-preserving node scheduling scheme for large wireless sensor networks
    • New York: ACM Press
    • D. Tian and N. D. Georganas, "A coverage-preserving node scheduling scheme for large wireless sensor networks," in Proc. 2nd ACM Int. Conf. Wireless Sensor Netw. Appl. (WSNA), New York: ACM Press, 2002, pp. 32-41.
    • (2002) Proc. 2nd ACM Int. Conf. Wireless Sensor Netw. Appl. (WSNA) , pp. 32-41
    • Tian, D.1    Georganas, N.D.2
  • 24
    • 0037630649 scopus 로고    scopus 로고
    • PEAS: A robust energy conserving protocol for long-lived sensor networks
    • Washington, DC: IEEE Comput. Soc, p
    • F. Ye, G. Zhong, J. Cheng, S. Lu, and L. Zhang, "PEAS: A robust energy conserving protocol for long-lived sensor networks," in Proc. ICDCS 2003, Washington, DC: IEEE Comput. Soc., p. 28.
    • Proc. ICDCS 2003 , pp. 28
    • Ye, F.1    Zhong, G.2    Cheng, J.3    Lu, S.4    Zhang, L.5
  • 26
    • 0036738161 scopus 로고    scopus 로고
    • Exposure in wireless sensor networks: Theory and practical solutions
    • S. Megerian, F. Koushanfar, G. Qu, G. Veltri, and M. Potkonjak, "Exposure in wireless sensor networks: Theory and practical solutions," Wireless Netw., vol. 8, no. 5, pp. 443-454, 2002.
    • (2002) Wireless Netw , vol.8 , Issue.5 , pp. 443-454
    • Megerian, S.1    Koushanfar, F.2    Qu, G.3    Veltri, G.4    Potkonjak, M.5
  • 27
  • 28
    • 0010418638 scopus 로고    scopus 로고
    • Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem
    • Jun
    • A. Howard, M. J. Mataric, and G. S. Sukhatme, "Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem," in Proc. Int. Symp. Distrib. Auton. Robot. Syst. (DARS), Jun. 2002, pp. 299-308.
    • (2002) Proc. Int. Symp. Distrib. Auton. Robot. Syst. (DARS) , pp. 299-308
    • Howard, A.1    Mataric, M.J.2    Sukhatme, G.S.3
  • 33
    • 53349150186 scopus 로고    scopus 로고
    • Efficient routing of multiple vehicles with no communications
    • to be published
    • A. Arsie and E. Frazzoli, "Efficient routing of multiple vehicles with no communications," Int. J. Robust Nonlinear Control, to be published.
    • Int. J. Robust Nonlinear Control
    • Arsie, A.1    Frazzoli, E.2
  • 35
    • 0035616724 scopus 로고    scopus 로고
    • Coverage for robotics - A survey of recent results
    • H. Choset, "Coverage for robotics - A survey of recent results," Ann. Math. Artif. Intell., vol. 31, no. 1-4, pp. 113-126, 2001.
    • (2001) Ann. Math. Artif. Intell , vol.31 , Issue.1-4 , pp. 113-126
    • Choset, H.1
  • 37
    • 33745151404 scopus 로고    scopus 로고
    • Deployment of mobile robots with energy and timing constraints
    • Jun
    • Y. Mei, Y.-H. Lu, Y. C. Hu, and C. S. G. Lee, "Deployment of mobile robots with energy and timing constraints," IEEE Trans. Robot., vol. 22, no. 3, pp. 507-522, Jun. 2006.
    • (2006) IEEE Trans. Robot , vol.22 , Issue.3 , pp. 507-522
    • Mei, Y.1    Lu, Y.-H.2    Hu, Y.C.3    Lee, C.S.G.4
  • 39
    • 35649015275 scopus 로고    scopus 로고
    • Nov.). The multiple traveling salesman problem with time windows: Bounds for the minimum number of vehicles
    • Tech. Rep. TR 2002-11, Online, Available
    • S. Mitrovic-Minic and R. Krishnamutri. (2002, Nov.). The multiple traveling salesman problem with time windows: Bounds for the minimum number of vehicles, Tech. Rep. TR 2002-11, [Online]. Available: Ftp:// fas.sfu.ca/pub/cs/TR/2002/CMPT2002-11.pdf
    • (2002)
    • Mitrovic-Minic, S.1    Krishnamutri, R.2
  • 41
    • 26444452310 scopus 로고    scopus 로고
    • Approximation algorithms for TSP with neighborhoods in the plane
    • Philadelphia, PA: Soc. Ind. Appl. Math
    • A. Dumitrescu and J. S. B. Mitchell, "Approximation algorithms for TSP with neighborhoods in the plane," in Proc. Symp. Discrete Algorithms (SODA), Philadelphia, PA: Soc. Ind. Appl. Math., 2001, pp. 38-46.
    • (2001) Proc. Symp. Discrete Algorithms (SODA) , pp. 38-46
    • Dumitrescu, A.1    Mitchell, J.S.B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.