Localizing Complex Terrain for Quadruped Robots using Adaptive Submodularity;Localizing Complex Terrain for Quadruped Robots using Adaptive Submodularity

NCU Institutional Repository > 理學院 > 數學研究所 > 博碩士論文 > Item 987654321/93513

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/93513

題名:	Localizing Complex Terrain for Quadruped Robots using Adaptive Submodularity;Localizing Complex Terrain for Quadruped Robots using Adaptive Submodularity
作者:	張軒旗;Chang, Hsuan-Chi
貢獻者:	數學系
關鍵詞:	次模性;多足運動;最大覆蓋問題;觸摸定位;Submodularity;Legged Locomotion;Maximal coverage problem;Touch Localization
日期:	2023-04-19
上傳時間:	2024-09-19 17:09:52 (UTC+8)
出版者:	國立中央大學
摘要:	近年以來，多足機器人的運動學已被廣泛研究。該研究領域的主要問題在於環境的不確定性。為了解決這個問題，本研究提出了一種稱為Adaptive Submodularity with Hypothesis Pruning(ASHP)的方法，將不規則地形上的運動問題重新定義為覆蓋Perlin Noise領域中的問題。多足機器人能夠在沒有外部感受器的情況下，漸漸地適應在復雜地形上的運動。Adaptive Submodularity在本文中被應用於預測地形的樣貌，並提供相關的理論保證值。模擬和實驗顯示出本文提出的方法相比於Random Selection有更小的預測誤差，且相較於其他的模型(RMA)有更高的成功率及穩定性。;The locomotion of the legged robot has been widely researched in recent years. The main issue in this research area is environmental uncertainty. To overcome this issue, this research proposed a method called Adaptive Submodularity with Hypothesis Pruning(ASHP), which reformulates the locomotion problem on irregular terrains as the coverage problem in the Perlin domain. The legged robot is able to adaptively select locomotion over complex terrains without exteroceptive sensors. The adaptive submodularity is utilized to predict the terrain with theoretical guarantees. The simulations and experiments demonstrate that the proposed approach has less prediction error and a higher success rate than the benchmark, the experiments also show that ASHP is more robust than the benchmark method(RMA).
顯示於類別:	[數學研究所] 博碩士論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	13	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....