Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Related Publications
(10)
Exploring unknown environments
Planning Robot Motions for RangeImage Acquisition and Automatic 3D Model Construction
Searching for the kernel of a polygon—a competitive strategy
Dynamic path planning in sensorbased terrain acquisition
Navigating in unfamiliar geometric terrain
Subscribe
Academic
Publications
Exploring unknown environments with obstacles
Exploring unknown environments with obstacles,10.1145/314500.314925,Susanne Albers,Klaus Kursawe,Sven Schuierer
Edit
Exploring unknown environments with obstacles
(
Citations: 35
)
BibTex

RIS

RefWorks
Download
Susanne Albers
,
Klaus Kursawe
,
Sven Schuierer
Conference:
ACMSIAM Symposium on Discrete Algorithms  SODA
, pp. 842843, 1999
DOI:
10.1145/314500.314925
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
portal.acm.org
)
(
portal.acm.org
)
(
www.informatik.unitrier.de
)
(
doi.acm.org
)
More »
Citation Context
(25)
...One of the simplest ways that has often been used is a backtracking algorithm to map the floor [
4
]...
Hung Nguyen
,
et al.
In search of a cost effective way to develop autonomous floor mapping ...
...Later, this result was improved in [
1
] by giving a lower bound in ( p k) for the competitive ratio of any online algorithm...
Jurek Czyzowicz
,
et al.
Optimal Exploration of Terrains with Obstacles
...They formalized the exploration problem in a more analytical way (a onerobot formalization is also available by Albers et al. [
30
]), proved that the offline coverage problem is NPHard, and proposed very interesting heuristics to solve the online version...
Ettore Ferranti
,
et al.
Rapid exploration of unknown areas through dynamic deployment of mobil...
...Later, this result was improved in [
1
] by giving a lower bound in ( p k) for the competitive ratio of any online algorithm exploring a poly...
Jurek Czyzowicz
,
et al.
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
...Thus, l denotes the length of the path traveled by the robot, while l opt denotes the length of the shortest offline path from S to T .T he following definition of generalized competitiveness is given in a setting suitable for any online mobile robot task, e.g., area coverage [13], search [12], map acquisition [
2
], as well as online navigation...
Yoav Gabriely
,
et al.
CBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm
References
(3)
Piecemeal learning of an unknown environment
(
Citations: 25
)
Margrit Betke
,
Ronald L. Rivest
,
Mona Singh
Conference:
Computational Learning Theory  COLT
, pp. 277286, 1993
How to learn an unknown environment. I: the rectilinear case
(
Citations: 100
)
Xiaotie Deng
,
Tiko Kameda
,
Christos H. Papadimitriou
Journal:
Journal of The ACM  JACM
, vol. 45, no. 2, pp. 215245, 1998
How to learn an unknown environment
(
Citations: 58
)
X. Deng
,
T. Kameda
,
C. Papadimitriou
Conference:
IEEE Symposium on Foundations of Computer Science  FOCS
, 1991
Sort by:
Citations
(35)
In search of a cost effective way to develop autonomous floor mapping robots
Hung Nguyen
,
Akihiro Eguchi
,
Daniel Hooten
Conference:
International Workshop on Robot Sensing  ROSE
, 2011
Optimal Exploration of Terrains with Obstacles
Jurek Czyzowicz
,
David Ilcinkas
,
Arnaud Labourel
,
Andrzej Pelc
Journal:
Computing Research Repository  CORR
, vol. abs/1001.0, pp. 112, 2010
Rapid exploration of unknown areas through dynamic deployment of mobile and stationary sensor nodes
(
Citations: 4
)
Ettore Ferranti
,
Niki Trigoni
,
Mark Levene
Journal:
Autonomous Agents and Multiagent Systems  AAMAS
, vol. 19, no. 2, pp. 210243, 2009
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Jurek Czyzowicz
,
Arnaud Labourel
,
Andrzej Pelc
Conference:
European Symposium on Algorithms  ESA
, pp. 263274, 2009
Efficient exploration of unknown indoor environments using a team of mobile robots
(
Citations: 4
)
Cyrill Stachniss
,
Óscar Martínez Mozos
,
Wolfram Burgard
Journal:
Annals of Mathematics and Artificial Intelligence  AMAI
, vol. 52, no. 24, pp. 205227, 2008