1594 search results - page 40 / 319 » An Algorithm to Compute Collusion Paths |
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
299
click to vote
IWOCA
2010
Springer
14 years 6 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
107
click to vote
PC
2010
14 years 10 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
ICRA
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
4OR
2005
14 years 11 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...