Sciweavers

Share
157 search results - page 1 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
IJRR
2007
60views more  IJRR 2007»
10 years 2 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
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
10 years 8 months ago
Minimum Distance Localization for a Robot with Limited Visibility
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
Malvika Rao, Gregory Dudek, Sue Whitesides
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
10 years 8 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
10 years 6 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
IPSN
2003
Springer
10 years 8 months ago
Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network
Abstract. We demonstrate that it is possible to achieve accurate localization and tracking of a target in a randomly placed wireless sensor network composed of inexpensive componen...
Radhika Nagpal, Howard E. Shrobe, Jonathan Bachrac...
books