A method of approximating a random vector function

Cybernetics ◽  
1968 ◽  
Vol 2 (5) ◽  
pp. 58-59
Author(s):  
Ts. S. Khatiashvili
2018 ◽  
Vol 10 (9) ◽  
pp. 168781401880088
Author(s):  
Liang Yang ◽  
Zhi Liu ◽  
Yong Chen

This article concentrates on the problem of walking pattern generation and online control for humanoid robot. However, it is challenging and thus still remains open so far in the field of bipedal locomotion control. In this article, we solve this problem by proposing a bivariate-stability-margin-based control scheme, in which a random vector function-link neural networks mechanism is additionally contained. By utilizing opposition-based learning algorithm to generate walking patterns and designing random vector function-link neural networks for compensating the combination of zero-moment point error and modeling error, the new walking controller exhibits good performance. Moreover, a bivariate-stability-margin-based fuzzy logic system is proposed to assign a weight to each training sample according to locomotion stability. With these results, a walking control system is successfully established and experiments validate the proposed control scheme.


Author(s):  
Zhiyu Zhou ◽  
Dexin Liu ◽  
Jiushen Guo ◽  
Jianxin Zhang ◽  
Zefei Zhu ◽  
...  

2021 ◽  
Vol 106 ◽  
pp. 107371
Author(s):  
Rahul Sharma ◽  
Tripti Goel ◽  
M. Tanveer ◽  
Shubham Dwivedi ◽  
R. Murugan

1997 ◽  
Vol 4 (6) ◽  
pp. 557-566
Author(s):  
B. Půža

Abstract Sufficient conditions of solvability and unique solvability of the boundary value problem u (m)(t) = f(t, u(τ 11(t)), . . . , u(τ 1k (t)), . . . , u (m–1)(τ m1(t)), . . . . . . , u (m–1)(τ mk (t))), u(t) = 0, for t ∉ [a, b], u (i–1)(a) = 0 (i = 1, . . . , m – 1), u (m–1)(b) = 0, are established, where τ ij : [a, b] → R (i = 1, . . . , m; j = 1, . . . , k) are measurable functions and the vector function f : ]a, b[×Rkmn → Rn is measurable in the first and continuous in the last kmn arguments; moreover, this function may have nonintegrable singularities with respect to the first argument.


1991 ◽  
Vol 7 (3) ◽  
pp. 397-403 ◽  
Author(s):  
Kenneth Nordström

Alternative definitions of the concentration ellipsoid of a random vector are surveyed, and an extension of the concentration ellipsoid of Darmois is suggested as being the most convenient and natural definition. The advantage of the proposed definition in providing substantially simplified proofs of results in (linear) estimation theory is discussed, and is illustrated by new and short proofs of two key results. A not-so-well-known, but elementary, extremal representation of a nonnegative definite quadratic form, together with the corresponding Cauchy-Schwarẓ-type inequality, is seen to play a crucial role in these proofs.


2021 ◽  
Vol 298 ◽  
pp. 113520
Author(s):  
Khaled Elmaadawy ◽  
Mohamed Abd Elaziz ◽  
Ammar H. Elsheikh ◽  
Ahmed Moawad ◽  
Bingchuan Liu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document