Sciweavers

707 search results - page 68 / 142
» Solving path problems on the GPU
Sort
View
AROBOTS
2002
130views more  AROBOTS 2002»
14 years 11 months ago
Dynamic Motion Planning for Mobile Robots Using Potential Field Method
The potential field method is widely used for autonomous mobile robot path planning due to its elegant mathematical analysis and simplicity. However, most researches have been focu...
Shuzhi Sam Ge, Youjing Cui
ICIP
2000
IEEE
16 years 1 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
CISIS
2008
IEEE
15 years 6 months ago
Processing Ontology Alignments with SPARQL
Solving problems raised by heterogeneous ontologies can be achieved by matching the ontologies and processing the resulting alignments. This is typical of data mediation in which ...
Jérôme Euzenat, Axel Polleres, Fran&c...
FLAIRS
2007
15 years 2 months ago
Temporal Networks with Alternatives: Complexity and Model
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...
Roman Barták, Ondrej Cepek
ICML
2003
IEEE
16 years 20 days ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum