Sciweavers

707 search results - page 77 / 142
» Solving path problems on the GPU
Sort
View
AAAI
2000
15 years 1 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
TROB
2008
112views more  TROB 2008»
14 years 11 months ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
TROB
2011
112views more  TROB 2011»
14 years 6 months ago
Mapping and Pursuit-Evasion Strategies For a Simple Wall-Following Robot
— This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal environment. The robot can execute wall-following motions and can traverse...
Max Katsev, Anna Yershova, Benjamín Tovar, ...
CVPR
2009
IEEE
1468views Computer Vision» more  CVPR 2009»
16 years 7 months ago
Hardware-Efficient Belief Propagation
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
Chao-Chung Cheng, Chia-Kai Liang, Homer H. Chen, L...
TOG
2012
271views Communications» more  TOG 2012»
13 years 2 months ago
Mass splitting for jitter-free parallel rigid body simulation
We present a parallel iterative rigid body solver that avoids common artifacts at low iteration counts. In large or real-time simulations, iteration is often terminated before con...
Richard Tonge, Feodor Benevolenski, Andrey Voroshi...