Dissertation/Thesis Abstract

Energy-efficient Gait Control Schema of a Hexapod Robot with Dynamic Leg Lengths
by Cafarelli, Ryan, M.S., Southern Illinois University at Edwardsville, 2017, 119; 10684042
Abstract (Summary)

Walking robots consume considerable amounts of power, which leads to short mission times. Many of the tasks that require the use of walking robots, rather than wheeled, often require extended periods of time between the possibility of charging. Therefore, it is extremely important that, whenever possible, the gait a walking robot uses is as efficient as possible in order to extend overall mission time. Many approaches have been used in order to optimize the gait of a hexapod robot; however, little research has been done on how enabling the leg segments of a hexapod to extend will impact the efficiency of its gait. In this thesis, a joint space model is defined that includes both rotational joints as well as prismatic joints for expanding and contracting individual leg segments. A genetic algorithm (GA) is used to optimize the efficiency of a gait using the joint space based on a tripod gait. Other considerations for the gait include stability and dragging, which affects overall efficiency of a gait. The results of preliminary runs of the GA show the impacts of changing the weights of a multi-objective function, the number of generations, the number of parents retained between generations and the mutation rate. Further experiments show the impact of dynamic leg lengths on the overall efficiency of a hexapod tripod gait.

Indexing (document details)
Advisor: Mayer, Gary
Commitee: Bouvier, Dennis, Crk, Igor, Weinberg, Jerry
School: Southern Illinois University at Edwardsville
Department: Computer Science
School Location: United States -- Illinois
Source: MAI 57/02M(E), Masters Abstracts International
Source Type: DISSERTATION
Subjects: Robotics
Keywords: Dynamic leg length, Gait, Hexapod, Linear actuator, Prismatic, Robot
Publication Number: 10684042
ISBN: 9780355540611
Copyright © 2018 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest