Sciweavers

49 search results - page 1 / 10
» Localization: Approximation and Performance Bounds to Minimi...
Sort
View
TROB
2010
58views more  TROB 2010»
13 years 3 months ago
Localization: Approximation and Performance Bounds to Minimize Travel Distance
Abstract—Localization, which is the determination of one’s location in a known terrain, is a fundamental task for autonomous robots. This paper presents several new basic theor...
Craig A. Tovey, Sven Koenig
IJRR
2007
60views more  IJRR 2007»
13 years 4 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 6 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
CIAC
2003
Springer
142views Algorithms» more  CIAC 2003»
13 years 8 months ago
Differential Approximation for Some Routing Problems
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
Cristina Bazgan, Refael Hassin, Jérôm...
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 4 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...