Sciweavers

2450 search results - page 52 / 490
» Exploring Unknown Environments
Sort
View
ESA
2009
Springer
139views Algorithms» more  ESA 2009»
15 years 9 months ago
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
ATAL
2009
Springer
15 years 7 months ago
On fast exploration in 2D and 3D terrains with multiple robots
We present a fast multi-robotic exploration methodology for 2D and 3D terrains. An asynchronous exploration strategy is introduced which shows significant improvements over the ex...
Rahul Sawhney, K. Madhava Krishna, Kannan Srinatha...
133
Voted
ICRA
2002
IEEE
121views Robotics» more  ICRA 2002»
15 years 7 months ago
An Efficient Approach to the Simultaneous Localisation and Mapping Problem
—The simultaneous localization and map building (SLAM) problem asks if it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and then...
Stefan B. Williams, Gamini Dissanayake, Hugh F. Du...
IANDC
2008
92views more  IANDC 2008»
15 years 2 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
TCS
2008
15 years 2 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas