Results 61 to 70 of about 2,775,539 (295)
Robots can learn manipulation tasks from human demonstrations. This work proposes a versatile method to identify the physical interactions that occur in a demonstration, such as sequences of different contacts and interactions with mechanical constraints.
Alex Harm Gert‐Jan Overbeek +3 more
wiley +1 more source
GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS
A graph \(G(V,E)\) is a system consisting of a finite non empty set of vertices \(V(G)\) and a set of edges \(E(G)\). A (proper) vertex colouring of \(G\) is a function \(f:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that ...
I Nengah Suparta +3 more
doaj +1 more source
Pak Biawak, a necrobot, embodies an unusual fusion of biology and robotics. Designed to repurpose natural structures after death, it challenges conventional boundaries between nature and engineering. Its movements are precise yet unsettling, raising questions about sustainability, ethics, and the untapped potential of biointegrated machines.
Leo Foulds +2 more
wiley +1 more source
This work presents a state‐adaptive Koopman linear quadratic regulator framework for real‐time manipulation of a deformable swab tool in robotic environmental sampling. By combining Koopman linearization, tactile sensing, and centroid‐based force regulation, the system maintains stable contact forces and high coverage across flat and inclined surfaces.
Siavash Mahmoudi +2 more
wiley +1 more source
Automated poultry processing lines still rely on humans to lift slippery, easily bruised carcasses onto a shackle conveyor. Deformability, anatomical variance, and hygiene rules make conventional suction and scripted motions unreliable. We present ChicGrasp, an end‐to‐end hardware‐software co‐designed imitation learning framework, to offer a ...
Amirreza Davar +8 more
wiley +1 more source
On density of subgraphs of Cartesian products [PDF]
AbstractIn this paper, we extend two classical results about the density of subgraphs of hypercubes to subgraphs of Cartesian products of arbitrary connected graphs. Namely, we show that , where is the maximum ratio taken over all subgraphs of .
Chepoi, Victor +2 more
openaire +4 more sources
On 1RJ Moves in Cartesian Product Graphs
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
Efficient and Robust Standing Postures of Quadruped Robots
A calibrated static framework estimates load, optimizes torques, and adapts posture so quadruped robots stand efficiently and robustly under external payloads, achieving up to 50% lower torque demand. Inspired by the natural posture adjustments of animals under external loading, this article presents an optimization‐based framework for minimizing joint
Mohamad Kanaan +5 more
wiley +1 more source
Problems of Cartesian Product Solved by Elementary School Students Sandra Maria Pinto MaginaI
The study investigated the solution of direct (which requires multiplication for its resolution) and inverse (which requires division for its resolution) Cartesian product problems by elementary education students, examining the level of problem ...
Sandra Maria Pinto Magina +2 more
doaj +1 more source
An improvement in the two-packing bound related to Vizing's conjecture
Vizing's conjecture states that the domination number of the Cartesian product of graphs is at least the product of the domination numbers of the two factor graphs.
Kimber Wolff
doaj +1 more source

