메뉴 건너뛰기




Volumn , Issue , 2004, Pages 302-308

Theoretical analysis of the multi-agent patrolling problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER WARGAME SIMULATIONS; MULTI AGENT CYCLIC STRATEGY; MULTI-ROBOT PATROLLING PROBLEM; PATROLLING ALGORITHMS;

EID: 16244370077     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (244)

References (9)
  • 2
    • 0006965219 scopus 로고    scopus 로고
    • Coordinated unit movement
    • January
    • Pottinger, Dave C.: Coordinated Unit Movement. Game Developer (January 1999) 42-51
    • (1999) Game Developer , pp. 42-51
    • Pottinger, D.C.1
  • 3
  • 4
    • 84957638169 scopus 로고    scopus 로고
    • The patrolling problem
    • Chevaleyre, Y. (2003). The patrolling problem. Tech. Rep. of Univ. Paris 9. Available in french at http://11.lamsade.dauphine.fr/~chevaley/patrol
    • (2003) Tech. Rep. of Univ. Paris 9
    • Chevaleyre, Y.1
  • 5
    • 0003522092 scopus 로고
    • Worst-case analysis of a new heuristic for the travelling salesman problem
    • Carnegie Mellon University, Graduate School of Industrial Administration
    • Christofides, N. (1976). Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep. CS-93-13, Carnegie Mellon University, Graduate School of Industrial Administration.
    • (1976) Tech. Rep. , vol.CS-93-13
    • Christofides, N.1
  • 6
    • 21844527073 scopus 로고
    • The traveling salesman: Computational solutions for TSP applications
    • Springer-Verlag
    • Reinelt G., (1994), "The Traveling Salesman: Computational Solutions for TSP Applications," Lectures Notes in Computer Science 840, Springer-Verlag.
    • (1994) Lectures Notes in Computer Science , vol.840
    • Reinelt, G.1


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