Results 131 to 140 of about 15,021 (304)
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierluigi Crescenzi, Gianluca Rossi
openaire +3 more sources
Collision‐Resilient Winged Drones Enabled by Tensegrity Structures
Advanced Robotics Research, EarlyView.Based on structures of birds such as the woodpeck, this article presents the collision‐resilient aerial robot, SWIFT. SWIFT leverages tensegrity structures in the fuselage and wings which allow it to undergo large deformations in a crash, without sustaining damage. Experiments show that SWIFT can reduce impact forces by 70% over conventional structures.
Omar Aloui +5 more
wiley +1 more source
Formation Control of Multi‐Agent System with Local Interaction and Artificial Potential Field
Advanced Robotics Research, EarlyView.This article proposes a local interaction‐based formation control method for Multi‐Agent system, integrating consensus and leader‐follower strategies with a stress response mechanism—artificial potential field to reduce communication overhead and enable obstacle avoidance. Experimental results on triangular, square, and hexagonal formations confirm its
Luoyin Zhao +3 more
wiley +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
Constraint Based Planning with Composable Substate Graphs.
, 2010 Constraint satisfaction techniques provide powerful inference algorithms that can prune choices during search. Constraint-based approaches provide a useful complement to heuristic search optimal planners.We develop a constraint-based model for cost ...
Fox, Maria +3 more
core
Solving Satisfaction Problems using Large-Neighbourhood Search
, 2020 Large-neighbourhood search (LNS) improves an initial solution, hence it is not directly applicable to satisfaction problems. In order to use LNS in a constraint programming (CP) framework to solve satisfaction problems, we usually soften some hard-to ...
Flener, Pierre, +4 more
core +1 more source
Novel adaptive branching constraint solving algorithm with look-ahead strategy
Tongxin xuebao, 2013 Based on the state-of-the-art scheme of adaptive branching constraint solving, a novel algorithm named AdaptBranchLVOwas proposed, combined with the look-ahead value ordering heuristics.
Hai-yan WANG +3 more
doaj +2 more sources
Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback
Advanced Robotics Research, EarlyView.BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat +4 more
wiley +1 more source
Effective compilation of constraint models
, 2010 Constraint Programming is a powerful technique for solving large-scale combinatorial (optimisation) problems. However, it is often inaccessible to users without expert knowledge in the area, precluding the wide-spread use of Constraint Programming ...
Rendl, Andrea
core
Advanced Robotics Research, EarlyView.To address challenges in high‐throughput intestinal sampling with sealed containment and target drug delivery, we developed a dual‐functional ingestible passive capsule with a dual‐triggered control system based on pH‐response and mechanical actuation.
Libing Huang +9 more
wiley +1 more source