Results 61 to 70 of about 3,577 (286)

Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling

open access: yesAdvanced Robotics Research, EarlyView.
A simulation‐driven framework for autonomous bulldozer leveling is presented, combining high‐fidelity terramechanics simulation with a neural‐network‐based reduced‐order model. Gradient‐based optimization enables efficient, low‐level blade control that balances leveling quality and operation time.
Harry Zhang   +5 more
wiley   +1 more source

Connectivity of Cartesian products of graphs

open access: yesApplied Mathematics Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Hamiltonicity and pancyclicity of cartesian products of graphs

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roman Cada   +2 more
openaire   +2 more sources

Traction Force Microscopy for Viscoelastic Substrates: A Semi‐Analytical Method

open access: yesAdvanced Science, EarlyView.
A semi‐analytical viscoelastic traction force microscopy framework is introduced for quantifying time‐resolved cell tractions on flat finite‐thickness substrates. The method generalizes elastic traction force microscopy to Generalized Maxwell materials, identifies when elastic approximations remain valid and, when they do not, shows that inferred ...
Adrià Villacrosa‐Ribas   +10 more
wiley   +1 more source

On 1RJ Moves in Cartesian Product Graphs

open access: yes, 2019
The results of this paper, which is an extension of the work [Motion planning in Cartesian product graphs, Discussiones Mathematicae Graph Theory 34 (2014) 207-221] gives the minimum number of moves required for the motion planning problem in Cartesian ...
Oyewumi, O., Akwu, A. D.
core   +1 more source

Machine Learning Interatomic Potentials for Energy Materials: Architectures, Training Strategies, and Applications

open access: yesAdvanced Energy Materials, EarlyView.
Machine learning interatomic potentials bridge quantum accuracy and computational efficiency for materials discovery. Architectures from Gaussian process regression to equivariant graph neural networks, training strategies including active learning and foundation models, and applications in solid‐state electrolytes, batteries, electrocatalysts ...
In Kee Park   +19 more
wiley   +1 more source

FIRE‐GNN: Force‐Informed, Relaxed Equivariance Graph Neural Network for Rapid and Accurate Prediction of Surface Properties

open access: yesAdvanced Intelligent Discovery, EarlyView.
This study introduces FIRE‐GNN, a force‐informed, relaxed equivariant graph neural network for predicting surface work functions and cleavage energies from slab structures. By incorporating surface‐normal symmetry breaking and machine learning interatomic potential‐derived force information, the approach achieves state‐of‐the‐art accuracy and enables ...
Circe Hsu   +5 more
wiley   +1 more source

Aggregating distributed energy resources for grid flexibility services: A distributed game theoretic approach

open access: yesInternational Journal of Robust and Nonlinear Control, EarlyView., 2023
Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen   +3 more
wiley   +1 more source

On the Crossing Numbers of Cartesian Products of Wheels and Trees

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián   +2 more
doaj   +1 more source

Cartesian Products of Graphs and Metric Spaces

open access: yesEuropean Journal of Combinatorics, 2000
The authors give a short proof of the known fact that decomposition of a connected graph into a cartesian product of indecomposable factors is unique up to isomorphism. They then present a generalization of the results which shows uniqueness of decomposition for a wide class of product operations on general finite metric spaces.
Sergey V. Avgustinovich   +1 more
openaire   +1 more source

Home - About - Disclaimer - Privacy