On the Competitive Complexity of Navigation Tasks

On the Competitive Complexity of Navigation Tasks

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, an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Icking, Christian, Kamphans, Thomas, Klein, Rolf, Langetepe, Elmar
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Competitive Ratio
Computer science
control theory
systems
Control theory. Systems
Exact sciences and technology
Exploration Strategy
Grid Graph
Navigation Task
Robotics
Simple Polygon
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/3-540-45993-6_14