(A) heuristic algorithm for patrol path planning of an unmanned combat vehicle = 무인 전투차량 순찰경로에 대한 휴리스틱 알고리듬에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 295
  • Download : 0
We consider an operations problem for an unmanned combat vehicle (UCV) in a military. The problem is to schedule a patrol path for the UCV on a set of key terrains with the objective of minimizing total threats being generated by a possible infiltration of the enemy in a forward area. In this study, threats on each key terrain are increased in nonlinear way by interval of patrols and the key terrains can be patrolled multiple times with a given mission time (2-hour) for the UCV. In order to get the objective, we make a sequence of patrolling key terrains to minimize the total threats. For making the sequence, we develop four heuristic algorithms which are composed of two-step procedure. For evaluation of the performance of the proposed heuristic, computational experiments are performed on randomly generated data sets, and results show that the algorithm gives a good solution for the problem in a short time.
Advisors
Kim, Yeong-Daeresearcher김영대researcher
Description
한국과학기술원 : 산업및시스템공학과,
Publisher
한국과학기술원
Issue Date
2011
Identifier
467665/325007  / 020093221
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업및시스템공학과, 2011.2, [ iv, 53 p. ]

Keywords

unmanned combat vehicle; patrol path; heuristic; mission time; 무인 전투차량; 순찰경로; 휴리스틱; 임무시간; 위험; risk

URI
http://hdl.handle.net/10203/182525
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=467665&flag=dissertation
Appears in Collection
IE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0