Results 151 to 160 of about 1,615,597 (299)

Parameterized Complexity of Paired Domination

open access: yes
The Paired Domination problem is one of the well-studied variants of the classical Dominating Set problem. In a graph G on nvertices, a dominating set D (set of vertices such that N[D] = V (G)) is called a paired dominating set of G, if G[D] has perfect matching. In the Paired Domination problem, given a graph G and a positive integer k, the task is to
Andreev, Nikita   +5 more
openaire   +3 more sources

Identifying Physical Interactions in Contact‐Based Robot Manipulation for Learning from Demonstration

open access: yesAdvanced Robotics Research, EarlyView.
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

Structural Parameterizations of $k$-Planarity

open access: yesJournal of Graph Algorithms and Applications
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times.
Tatsuya Gima   +2 more
doaj   +1 more source

The Parameterized Complexity of Degree Constrained Editing Problems [PDF]

open access: yes, 2009
This thesis examines degree constrained editing problems within the framework of parameterized complexity. A degree constrained editing problem takes as input a graph and a set of constraints and asks whether the graph can be altered in at most k editing
MATHIESON, LUKE
core  

Parameterized complexity of quantum invariants

open access: yesCoRR, 2019
We give a general fixed parameter tractable algorithm to compute quantum invariants of links presented by diagrams, whose complexity is singly exponential in the carving-width (or the tree-width) of the diagram. In particular, we get a $O(N^{\frac{3}{2} \mathrm{cw}} \mathrm{poly}(n))$ time algorithm to compute any Reshetikhin-Turaev invariant---derived
openaire   +6 more sources

ChicGrasp: Imitation‐Learning‐Based Customized Dual‐Jaw Gripper Control for Manipulation of Delicate, Irregular Bio‐Products

open access: yesAdvanced Robotics Research, EarlyView.
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

Backpropagation Through Soft Body: Investigating Information Processing in Brain–Body Coupling Systems

open access: yesAdvanced 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

LLM‐Integrated Human–Robot Interaction System for Microrobots

open access: yesAdvanced Robotics Research, EarlyView.
This paper proposes an LLM‐based control framework for guiding microrobots using human natural language. This framework can convert the natural human speech into safe and executable command sets for reliable navigation in complex environments. The experimental results show high accuracy and robustness in task performance, demonstrating the potential of
Bairong Zhu, Amar Salehi, Tingting Yu
wiley   +1 more source

Parameterized Complexity of Factorization Problems

open access: yesDiscrete Mathematics & Theoretical Computer Science
We study the parameterized complexity of the following factorization problem: given elements $a,a_1, \ldots, a_m$ of a monoid and a parameter $k$, can $a$ be written as the product of at most (or exactly) $k$ elements from $a_1, \ldots, a_m$. Several new upper bounds and fpt-equivalences with more restricted problems (subset sum and knapsack) are shown.
Markus Lohrey, Andreas Rosowski
openaire   +2 more sources

Miniaturized Magnetic Tip Design for Endoluminal Vine Robot Navigation

open access: yesAdvanced Robotics Research, EarlyView.
A magnetic tip mount is designed for a miniaturized 7 mm soft‐growing vine robot to enable wireless magnetic steering and onboard imaging, while preserving a 3 mm working channel. The internal–external ring magnets design balances magnetic attachment with low eversion pressure. Experiments demonstrate ±90° steering, 34 mm bending radius, and successful
Andrea Yanez Trujillo   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy