Sciweavers

58 search results - page 5 / 12
» Constraint Partitioning for Solving Planning Problems with T...
Sort
View
ESWA
2007
100views more  ESWA 2007»
13 years 7 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
ICRA
2009
IEEE
115views Robotics» more  ICRA 2009»
14 years 2 months ago
Multi-robot coordination using generalized social potential fields
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
Russell Gayle, William Moss, Ming C. Lin, Dinesh M...
LOGCOM
2007
97views more  LOGCOM 2007»
13 years 7 months ago
A General Framework for Expressing Preferences in Causal Reasoning and Planning
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
James P. Delgrande, Torsten Schaub, Hans Tompits
CP
2003
Springer
14 years 29 days ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez

Book
357views
15 years 6 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang