230 search results - page 2 / 46 » Constraint Orbital Branching |
ICRA
2002
IEEE
13 years 9 months ago
2002
IEEE
— Closed-loop, asymptotically stable walking motions are designed for a 5-link, planar bipedal robot model with one degree of underactuation. Parameter optimization is applied to...
JUCS
2006
13 years 4 months ago
2006
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
AAAI
2004
13 years 6 months ago
2004
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
AIPS
2000
13 years 6 months ago
2000
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, weare concerned with plans that have i quantitative temporal constrain...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...