On the Competitive Complexity of Navigation Tasks

Authors:
Christian Icking;Thomas Kamphans;Rolf Klein;Elmar Langetepe
Affiliations:
-;-;-;-
Venue:
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Year:
2000

Citing 29
Cited 11

Amortized efficiency of list update and paging rules

Communications of the ACM
Walking an unknown street with bounded detour

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Walking an unknown street with bounded detour

Computational Geometry: Theory and Applications
Watchman routes under limited visibility

Computational Geometry: Theory and Applications
Searching in the plane

Information and Computation
Competitive searching in a generalized street

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
LR-visibility in polygons

Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Optimal on-line algorithms for walking with minimum number of turns in unknown streets

Computational Geometry: Theory and Applications
How to find a point on a line within a fixed distance

Discrete Applied Mathematics - Special issue on the 13th European workshop on computational geometry CG '97
Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On-line search in a simple polygon

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Exploring unknown environments with obstacles

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Competitive searching in a generalized street

Computational Geometry: Theory and Applications
The Polygon Exploration Problem

SIAM Journal on Computing
Developments from a June 1996 seminar on Online algorithms: the state of the art

Developments from a June 1996 seminar on Online algorithms: the state of the art
Walking Streets Faster

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Going Home Through an Unknown Street

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Position-Independent Street Searching

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Searching Rectilinear Streets Completely

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Competitive Searching in Polygons - Beyond Generalised Streets

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
A New Competitive Algorithm for Agent Searching in Unknown Streets

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Generalized Streets Revisited

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Lower Bounds in On-Line Geometric Searching

FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
An approximation scheme for planar graph TSP

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Hamiltonian Cycles in Solid Grid Graphs

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The Exact Cost of Exploring Streets with CAB

The Exact Cost of Exploring Streets with CAB
An optimal competitive strategy for walking in streets

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
An optimal strategy for searching in unknown streets

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Competitive on-line coverage of grid environments by a mobile robot

Computational Geometry: Theory and Applications
Comparing the Power of Robots

International Journal of Robotics Research
Classifying the multi robot path finding problem into a quadratic competitive complexity class

Annals of Mathematics and Artificial Intelligence
Inspecting a Set of Strips Optimally

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Robust navigation in an unknown environment with minimal sensing and representation

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on human computing
On the optimality of spiral search

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Optimality and competitiveness of exploring polygons by mobile robots

Information and Computation
Searching for an axis-parallel shoreline

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Exploring simple grid polygons

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimal competitive online ray search with an error-prone robot

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Searching for an axis-parallel shoreline

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The competitive complexity of task T is the smallest possible value r any strategy S can achieve. We discuss this notion, and survey some tasks whose competitive complexities are known. Then we report on new results and ongoing work on the competitive complexity of exploring an unknown cellular environment.