Study of Orientation Control for a Wheeled Jumping Robot in the Flight Phase of Motion

2019 ◽  
Vol 20 (4) ◽  
pp. 236-243 ◽  
Author(s):  
S. F. Jatsun ◽  
L. Yu. Vorochaeva ◽  
S. I. Savin

The work studies the flight phase (a part of jumping motion) of a jumping robot. The robot consists of the body with wheeled base and a jump booster module installed in the body. The jump booster module allows the robot to accelerate in a given direction up to a predetermined speed, allowing to control the velocity of the robot at the moment when it breaks contact with the supporting surface. The goal of this study is to develop a control system for the robot’s wheels, allowing to use their inertial properties to control the robot orientation at the moment of landing. This is achieved by controlling the wheels’ orientation throughout the duration of the motion. The goal of controlling the orientation of the robot at the moment of landing is to be able to land on all four wheels and avoid tipping over. The paper studies the supporting surfaces (from which the robot jumps and to which the robot lands) described by piecewise linear functions, including a horizontal and slopped linear sub-functions. In this work, four types of supporting surfaces were distinguished, which the distinction based on the slope of the mentioned about sub-function. Another varying parameter is the point where two sub-functions connect. For the purpose of this study a kinematic and dynamic model of the robot were developed, and a control system design was proposed. The proposed control system includes a trajectory planner that allows to plan the robot’s motion resulting in the desired orientation of the robot’s body at the moment of landing. This problem was formulated as an optimization problem. Simulation results showed the dependencies between the three supporting surface parameters (two angles describing linear sub-functions and the point where the sub-functions intersect) and the duration of the robot flight, the achieved velocities of the robot’s wheels and required motor torques. The influence of those parameters on the maximal and minimal values of the wheels’ angular velocities achieved during the flight were demonstrated. This could be used in designing this type of robots, in particular it could help to set specifications for the robot’s wheel motors.

Author(s):  
Arturo Sarmiento-Reyes ◽  
Luis Hernandez-Martinez ◽  
Miguel Angel Gutierrez de Anda ◽  
Francisco Javier Castro Gonzalez

We describe a sense in which mesh duality is equivalent to Legendre duality. That is, a general pair of meshes, which satisfy a definition of duality for meshes, are shown to be the projection of a pair of piecewise linear functions that are dual to each other in the sense of a Legendre dual transformation. In applications the latter functions can be a tangent plane approximation to a smoother function, and a chordal plane approximation to its Legendre dual. Convex examples include one from meteorology, and also the relation between the Delaunay mesh and the Voronoi tessellation. The latter are shown to be the projections of tangent plane and chordal approximations to the same paraboloid.


Algorithms ◽  
2020 ◽  
Vol 13 (7) ◽  
pp. 166 ◽  
Author(s):  
Andreas Griewank ◽  
Andrea Walther

For piecewise linear functions f : R n ↦ R we show how their abs-linear representation can be extended to yield simultaneously their decomposition into a convex f ˇ and a concave part f ^ , including a pair of generalized gradients g ˇ ∈ R n ∋ g ^ . The latter satisfy strict chain rules and can be computed in the reverse mode of algorithmic differentiation, at a small multiple of the cost of evaluating f itself. It is shown how f ˇ and f ^ can be expressed as a single maximum and a single minimum of affine functions, respectively. The two subgradients g ˇ and − g ^ are then used to drive DCA algorithms, where the (convex) inner problem can be solved in finitely many steps, e.g., by a Simplex variant or the true steepest descent method. Using a reflection technique to update the gradients of the concave part, one can ensure finite convergence to a local minimizer of f, provided the Linear Independence Kink Qualification holds. For piecewise smooth objectives the approach can be used as an inner method for successive piecewise linearization.


Sign in / Sign up

Export Citation Format

Share Document