Sciweavers

980 search results - page 67 / 196
» Decentralized Constraint Satisfaction
Sort
View
IROS
2009
IEEE
137views Robotics» more  IROS 2009»
14 years 3 months ago
Decentralized planning for dynamic motion generation of multi-link robotic systems
— This paper presents a decentralized planning method for generating dynamic whole body motions of multilink robots including humanoids. First, a robotic system will be modeled a...
Yuichi Tazaki, Hisashi Sugiura, Herbert Janssen, C...
SARA
2007
Springer
14 years 3 months ago
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
Ian P. Gent, Ian Miguel, Andrea Rendl
CP
2001
Springer
14 years 1 months ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder
SAGA
2001
Springer
14 years 1 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
CP
2008
Springer
13 years 11 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons