Improving probabilistic planner with generalized neural policy일반화된 신경망 정책 기반 확률적 계획법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 101
  • Download : 0
In this paper, we propose a method of combining generalized neural network-based policy and the existing search-based planner when solving probabilistic planning problems with large states and action spaces. The policy based on the graph neural network structure is learned by mimicking the existing search-based planner in small-sized planning problems, and the learned policy guides the search direction of the planner in large planning problems that the original planner cannot solve. Comparing the proposed framework with the original planner and policy learning based on reinforcement learning, the proposed methodology has been shown to help improve the performance of the planner. Also, our work can be used as a baseline in the field of automatic planning based on deep learning.
Advisors
Kim, Kee-Eungresearcher김기응researcher
Description
한국과학기술원 :전산학부,
Publisher
한국과학기술원
Issue Date
2021
Identifier
325007
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학부, 2021.2,[iii, 14 p. :]

Keywords

Probabilistic Planning▼aMonte-Carlo Tree Search▼aReinforcement Learning; 확률적 계획▼a몬테칼로 트리 탐색▼a강화 학습

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