Results 131 to 140 of about 15,438 (311)
Constraint-based local search for container freight rail scheduling [PDF]
, 2005 A traditional container rail service is based on regular timetables. This causes a risk that some customers may turn away if their preferred itinerary is not attainable and the take-up of some services in a fixed schedule may be low and therefore not ...
Indra-Payoong, Nakorn
core
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
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
Constraint Composite Graph-Based Weighted CSP Solvers: An Empirical Study
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceThe Weighted Constraint Satisfaction Problem (WCSP) is a very expressive framework for optimization problems. The Constraint Composite Graph (CCG) is a graphical representation of a given (Boolean) WCSP that facilitates its reduction to a Minimum ...
Orazio Rillo, T. K. Satish Kumar
doaj +1 more source
Extensible automated constraint modelling via refinement of abstract problem specifications
, 2015 Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial (optimisation) problems. Constraint solving a given problem proceeds in two phases: modelling and solving. Effective modelling has an huge impact on the performance
Akgün, Özgür
core
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
Efficient structural symmetry breaking for constraint satisfaction problems [PDF]
, 2007 Symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries.
Van Hentenryck, Pascal +9 more
core
, 2003 This paper develops a fuzzy constraint based model for bilateral multi-issue negotiation in trading environments. In particular, we are concerned with the principled negotiation approach in which agents seek to strike a fair deal for both parties, but ...
Luo, X. +16 more
core +1 more source