(A) coevolutionary numerical solver for minimax problems = 공동 진화 연산을 이용한 미니맥스 문제의 수치해법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 284
  • Download : 0
Traditional numerical solvers for minimax problems were calculus based. In this paper, to overcome the disadvantages of calculus based methods we propose an evolutionary computation based numerical solver for minimax problems. Evolutionary computation is a stochastic optimization techique which can outperform conventional optimization methods. We can view the minimax problem as a game between two players with different objectives. One player trying to minimize the cost and the other trying to maximize it where strategies can be expressed as populations. The strategies from each players are matched and scored. Only the best strategies will survive for each players. The surviving strategies will make offsprings for the next generation. This process is iterated until pre-assigned terminal conditions are satisfied. We also consider the relative evaluation method for faster convergence and find an optimal matching number of the game. The proposed technique is applied to a missile acceleration control problem for verification.
Advisors
Tahk, Min-Jearesearcher탁민제researcher
Description
한국과학기술원 : 항공우주공학과,
Publisher
한국과학기술원
Issue Date
1998
Identifier
133501/325007 / 000963272
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 항공우주공학과, 1998.2, [ [42] p. ]

Keywords

Evolutionary algorithm; Minimax problem; Autopilot design; 자동 조종장치 설계; 진화 알고리듬; 미니맥스 문제

URI
http://hdl.handle.net/10203/26815
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=133501&flag=dissertation
Appears in Collection
AE-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