Towards Agility: Definition, Benchmark and Design Considerations for Small, Quadrupedal Robots

Agile quadrupedal locomotion in animals and robots is yet to be fully understood, quantified or achieved. An intuitive notion of agility exists, but neither a concise definition nor a common benchmark can be found. Further, it is unclear, what minimal level of mechatronic complexity is needed for this particular aspect of locomotion. In this thesis we address and partially answer two primary questions: (Q1) What is agile legged locomotion (agility) and how can wemeasure it? (Q2) How can wemake agile legged locomotion with a robot a reality? To answer our first question, we define agility for robot and animal alike, building a common ground for this particular component of locomotion and introduce quantitative measures to enhance robot evaluation and comparison. The definition is based on and inspired by features of agility observed in nature, sports, and suggested in robotics related publications. Using the results of this observational and literature review, we build a novel and extendable benchmark of thirteen different tasks that implement our vision of quantitatively classifying agility. All scores are calculated from simple measures, such as time, distance, angles and characteristic geometric values for robot scaling. We normalize all unit-less scores to reach comparability between different systems. An initial implementation with available robots and real agility-dogs as baseline finalize our effort of answering the first question. Bio-inspired designs introducing and benefiting from morphological aspects present in nature allowed the generation of fast, robust and energy efficient locomotion. We use engineering tools and interdisciplinary knowledge transferred from biology to build low-cost robots able to achieve a certain level of agility and as a result of this addressing our second question. This iterative process led to a series of robots from Lynx over Cheetah-Cub-S, Cheetah-Cub-AL, and Oncilla to Serval, a compliant robot with actuated spine, high range of motion in all joints. Serval presents a high level of mobility at medium speeds. With many successfully implemented skills, using a basic kinematics-duplication from dogs (copying the foot-trajectories of real animals and replaying themotion on the robot using a mathematical interpretation), we found strengths to emphasize, weaknesses to correct and made Serval ready for future attempts to achieve even more agile locomotion. We calculated Servalâs agility scores with the result of it performing better than any of its predecessors. Our small, safe and low-cost robot is able to execute up to 6 agility tasks out of 13 with the potential to reachmore after extended development. Concluding, we like to mention that Serval is able to cope with step-downs, smooth, bumpy terrain and falling orthogonally to the ground

Climbing and Walking Robots

With the advancement of technology, new exciting approaches enable us to render mobile robotic systems more versatile, robust and cost-efficient. Some researchers combine climbing and walking techniques with a modular approach, a reconfigurable approach, or a swarm approach to realize novel prototypes as flexible mobile robotic platforms featuring all necessary locomotion capabilities. The purpose of this book is to provide an overview of the latest wide-range achievements in climbing and walking robotic technology to researchers, scientists, and engineers throughout the world. Different aspects including control simulation, locomotion realization, methodology, and system integration are presented from the scientific and from the technical point of view. This book consists of two main parts, one dealing with walking robots, the second with climbing robots. The content is also grouped by theoretical research and applicative realization. Every chapter offers a considerable amount of interesting and useful information

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp