Models and algorithms for online exploration and search

@inproceedings{Kamphans2011ModelsAA,
  title={Models and algorithms for online exploration and search},
  author={Tom Kamphans},
  year={2011}
}
This work considers some algorithmic aspects of exploration and search, two tasks that arise, for example, in the field of motion planning for autonomous mobile robots. We assume that the environment is not known to the robot in advance, so we deal with online algorithms. First, we consider a special kind of environments that we call cellular environments, where the robot’s surrounding is subdivided by an integer grid. The robot’s task is to visit every cell in this grid at least once. We… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 178 references

The Theory of Search Games and Rendezvous

S. Alpern, S. Gal
Kluwer Academic Publications, • 2003
View 12 Excerpts
Highly Influenced

The Polygon Exploration Problem

View 10 Excerpts
Highly Influenced

Design and Analysis of Strategies for Autonomous Systems in Motion Planning

E. Langetepe
PhD thesis, Department of Computer Science, FernUniversität Hagen, • 2000
View 9 Excerpts
Highly Influenced

Exploring an unknown graph

Journal of Graph Theory • 1999
View 5 Excerpts
Highly Influenced

Computational Geometry Column 44

Int. J. Comput. Geometry Appl. • 1998
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…