Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Bioresources and Agriculture / 生物資源暨農學院
  3. Biomechatronics Engineering / 生物機電工程學系
  4. Gait Planning and Analysis for Stair Climbing of Snake Robot
 
  • Details

Gait Planning and Analysis for Stair Climbing of Snake Robot

Date Issued
2007
Date
2007
Author(s)
Hsieh, Chang-Yu
DOI
zh-TW
URI
http://ntur.lib.ntu.edu.tw//handle/246246/52922
Abstract
This research developed a stair-climbing algorithm for a 3D snake robot. According to the limitation of structure, the analysis of torque and the consideration of spaces, the research finds 6 rules to systematically plan the gaits of stair climbing, and develops a six-stage climbing algorithm. The six stages can be described as below. Stage 1:Lifting the first some units of snake robot and hooking stair n+1. For stability and safety during lifting, we have to take the position of center of gravity into consideration. Dividing the gaits into several steps control the position of center of gravity to prevent the snake from falling during lifting and helps lower the maximal torque of lifting units. Stage 2 & 3:Use the rear some units to raise up the body. The stable torque of units on the stair n+1 must be greater than that of units to be lifted with no risk of falling downwards. Stage 4:Shifting the center of gravity of snake robot to stair n+1. Stage 5:The rear some units lift up to stair n+1. The stable torque of units on the stair n+1 must also be greater than that of units to be lifted with no risk of falling downwards. Stage 6:In order to climb next stair, snake robot has to return to initial position. In the six-stage processes, we consider three essentials. 1. Shifting the center of gravity of snake robot from stair n to stair n+1. 2. Rotating directions (pitch and yaw) have to be taken into account during climbing. 3. Considering the spatial limitation while climbing. The six-stage algorithm generates gaits that assure stability and safety during climbing and offer substitutions for step-by-step manual control. Besides the simplification of climbing processes, it also provides the order of units and angles to be rotated in every stage. The result of experiment indicates that snake robot successfully climbs different stairs with the systematic gaits calculation methods where the snake robot can consist of from 8 units to 12 units. The snake can accomplish one-stair climbing in 11 seconds. What's more, the research provides the information for determining the least number of units needed so as to simplify the mechanism and reduce the cost.
Subjects
機器蛇
步態規劃
攀爬階梯
遠端遙控
Snake robot
Gait planning
Stair climbing algorithm
Bio-mimetic Robot
Remote control
Type
thesis

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science