Sciweavers

6315 search results - page 965 / 1263
» Approximating Solution Structure
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 3 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
ICRA
2010
IEEE
163views Robotics» more  ICRA 2010»
15 years 3 months ago
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
Salvatore Candido, James C. Davidson, Seth Hutchin...
ICRA
2010
IEEE
90views Robotics» more  ICRA 2010»
15 years 3 months ago
Robust robotic assembly through contingencies, plan repair and re-planning
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...
Frederik W. Heger, Sanjiv Singh
ICRA
2010
IEEE
135views Robotics» more  ICRA 2010»
15 years 3 months ago
Implicit nonlinear complementarity: A new approach to contact dynamics
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
Emanuel Todorov
JAIR
2010
145views more  JAIR 2010»
15 years 3 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint