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

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!