Results 111 to 120 of about 1,864,097 (296)
Push the Limits: Human‐Like Multimodal Extreme Embodied Intelligence for Autonomous Racing
Autonomous racing tests embodied intelligence under extreme control limits of speed, actuation, and decision‐making. Inspired by human multimodality, we present Apex, an embodied agent deployed on a super‐formula racing car at Yas Marina. Integrating physics‐informed perception, multimodal learning, and tasking, Apex cuts lap times by 15% and achieves ...
Yanxin Zhou +13 more
wiley +1 more source
Structural Parameterized Complexity [PDF]
We revisit fixed-parameter tractability, fixed-parameter reducibility and kernelizability. The standard formulations of their definitions are enhanced for greater correctness from a structural complexity point of view.
Witteveen, Jouke E.
core
Crossing Numbers and Parameterized Complexity [PDF]
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the odd crossing number of G that uses at most 9k crossings, where k is the odd crossing number of G.
Michael J. Pelsmajer +2 more
openaire +2 more sources
Rotating magnetic fields (RMFs) are widely used for microrobot propulsion and control. We show that RMF generation with permanent magnets is mechanically feasible for many limb and intracranial applications but becomes constrained for thoracic targets.
Tuan‐Anh Le +4 more
wiley +1 more source
WorMa is an amphibious undulatory robot that uses Center of Mass redistribution as the sole terrain adaptation mechanism. This mechanism is based on internal fluid mass redistribution through a pump‐driven latex balloon system that creates three profiles: head‐biased, balanced, and tail‐biased.
Daniil Filimonov, Nana Obayashi
wiley +1 more source
Contributions to Parameterized Complexity
This thesis is presented in two parts. In Part One we concentrate on algorithmic aspects of parameterized complexity. We explore ways in which the concepts and algorithmic techniques of parameterized complexity can be fruitfully brought to bear on a ...
Catherine Mccartin
core +2 more sources
We analyze a common feature of p-Kemeny AGGregation (p-KAGG) and p-One-Sided Crossing Minimization (p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the social choice community.
Henning Fernau +5 more
doaj +1 more source
The Parameterized Complexity of Constraint Satisfaction and Reasoning
Parameterized Complexity is a new and increasingly popular theoretical framework for the rigorous analysis of NP-hard problems and the development of algorithms for their solution. The framework provides adequate concepts for taking structural aspects of
Szeider, Stefan, Stefan Szeider
core +1 more source
Adaptive Motion Scaling With Phase‐and‐Gaze Awareness for Laparoscopic Robotic Teleoperation
The proposed adaptive motion scaling framework for laparoscopic robotic teleoperation integrates real‐time phase recognition, robot kinematics, and eye‐tracking. Bayesian optimization enables personalized tuning. The inferred phase probabilities and dominance weights suppress scaling fluctuations during fine manipulation while preserving responsiveness
Jingsong Liu +5 more
wiley +1 more source
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs
In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way.
Cornelius Brand +3 more
doaj +1 more source

