SCOPUS 정보 검색 플랫폼

Volumn 1, Issue , 2002, Pages 618-623

A complete pursuit-evasion algorithm for two pursuers using beam detection

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; POLYNOMIALS; ROBOTICS; TWO DIMENSIONAL;

BEAM DETECTION; PURSUIT-EVASION ALGORITHM;

MOBILE ROBOTS;

EID: 0036056261 PISSN: 10504729 EISSN: None Source Type: Journal
DOI: 10.1109/ROBOT.2002.1013427 Document Type: Article

Times cited : (9)

References (10)

1
- 0026930270
- Searching for a mobile intruder in a polygonal region
- (1992) SIAM J. on Computing , vol.21 , Issue.5 , pp. 863-888
- Suzuki, I.¹ Yamashita, M.²

2
- 0034390368
- Searching a polygonal room with a door by a 1-searcher
- (2000) Int. J. of Comput. Geom. & Applic. , vol.8 , Issue.2 , pp. 201-220
- Lee, J.-H.¹ Park, S.-M.² Chwa, K.-Y.³

3
- 0035613136
- Searching a polygonal region from the boundary
- (2001) Int. J. of Comput. Geom. & Applic. , vol.11 , Issue.5 , pp. 529-553
- Suzuki, I.¹ Tazoe, Y.² Yamashita, M.³ Kameda, T.⁴

4
- 0033705183
- Pursuit-evasion using beam detection
- Proc. IEEE ICRA, 2000 , pp. 1657-1662
- Simov, B.H.¹ Slutzki, G.² LaValle, S.M.³

5
- 0037761626
- Visibility-based pursuit-evasion in a polygonal region by a searcher
- Tech. Rep. CS-TR-2001-161, KAIST
- (2001)
- Park, S.-M.¹ Lee, J.-H.² Chwa, K.-Y.³

6
- 0030654376
- Finding an unpredictable target in a workspace with obstacles
- Proc. IEEE ICRA, 1997 , pp. 737-742
- LaValle, S.M.¹ Lin, D.² Guibas, L.J.³ Latombe, J.-C.⁴ Motwani, R.⁵

7
- 0000325097
- The two guards problem
- (1992) Int. J. of Comput. Geom. & Applic. , vol.2 , Issue.3 , pp. 257-285
- Icking, C.¹ Klein, R.²

8
- 0032358771
- Two-guard walkability of simple polygons
- Feb
- (1998) Int. J. of Comput. Geom. & Applic. , vol.8 , Issue.1 , pp. 85-116
- Tseng, L.H.¹ Heffernan, P.C.² Lee, D.T.³

10
- 0034876287
- A pursuit-evasion BUG algorithm
- Proc. IEEE ICRA, 2001
- Rajko, S.¹ LaValle, S.M.²

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