Results 251 to 260 of about 740,582 (289)

Humans optimally integrate cutaneous and proprioceptive cues in haptic size perception. [PDF]

Front Hum Neurosci
Allen KS, Goldreich D.
europepmc   +1 more source

Slip estimation model for traversability-based motion planning of cargo rover on extraterrestrial surface. [PDF]

Front Robot AI
Nishishita T, Ishigami G.
europepmc   +1 more source

Fault Diagnosis Method for Electric Vehicle In-Wheel Motor Bearings Based on Improved SVMD and ResNet-KAN. [PDF]

Sensors (Basel)
Zhang L, Xu Y, Xue H, Zhu C, Xu Z.
europepmc   +1 more source

Particle swarm optimization tuned LQR controller design for enhanced active suspension performance in repurposed medium public buses under varied road conditions. [PDF]

Sci Rep
Melaku TB, Ali HA, Kebede MS.
europepmc   +1 more source

A Safe and Efficient Navigation Framework for Ground Vehicles on Uneven Terrain Considering Kinematic Constraints and Terrain Traversability. [PDF]

Sensors (Basel)
Gai J, Guo Z, Su H, Qing W, Wei K, Cai Z, Pan M.   +6 more
europepmc   +1 more source

Deep probabilistic traversability with test-time adaptation for uncertainty-aware planetary rover navigation. [PDF]

Sci Rep
Endo M, Taniai T, Ishigami G.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Distance integral generalized wheel graphs

Discrete Mathematics, 2023
The authors consider the question of when the spectrum of the distance matrix of the join of several copies of the same complete graph (\(aK_m\)) and a cycle (\(C_n\)) consists of integers only. Since both constituent graphs are regular, their adjacency eigenvalues find their way into the distance spectrum of the join, so that only integral cycles (\(n\
Lu Lu, Junying Lu
exaly   +2 more sources

Extremal graphs for odd wheels

Journal of Graph Theory, 2021
AbstractFor a graph , the Turán number of , denoted by ex, is the maximum number of edges of an ‐vertex ‐free graph. Let denote the maximum number of edges not contained in any monochromatic copy of in a 2‐edge‐coloring of . A wheel is a graph formed by connecting a single vertex to all vertices of a cycle of length .
openaire   +1 more source

Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels

Order, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Charles Golumbic, Vincent Limouzy
openaire   +3 more sources

Binding Number and Wheel Related Graphs

International Journal of Foundations of Computer Science, 2017
The binding number of a graph G is defined to be the minimum of [Formula: see text] taken over all nonempty [Formula: see text] such that [Formula: see text]. Binding number, one indicator to better understand graph, is an important characteristic quantity of a graph.
Aytac, Vecdi, Berberler, Zeynep Nihan
openaire   +5 more sources