scholarly journals A Study on Kicking Motion Strategy for a Legged Robot

2022 ◽  
pp. 145-150
Author(s):  
Masashi Nakamura ◽  
Takao Muromaki ◽  
Takateru Urakubo
Keyword(s):  
2013 ◽  
Vol 133 (3) ◽  
pp. 663-671
Author(s):  
Hiroshi Hirata ◽  
Yorinao Mizushima ◽  
Shigeto Ouchi ◽  
Nariyuki Kodani

Sensors ◽  
2021 ◽  
Vol 21 (11) ◽  
pp. 3679
Author(s):  
Dingkui Tian ◽  
Junyao Gao ◽  
Xuanyang Shi ◽  
Yizhou Lu ◽  
Chuzhao Liu

The highly dynamic legged jumping motion is a challenging research topic because of the lack of established control schemes that handle over-constrained control objectives well in the stance phase, which are coupled and affect each other, and control robot’s posture in the flight phase, in which the robot is underactuated owing to the foot leaving the ground. This paper introduces an approach of realizing the cyclic vertical jumping motion of a planar simplified legged robot that formulates the jump problem within a quadratic-programming (QP)-based framework. Unlike prior works, which have added different weights in front of control tasks to express the relative hierarchy of tasks, in our framework, the hierarchical quadratic programming (HQP) control strategy is used to guarantee the strict prioritization of the center of mass (CoM) in the stance phase while split dynamic equations are incorporated into the unified quadratic-programming framework to restrict the robot’s posture to be near a desired constant value in the flight phase. The controller is tested in two simulation environments with and without the flight phase controller, the results validate the flight phase controller, with the HQP controller having a maximum error of the CoM in the x direction and y direction of 0.47 and 0.82 cm and thus enabling the strict prioritization of the CoM.


1999 ◽  
Vol 09 (04n05) ◽  
pp. 471-493 ◽  
Author(s):  
LEONIDAS J. GUIBAS ◽  
JEAN-CLAUDE LATOMBE ◽  
STEVEN M. LAVALLE ◽  
DAVID LIN ◽  
RAJEEV MOTWANI

This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually "see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita. Our study of this problem is motivated in part by robotics applications, such as surveillance with a mobile robot equipped with a camera that must find a moving target in a cluttered workspace. A few bounds are introduced, and a complete algorithm is presented for computing a successful motion strategy for a single pursuer. For simply-connected free spaces, it is shown that the minimum number of pursuers required is Θ( lg  n). For multiply-connected free spaces, the bound is [Formula: see text] pursuers for a polygon that has n edges and h holes. A set of problems that are solvable by a single pursuer and require a linear number of recontaminations is shown. The complete algorithm searches a finite graph that is constructed on the basis of critical information changes. It has been implemented and computed examples are shown.


Sign in / Sign up

Export Citation Format

Share Document