Results 281 to 290 of about 1,548,949 (331)

Learning Highly Dynamic Skills Transition for Quadruped Jumping Through Constrained Space

Advanced Robotics Research, EarlyView.
A quadruped robot masters dynamic jumps through constrained spaces with animal‐inspired moves and intelligent vision control. This hierarchical learning approach combines imitation of biological agility with real‐time trajectory planning. Although legged animals are capable of performing explosive motions while traversing confined spaces, replicating ...
Zeren Luo, Jiahui Zhang, Yimin Han, Ji Ma, Minghao Lu, Ioannis Havoutis, Peng Lu   +6 more
wiley   +1 more source

Stable Imitation of Multigait and Bipedal Motions for Quadrupedal Robots Over Uneven Terrains

Advanced Robotics Research, EarlyView.
How are quadrupedal robots empowered to execute complex navigation tasks, including multigait and bipedal motions? Challenges in stability and real‐world adaptation persist, especially with uneven terrains and disturbances. This article presents an imitation learning framework that enhances adaptability and robustness by incorporating long short‐term ...
Erdong Xiao, Yinzhao Dong, Ji Ma, Peng Lu   +3 more
wiley   +1 more source

Material parameter identification using set-valued inverse problem and detection of outliers in the noisy measurements

, 2019
Krushna Shinde, Pierre Feissel, Sébastien Destercke   +2 more
openalex   +1 more source

Inverse problems as statistics [PDF]

Inverse Problems, 2000
Summary: What mathematicians, scientists, engineers and statisticians mean by `inverse problem' differs. For a statistician, an inverse problem is an inference or estimation problem. The data are finite in number and contain errors, as they do in classical estimation or inference problems, and the unknown typically is infinite-dimensional, as it is in ...
Steven N. Evans, Philip B. Stark
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The Inverse Satisfiability Problem

SIAM Journal on Computing, 1996
Summary: We study the complexity of telling whether a set of bit-vectors represents the set of all satisfying truth assignments of a Boolean expression of a certain type. We show that the problem is coNP-complete when the expression is required to be in conjunctive normal form with three literals per clause (3CNF).
Dimitris J. Kavvadias, Martha Sideri
openaire   +2 more sources

The Inverse Problem

1989
All the ingredients for the solution of the inverse scattering problem via the Gel’fand-Levitan procedure have now been assembled. What is actually going to be solved is an inverse spectral problem posed for the regular solution. This inverse spectral problem is of relatively little intrinsic interest because in dimensions higher than one (for ...
openaire   +2 more sources

On the inverse conductivity problem

Applied Mathematics and Computation, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yildiz, B, Sever, A
openaire   +4 more sources