Pattern Generation for Walking on Slippery Terrains

In this paper, we extend state of the art Model Predictive Control (MPC) approaches to generate safe bipedal walking on slippery surfaces. In this setting, we formulate walking as a trade off between realizing a desired walking velocity and preserving robust foot-ground contact. Exploiting this formulation inside MPC, we show that safe walking on various flat terrains can be achieved by compromising three main attributes, i. e. walking velocity tracking, the Zero Moment Point (ZMP) modulation, and the Required Coefficient of Friction (RCoF) regulation. Simulation results show that increasing the walking velocity increases the possibility of slippage, while reducing the slippage possibility conflicts with reducing the tip-over possibility of the contact and vice versa.Comment: 6 pages, 7 figure

Doctor of Philosophy

dissertationThis dissertation defines a new class of climbing robots, steering-plane bipeds, which encompasses a large number of existing climbing robots. Three major levels of motion planning are characterized which are common to this class of robots, namely, path planning, step planning, and gait planning. The unified presentation of related motion planning techniques is more generally applicable and more thorough than related algorithms in other literature, while more explicitly identifying limitations and tradeoffs due to alternate design choices within the class of steering-plane bipeds. A novel spline-based method for generating gaits is presented which uses separate path and time rate controls, and explicitly defined foot approach and departure directions that allows 1) a nominal guarantee of collision-free foot trajectories when close to the desired step configuration, 2) independent control of gait shape and speed, and 3) a unified representation of the four gait families of steering-plane bipeds: flipping, inchworm, step-through, and spinning gaits. This dissertation presents a thorough examination of the variations within each gait family, rather than merely presenting a representative instance of each. Concrete case studies applying the techniques of this dissertation are presented for optimizing the gaits for overall speed, energy efficiency, and minimum gripping force and moment. The results highlight that many common gaits in the literature are far from optimal. Results and general rules of thumb for gait planning are extracted that allow guidance for obtaining good results even if using alternate planning techniques without optimization

Virtual Constraints and Hybrid Zero Dynamics for Realizing Underactuated Bipedal Locomotion

Underactuation is ubiquitous in human locomotion and should be ubiquitous in bipedal robotic locomotion as well. This chapter presents a coherent theory for the design of feedback controllers that achieve stable walking gaits in underactuated bipedal robots. Two fundamental tools are introduced, virtual constraints and hybrid zero dynamics. Virtual constraints are relations on the state variables of a mechanical model that are imposed through a time-invariant feedback controller. One of their roles is to synchronize the robot's joints to an internal gait phasing variable. A second role is to induce a low dimensional system, the zero dynamics, that captures the underactuated aspects of a robot's model, without any approximations. To enhance intuition, the relation between physical constraints and virtual constraints is first established. From here, the hybrid zero dynamics of an underactuated bipedal model is developed, and its fundamental role in the design of asymptotically stable walking motions is established. The chapter includes numerous references to robots on which the highlighted techniques have been implemented.Comment: 17 pages, 4 figures, bookchapte

IK-FA, a new heuristic inverse kinematics solver using firefly algorithm

In this paper, a heuristic method based on Firefly Algorithm is proposed for inverse kinematics problems in articulated robotics. The proposal is called, IK-FA. Solving inverse kinematics, IK, consists in finding a set of joint-positions allowing a specific point of the system to achieve a target position. In IK-FA, the Fireflies positions are assumed to be a possible solution for joints elementary motions. For a robotic system with a known forward kinematic model, IK-Fireflies, is used to generate iteratively a set of joint motions, then the forward kinematic model of the system is used to compute the relative Cartesian positions of a specific end-segment, and to compare it to the needed target position. This is a heuristic approach for solving inverse kinematics without computing the inverse model. IK-FA tends to minimize the distance to a target position, the fitness function could be established as the distance between the obtained forward positions and the desired one, it is subject to minimization. In this paper IK-FA is tested over a 3 links articulated planar system, the evaluation is based on statistical analysis of the convergence and the solution quality for 100 tests. The impact of key FA parameters is also investigated with a focus on the impact of the number of fireflies, the impact of the maximum iteration number and also the impact of (a, ß, ¿, d) parameters. For a given set of valuable parameters, the heuristic converges to a static fitness value within a fix maximum number of iterations. IK-FA has a fair convergence time, for the tested configuration, the average was about 2.3394 × 10-3 seconds with a position error fitness around 3.116 × 10-8 for 100 tests. The algorithm showed also evidence of robustness over the target position, since for all conducted tests with a random target position IK-FA achieved a solution with a position error lower or equal to 5.4722 × 10-9.Peer ReviewedPostprint (author's final draft