Results 101 to 110 of about 39,180 (264)
Discrete Mathematics, 1995 Let \(G\) be a graph. A set \(X\) of vertices of \(G\) is said to be a dominating set of vertices of \(G\) if \(V(G)\) is contained in the closed neighbourhood of \(X\). The smallest cardinality of a dominating set of vertices in \(G\) is called the domination number of \(G\) and is denoted by \(\gamma(G)\). Let \(X\) be a set of vertices of \(G\).
openaire +1 more source
Advanced Robotics Research, EarlyView.This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka +3 more
wiley +1 more source
New Results on Minimal Strongly Imperfect Graphs [PDF]
Scientific Annals of Computer Science, 2008 The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes
V. Anastasoaei, E. Olaru
doaj
Advanced Robotics Research, EarlyView.An enhanced universal gripper combining rigid mechanics with self‐adaptable fingers is presented for industrial automation. The novel six‐bar linkage with integrated compliant pad eliminates mechanical interference while enabling passive shape adaptation.
Muhammad Usman Khalid +7 more
wiley +1 more source
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
Advanced 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
Discrete Mathematics, 1990 An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y and edges uv, vx, xy. The wing-graph W(G) of a graph G is a graph having the same vertex set as G; uv is an edge in W(G) if and only if uv is a wing in G. A graph G is saturated if G is isomorphic to W(G).
openaire +2 more sources
Advanced Robotics Research, EarlyView.This review maps the methods to monitor robots’ health by fusing vibration, sound, control signals, vision, force, and oil information with artificial intelligence. It identifies deep learning, transfer learning, digital twins, and physics‐informed models as key methodological pathways enabling earlier diagnosis, safer human–robot collaboration, and ...
Yuting Qiao +6 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1990 A colouring of the vertices of a graph is said to be locally perfect if for each vertex x the neighbourhood N(x) of x is coloured by a number of colours which is equal to the cardinality of a maximum clique in N(x). The locally perfect graphs are those graphs for which any subgraph has a locally perfect colouring. It is shown in this paper that locally
openaire +2 more sources
Learning‐Based Soft Robotic Grasping: Recent Progress and Remaining Challenges
Advanced Robotics Research, EarlyView.This review analyzes learning‐based soft robotic grasping from a pipeline‐oriented perspective, encompassing soft gripper design, multimodal sensing, and learning‐based planning and control. It surveys key neural network architectures and benchmark datasets and identifies critical challenges such as sim‐to‐real transfer, generalization, and continual ...
Arnab Majumder +3 more
wiley +1 more source
Perfect Roman domination in middle graphs [PDF]
Discrete Mathematics Letters, 2021 Kijung Kim
doaj +1 more source