Results 141 to 150 of about 94,026 (313)
Advanced Robotics Research, EarlyView.Visual teach‐and‐repeat (VTR) navigation allows robots to learn and follow routes without building a full metric map. We show that navigation accuracy for VTR can be improved by integrating a topological map with error‐drift correction based on stereo vision.
Fuhai Ling, Ze Huang, Tony J. Prescott
wiley +1 more source
Minimum Cost Arborescences [PDF]
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well ...
Dutta, Bhaskar, Mishra, Debasis
core +2 more sources
, 2015 A Master's Project Presented to Department of Telecommunications in partial fulfillment of the requirements for the Master of Science Degree.This technology case study focuses on Spanning Tree Protocol (STP).
Marsh, John; Reviewer +3 more
core +1 more source
Journal of Numerical Analysis and Approximation Theory, 2005 We present an overview of the approximation theory in combinatorial optimization. As an application we consider the Generalized Minimum Spanning Tree (GMST) problem which is defined on an undirected complete graph with the nodes partitioned into ...
Petrică C. Pop, G. Still, W. Kern
doaj +2 more sources
Minimum spanning tree analysis of brain networks: A systematic review of network size effects, sensitivity for neuropsychiatric pathology, and disorder specificity. [PDF]
Netw Neurosci, 2022 Blomsma N +8 more
europepmc +1 more source
Continuum Mechanics Modeling of Flexible Spring Joints in Surgical Robots
Advanced Robotics Research, EarlyView.A new mechanical model of a tendon‐actuated helical extension spring joint in surgical robots is built using Cosserat rod theory. The model can implicitly handle the unknown contacts between adjacent coils and numerically predict spring shapes from straight to significantly bent under actuation forces.
Botian Sun +3 more
wiley +1 more source
Approximation hardness of dominating set problems in bounded degree graphs
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
Forecasting the COVID-19 transmission in Italy based on the minimum spanning tree of dynamic region network. [PDF]
PeerJ, 2021 Dong M, Zhang X, Yang K, Liu R, Chen P.
europepmc +1 more source
Models of Random Spanning Trees
Random Structures & AlgorithmsABSTRACT There are numerous randomized algorithms to generate spanning trees in a given ambient graph; several target the uniform distribution on trees (UST), while in practice the fastest and most frequently used draw random weights on the edges and then employ a greedy algorithm to choose the minimum‐weight spanning tree (MST ...
Eric Babson +5 more
openaire +2 more sources
Auditory–Tactile Congruence for Synthesis of Adaptive Pain Expressions in RoboPatients
Advanced 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