Results 121 to 130 of about 186,232 (291)

An Approximation Scheme for the Generalized Geometric Minimum Spanning Tree Problem with Grid Clustering [PDF]

open access: yes
This paper is concerned with a special case of the Generalized Minimum Spanning Tree Problem. The Generalized Minimum Spanning Tree Problem is de¯ned on an undirected graph, where the vertex set is partitioned into clusters, and non-negative costs are ...
Feremans,Corinne, Grigoriev,Alexander
core   +1 more source

Auditory–Tactile Congruence for Synthesis of Adaptive Pain Expressions in RoboPatients

open access: yesAdvanced Robotics Research, EarlyView.
In this work, we explore auditory–tactile congruence for synthesizing adaptive vocal pain expressions in robopatients. Using a robopatient platform that integrates vocal pain sounds with palpation forces, we conducted 7680 trials across 20 participants.
Saitarun Nadipineni   +4 more
wiley   +1 more source

Hybrid Continuum Robot Designs and Architectures for Healthcare Applications

open access: yesAdvanced Robotics Research, EarlyView.
Hybrid continuum robots represent an emerging class of flexible manipulators that blend materials, structures, and actuation concepts from the established fields of soft and continuum robotics. This review introduces an accessible framework to distinguish key hybridization approaches, surveys current designs aimed at complex clinical applications, and ...
Burak Ozdemir   +4 more
wiley   +1 more source

Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO). [PDF]

open access: yesMagn Reson Med, 2021
Dymerska B   +6 more
europepmc   +1 more source

3D‐Printing Aided Rapid Prototyping of Pretensioned Tensegrity Structures for Robotic Applications

open access: yesAdvanced Robotics Research, EarlyView.
Printing, injection molding, and assembly (PMA) is a method for rapid prototyping mesoscale, topologically complex, and tensioned tensegrity structures. In combination with PMA method, two mold design strategies: modular mold and compact channel layout, enable efficiency and scalability for tensegrity fabrication.
Yi Sun   +3 more
wiley   +1 more source

An approximation algorithm for the at least version of the generalized minimum spanning tree problem

open access: yesJournal of Numerical Analysis and Approximation Theory, 2006
We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMSTP, which consists in finding a minimum cost tree spanning at least one node from each node set of a complete graph with the nodes partitioned into a ...
Petrică C. Pop   +2 more
doaj   +2 more sources

Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms

open access: yes, 2007
It is known that graphs on n vertices with minimum degree at least 3 have spanning trees with at least n/4+2 leaves and that this can be improved to (n+4)/3 for cubic graphs without the diamond K_4-e as a subgraph.
Bonsma, Paul, Zickfeld, Florian
core   +2 more sources

Cross‐Scale Hierarchical Targeted Delivery System Based on Small‐Scale Magnetic Robots

open access: yesAdvanced Robotics Research, EarlyView.
This article reviews a cross‐scale hierarchical targeted delivery system that integrates magnetic continuum robots and magnetic microrobots. By combining rapid long‐range navigation with precise microscale targeting, the system overcomes key limitations of single‐scale approaches.
Junjian Zhou   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy