• Title/Summary/Keyword: 준측지 궤적 알고리즘

Search Result 2, Processing Time 0.022 seconds

Optimal design of composite pressure vessel for fuel cell vehicle using genetic algorithm (유전자 알고리즘을 이용한 수소 연료 자동차용 복합재 압력용기의 최적설계)

  • Kang, Sang-Guk;Kim, Myung-Gon;Kim, Chun-Gon
    • Proceedings of the KSME Conference
    • /
    • 2007.05a
    • /
    • pp.23-27
    • /
    • 2007
  • To store hydrogen with high pressure is one of key technologies in developing FCVs (fuel cell vehicles). Especially, metal lined composite structure, which is called Type 3, is expected to effectively stand highly pressurized hydrogen since it has high specific strength and stiffness as well as excellent storage ability. However, it has many difficulties to design Type 3 vessels because of their complex geometry, fabrication process variables, etc. In this study, therefore, optimal design of Type 3 vessels was performed in consideration of such actual circumstances using genetic algorithm. Additionally, detailed finite element analysis was followed for the optimal result.

  • PDF

Efficient Approximation of State Space for Reinforcement Learning Using Complex Network Models (복잡계망 모델을 사용한 강화 학습 상태 공간의 효율적인 근사)

  • Yi, Seung-Joon;Eom, Jae-Hong;Zhang, Byoung-Tak
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.6
    • /
    • pp.479-490
    • /
    • 2009
  • A number of temporal abstraction approaches have been suggested so far to handle the high computational complexity of Markov decision problems (MDPs). Although the structure of temporal abstraction can significantly affect the efficiency of solving the MDP, to our knowledge none of current temporal abstraction approaches explicitly consider the relationship between topology and efficiency. In this paper, we first show that a topological measurement from complex network literature, mean geodesic distance, can reflect the efficiency of solving MDP. Based on this, we build an incremental method to systematically build temporal abstractions using a network model that guarantees a small mean geodesic distance. We test our algorithm on a realistic 3D game environment, and experimental results show that our model has subpolynomial growth of mean geodesic distance according to problem size, which enables efficient solving of resulting MDP.