Domain-abstraction based learning methods for online planning온라인 계획을 위한 도메인 추상화 기반 학습 기법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 86
  • Download : 0
In this dissertation, the online planning algorithm is proposed for a multi-goal mission in multiple domains. Real systems require online planning due to the uncertainty of information. However, the lack of computational power made it difficult to apply the existing planning methods to real systems. To overcome this limitation, research on learning a planning method based on a deep learning technique has recently been proposed. Although deep learning has been successfully implemented to solve many planning problems in a domain-specific setting, developing a learning method to solve multi-goal/domain planning problems is still a challenging task. The presence of multiple targets and domains increases the state space. The dilated state space of multi-goal/domain problems diminishes planning and learning efficiency. This dissertation aims to develop a dimensionality reduction framework for multi-goal mission planning problems in multi-domain. A state-space can be divided into a domain state and a system state. The domain state refers to information about the domain in which the mission is performed, such as obstacles, threats, and terrain. In many cases, the domain state is high dimensional but sparse. Inspired by observations, the abstraction is adopted in this dissertation to reduce the dimensions of domain space into a compact form. The system state consists of information indicating the current system, such as position and health, and information indicating the completion of goals. As the number of goals increases, the size of the system state grows exponentially in multi-goal problems. Some types of tasks in robotics can be treated as episodic sparse reward tasks. This fact makes it possible to deal efficiently with complex multi-goal problems. The approximation method for the value of a multi-goal problem is proposed by combining the value of single-goal problems. Based on the aforementioned dimensional reductions, a network structure that can efficiently learn the value function of multiple goals/domains is proposed. Numerical studies and simulations are conducted to demonstrate the efficiency and effectiveness of the proposed framework.
Choi, Han-Limresearcher최한림researcher
한국과학기술원 :항공우주공학과,
Issue Date

학위논문(박사) - 한국과학기술원 : 항공우주공학과, 2022.8,[vi, 93 p. :]


Learning for planning▼aOnline planning▼aState abstraction; 계획 학습▼a온라인 계획▼a상태 추상화

Appears in Collection
Files in This Item
There are no files associated with this item.


  • mendeley


rss_1.0 rss_2.0 atom_1.0