Sciweavers

21 search results - page 1 / 5
» High-dimensional planning on the GPU
Sort
View
IPPS
1998
IEEE
13 years 10 months ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
EMO
2006
Springer
170views Optimization» more  EMO 2006»
13 years 10 months ago
Robust Multi-Objective Optimization in High Dimensional Spaces
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...
André Sülflow, Nicole Drechsler, Rolf ...
IJHR
2008
155views more  IJHR 2008»
13 years 6 months ago
The Challenge of Motion Planning for Soccer Playing Humanoid Robots
Motion planning for humanoids faces several challenging issues: high dimensionality of the configuration space, necessity to address balance constraints in single and double suppo...
Stefano Carpin, Marcelo Kallmann, Enrico Pagello
SC
2009
ACM
13 years 11 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
ICRA
2010
IEEE
200views Robotics» more  ICRA 2010»
13 years 3 months ago
High-dimensional planning on the GPU
Joseph T. Kider Jr., Mark Henderson, Maxim Likhach...