Sciweavers

317 search results - page 15 / 64
» Improving Planning Performance Using Low-Conflict Relaxed Pl...
Sort
View
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 4 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
EOR
2006
178views more  EOR 2006»
14 years 10 months ago
A fuzzy optimization model for QFD planning process using analytic network approach
In both the quality improvement and the design of a product, the engineering characteristics affecting product performance are primarily identified and improved to optimize custom...
Cengiz Kahraman, Tijen Ertay, Gülçin B...
IJCAI
2007
15 years 7 days ago
Improving Anytime Point-Based Value Iteration Using Principled Point Selections
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
Michael R. James, Michael E. Samples, Dmitri A. Do...
180
Voted
GIS
2007
ACM
15 years 12 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
SARA
2009
Springer
15 years 5 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...