Apply the K-line theory to generate humanoid robot actions
碩士 === 國立雲林科技大學 === 資訊管理系碩士班 === 101 === This paper builds a hybrid genetic algorithm which combines the K-line theory and the Seek-Whence theory with genetic algorithm. Bioloid humanoid robots can use this mechanism to innovate or recall dances. Different from general dancing robots, this mechanism...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/44792792082288616267 |
id |
ndltd-TW-101YUNT5396068 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101YUNT53960682015-10-13T22:57:22Z http://ndltd.ncl.edu.tw/handle/44792792082288616267 Apply the K-line theory to generate humanoid robot actions 應用 K-line 理論於人型機器人動作之研究 Hsing-Jung Wu 吳幸蓉 碩士 國立雲林科技大學 資訊管理系碩士班 101 This paper builds a hybrid genetic algorithm which combines the K-line theory and the Seek-Whence theory with genetic algorithm. Bioloid humanoid robots can use this mechanism to innovate or recall dances. Different from general dancing robots, this mechanism makes humanoid robots learn and recall to create more creative dance from existent dance step database. This study uses the Bioloid robot developed by Robotis Company as a research platform. In many different kinds of situation, using hybrid genetic algorithm and pure genetic algorithm and compare which mechanism is better at innovating and recalling dances. First is deciding the way of creating target dances and similarity thresholds. There are two ways to create target, one is randomly generate dance steps to combine dance, and another is choosing from dance step database to combine dance. Moreover, the similarity threshold is divided into four thresholds, including 10%, 30%, 50% and 70%, and using hybrid genetic algorithm and pure genetic algorithm to achieve the target dances and similarity thresholds. After achieving that, it computes the total average times that two algorithms waste in the process and the real similarity which two algorithms achieve. It uses total average time and real similarity to decide which mechanism is better at innovate or recall dances. This study is using computer simulation experiment. From the experiment result, when the target dance is the same and the dance is combine with the dance steps which is chosen from the dance steps database, hybrid genetic algorithm is good at memorizing dance and it spend short time in recalling when the similarity threshold is 70%. No matter in single or multiple target dance, when he dance is combine with the dance steps which is chosen from the dance steps database or randomly generate, the pure genetic algorithm’s recalling ability is the same as the hybrid genetic algorithm. But the pure genetic algorithm spend less time than the hybrid genetic algorithm. Jong-Chen Chen 陳重臣 2013 學位論文 ; thesis 78 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立雲林科技大學 === 資訊管理系碩士班 === 101 === This paper builds a hybrid genetic algorithm which combines the K-line theory and the Seek-Whence theory with genetic algorithm. Bioloid humanoid robots can use this mechanism to innovate or recall dances. Different from general dancing robots, this mechanism makes humanoid robots learn and recall to create more creative dance from existent dance step database.
This study uses the Bioloid robot developed by Robotis Company as a research platform. In many different kinds of situation, using hybrid genetic algorithm and pure genetic algorithm and compare which mechanism is better at innovating and recalling dances. First is deciding the way of creating target dances and similarity thresholds. There are two ways to create target, one is randomly generate dance steps to combine dance, and another is choosing from
dance step database to combine dance. Moreover, the similarity threshold is divided into four thresholds, including 10%, 30%, 50% and 70%, and using hybrid genetic algorithm and pure genetic algorithm to achieve the target dances and similarity thresholds. After achieving that, it computes the total average times that two algorithms waste in the process and the real similarity which two algorithms achieve. It uses total average time and real similarity to decide which mechanism is better at innovate or recall dances.
This study is using computer simulation experiment. From the experiment result, when the target dance is the same and the dance is combine with the dance steps which is chosen from the dance steps database, hybrid genetic algorithm is good at memorizing dance and it spend
short time in recalling when the similarity threshold is 70%. No matter in single or multiple target dance, when he dance is combine with the dance steps which is chosen from the dance steps database or randomly generate, the pure genetic algorithm’s recalling ability is the same as the hybrid genetic algorithm. But the pure genetic algorithm spend less time than the hybrid genetic algorithm.
|
author2 |
Jong-Chen Chen |
author_facet |
Jong-Chen Chen Hsing-Jung Wu 吳幸蓉 |
author |
Hsing-Jung Wu 吳幸蓉 |
spellingShingle |
Hsing-Jung Wu 吳幸蓉 Apply the K-line theory to generate humanoid robot actions |
author_sort |
Hsing-Jung Wu |
title |
Apply the K-line theory to generate humanoid robot actions |
title_short |
Apply the K-line theory to generate humanoid robot actions |
title_full |
Apply the K-line theory to generate humanoid robot actions |
title_fullStr |
Apply the K-line theory to generate humanoid robot actions |
title_full_unstemmed |
Apply the K-line theory to generate humanoid robot actions |
title_sort |
apply the k-line theory to generate humanoid robot actions |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/44792792082288616267 |
work_keys_str_mv |
AT hsingjungwu applytheklinetheorytogeneratehumanoidrobotactions AT wúxìngróng applytheklinetheorytogeneratehumanoidrobotactions AT hsingjungwu yīngyòngklinelǐlùnyúrénxíngjīqìréndòngzuòzhīyánjiū AT wúxìngróng yīngyòngklinelǐlùnyúrénxíngjīqìréndòngzuòzhīyánjiū |
_version_ |
1718082938362396672 |