모션계획을 위한 강화학습 기반 트리 편향 확장 기술�Bias tree expansion using reinforcement learning �for efficient motion planning�
윤민성1, 박대형1, 윤성의1
1한국과학기술원(KAIST), 전산학부
Motion Planning
Motion Planning (MP) is a computational problem to find a sequence of valid configurations that moves the object from the source to destination.
Background
Sampling-based Motion Planning basically expands the tree structure using random sampling.
: Randomly sampled node
: start configuration
: goal configuration
: Found path
Tree expansion
Background
Recently, a network learned from near optimal data began to be used as a bias for expansion of the tree.
: randomly sampled node
: node generated by network
: start configuration
: goal configuration
Tree expansion
Related work�
Motion Planning Network (T-RO 2020)
Motivation
�
Stanford CS234: Reinforcement Learning Winter 2020�
RL-RRT*
RL-RRT* expansion progress
: randomly sampled node
: node generated by network
RL-RRT*
RL-RRT*
Experiment setting
[1] RRT* :random sampling 100%
[2] MPNet :random sampling 50% + network bias 50%
��[3] RL_RRT* :random sampling 50% + network bias 50%
(Ours)
Training efficiency
Experiment Result - 2D
Network bias quality
trained with
Supervised Learning (SL)
: Goal configuration
trained with
Reinforcement Learning (RL)
: Network bias
MPNet
RL_RRT*
Thanks for listening.
FP3-2-13
Minsung Yoon
Sung-Eui Yoon
Daehyung Park