This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...