메뉴 건너뛰기




Volumn 62, Issue 3-4, 2011, Pages 329-353

A sensor placement algorithm for a mobile robot inspection planning

Author keywords

Art gallery problem; Inspection path planning; Mobile robotics; Sensor placement

Indexed keywords

ART GALLERY PROBLEM; FEASIBLE SOLUTION; INSPECTION PLANNING; MOBILE ROBOT INSPECTION; MOBILE ROBOTIC; OVERALL QUALITY; PATH PLANNING PROBLEMS; PRIOR KNOWLEDGE; RANDOMIZATION PROCESS; RANDOMIZED APPROACH; REAL ENVIRONMENTS; SENSOR PLACEMENT; SOLUTION PROCESS; SUB-PROBLEMS;

EID: 79960153450     PISSN: 09210296     EISSN: 15730409     Source Type: Journal    
DOI: 10.1007/s10846-010-9449-0     Document Type: Article
Times cited : (24)

References (34)
  • 4
    • 38149146191 scopus 로고
    • Covering polygons is hard
    • Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J. Algorithms 17(1), 2-44 (1994).
    • (1994) J. Algorithms , vol.17 , Issue.1 , pp. 2-44
    • Culberson, J.C.1    Reckhow, R.A.2
  • 5
    • 0041669404 scopus 로고    scopus 로고
    • Finding shortest safari routes in simple polygons
    • Tan, X., Hirata, T.: Finding shortest safari routes in simple polygons. Inf. Process. Lett. 87(4), 179-186 (2003).
    • (2003) Inf. Process. Lett. , vol.87 , Issue.4 , pp. 179-186
    • Tan, X.1    Hirata, T.2
  • 6
    • 0001260940 scopus 로고
    • Watchman routes under limited visibility
    • Ntafos, S.C.: Watchman routes under limited visibility. Comput. Geom. 1, 149-170 (1992).
    • (1992) Comput. Geom. , vol.1 , pp. 149-170
    • Ntafos, S.C.1
  • 7
    • 49949104679 scopus 로고    scopus 로고
    • An approximate algorithm for solving the watchman route problem
    • Li, F., Klette, R.: An approximate algorithm for solving the watchman route problem. In:RobVis, pp. 189-206 (2008).
    • (2008) RobVis , pp. 189-206
    • Li, F.1    Klette, R.2
  • 11
    • 33646039255 scopus 로고    scopus 로고
    • Planning robot motions for range-image acquisition and automatic 3d model construction
    • González-Baños, H.H., Latombe, J.-C.: Planning robot motions for range-image acquisition and automatic 3d model construction. In: AAAI Fall Symposium (1998).
    • (1998) AAAI Fall Symposium
    • González-Baños, H.H.1    Latombe, J.-C.2
  • 13
    • 33747180822 scopus 로고    scopus 로고
    • Automated camera layout to satisfy task-specific and floor planspecific coverage requirements
    • Erdem, U.M., Sclaroff, S.: Automated camera layout to satisfy task-specific and floor planspecific coverage requirements. Comput. Vis. Image Underst. 103(3), 156-169 (2006).
    • (2006) Comput. Vis. Image Underst. , vol.103 , Issue.3 , pp. 156-169
    • Erdem, U.M.1    Sclaroff, S.2
  • 14
    • 77952426527 scopus 로고    scopus 로고
    • Directional sensor placement with optimal sensing range, field of view and orientation
    • Osais, Y.E., St-Hilaire, M., Yu, F.R.: Directional sensor placement with optimal sensing range, field of view and orientation. Mob. Netw. Appl. 15(2), 216-225 (2008).
    • (2008) Mob. Netw. Appl. , vol.15 , Issue.2 , pp. 216-225
    • Osais, Y.E.1    St-Hilaire, M.2    Yu, F.R.3
  • 16
    • 6344277647 scopus 로고    scopus 로고
    • View planning for automated three-dimensional object reconstruction and inspection
    • Scott, W.R., Roth, G., Rivest, J.-F.: View planning for automated three-dimensional object reconstruction and inspection. ACM Comput. Surv. 35(1), 64-96 (2003).
    • (2003) ACM Comput. Surv. , vol.35 , Issue.1 , pp. 64-96
    • Scott, W.R.1    Roth, G.2    Rivest, J.-F.3
  • 19
    • 0036820827 scopus 로고    scopus 로고
    • Navigation strategies for exploring indoor environments
    • González-Baños, H.H., Latombe, J.-C.: Navigation strategies for exploring indoor environments. Int. J. Rob. Res. 21(10-11), 829-848 (2002).
    • (2002) Int. J. Rob. Res. , vol.21 , Issue.10-11 , pp. 829-848
    • González-Baños, H.H.1    Latombe, J.-C.2
  • 23
    • 0026282692 scopus 로고
    • A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
    • Seidel, R.: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl. 1(1), 51-64 (1991).
    • (1991) Comput. Geom. Theory Appl. , vol.1 , Issue.1 , pp. 51-64
    • Seidel, R.1
  • 24
    • 0033098692 scopus 로고    scopus 로고
    • Convexity rule for shape decomposition based on discrete contour evolution
    • Latecki, L.J., Lakämper, R.: Convexity rule for shape decomposition based on discrete contour evolution. Comput. Vis. Image Underst. 73(3), 441-454 (1999).
    • (1999) Comput. Vis. Image Underst. , vol.73 , Issue.3 , pp. 441-454
    • Latecki, L.J.1    Lakämper, R.2
  • 27
    • 2442515836 scopus 로고    scopus 로고
    • Chained lin-kernighan for large traveling salesman problems
    • Applegate, D., Cook, W., Rohe, A.: Chained lin-kernighan for large traveling salesman problems. INFORMS J. Comput. 15(1), 82-92 (2003).
    • (2003) INFORMS J. Comput. , vol.15 , Issue.1 , pp. 82-92
    • Applegate, D.1    Cook, W.2    Rohe, A.3
  • 28
  • 29
    • 70349595969 scopus 로고    scopus 로고
    • Vecslam: An efficient vector-based slam algorithm for indoor environments
    • Sohn, H.J., Kim, B.K.: Vecslam: an efficient vector-based slam algorithm for indoor environments. J. Intell. Robot. Syst. 56(3), 301-318 (2009).
    • (2009) J. Intell. Robot. Syst. , vol.56 , Issue.3 , pp. 301-318
    • Sohn, H.J.1    Kim, B.K.2
  • 31
    • 33645322570 scopus 로고    scopus 로고
    • Version 1.5, Accessed 23 July 2010
    • JTS Topology Suite. http://www.vividsolutions.com/jts/jtshome.htm. Version 1.5 (2004). Accessed 23 July 2010.
    • (2004) JTS Topology Suite
  • 32
    • 80051793816 scopus 로고    scopus 로고
    • Accessed 23 July 2010
    • Diablo Caffe JDK 1.6.0-7. http://www.freebsdfoundation.org/downloads/ java.shtml (2009). Accessed 23 July 2010.
    • (2009) Diablo Caffe JDK 1.6.0-7


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