707 search results - page 67 / 142 » Solving path problems on the GPU |
138
click to vote
TASE
2010
IEEE
14 years 6 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
IROS
2008
IEEE
15 years 6 months ago
2008
IEEE
— This paper presents a solution to the problem of steering a group of real omnidirectional mobile robots along a given path, while maintaining a desired formation pattern. This ...
278
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
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 ...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...