Results 131 to 140 of about 32,185 (303)
On the Complexity of the Bilevel Shortest Path Problem
NetworksABSTRACT We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our problem, the leader and the follower each control a subset of the edges of a graph and together aim at building a path between two given vertices ...
Dorothee Henke, Lasse Wulf
openaire +3 more sources
From Rigid to Soft Robotic Approaches for Neuroendoscopy
Advanced Robotics Research, EarlyView.Robotic assistance has had minimal impact on deep intraventricular surgeries, where small‐scale, precision, and reduced invasiveness can contribute to improved patient outcomes. Emerging technologies in rigid, soft, and hybrid robotics are reviewed to identify the most promising mechanisms for deep brain navigation in addition to an attempt to identify
Kieran Gilday +3 more
wiley +1 more source
Yet another bidirectional algorithm for shortest paths
For finding a shortest path in a network the bidirectional~A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes.
Post, H., Pijls, W.H.L.M.
core
The Shortest Path Problem with Crossing Costs
, 2016 We introduce the shortest path problem with crossing costs (SPPCC), a shortest path problem in a directed graph, in which the objective function is the sum of arc weights and crossing costs.
Blanco, Marco +5 more
core
Advanced Robotics Research, EarlyView.A codesign multiobjective optimization framework was developed to enhance the morphology and controller of a snake‐like robot driven by artificial muscles. It improved planar locomotion, agility, and power efficiency. The approach optimized link geometry and controller gains, revealing that shorter muscles near joints and longer linkages maximize ...
Ayla Valles, Mahdi Haghshenas‐Jaryani
wiley +1 more source
Information Transmission Strategies for Self‐Organized Robotic Aggregation
Advanced Robotics Research, EarlyView.In this review, we discuss how information transmission influences the neighbor‐based self‐organized aggregation of swarm robots. We focus specifically on local interactions regarding information transfer and categorize previous studies based on the functions of the information exchanged.
Shu Leng +5 more
wiley +1 more source
On the Bottleneck Shortest Path Problem
, 2006 The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capacity of any path between two specified vertices of the network.
Peinhardt, Matthias, Kaibel, Volker
core +1 more source
The shortest path problem in the stochastic networks with unstable topology. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +1 more source
Auto‐Routing Fluidic Printed Circuit Boards
Advanced Robotics Research, EarlyView.This work introduces (STREAM) software tool for routing efficiently advanced macrofluidics, an open‐source software tool for automating the design of 3D‐printable fluidic circuit boards. STREAM streamlines tube routing and layout, enabling the rapid fabrication of fluidic networks for soft robotics, lab‐on‐a‐chip devices, microfluidics, and biohybrid ...
Savita V. Kendre +3 more
wiley +1 more source
Hard‐Magnetic Soft Millirobots in Underactuated Systems
Advanced Robotics Research, EarlyView.This review provides a comprehensive overview of hard‐magnetic soft millirobots in underactuated systems. It examines key advances in structural design, physics‐informed modeling, and control strategies, while highlighting the interplay among these domains.
Qiong Wang +4 more
wiley +1 more source