Robot Map Verification of a Graph World
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
An Online Algorithm for the Postman Problem with a Small Penalty
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On a Space-Optimal Distributed Traversal Algorithm
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Lifelong Planning for Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Traversing Directed Eulerian Mazes
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Utility-based on-line exploration for repeated navigation in an embedded graph
Artificial Intelligence
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Information Processing Letters
Multi-robot tree and graph exploration
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Experimental studies of graph traversal algorithms
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Complexity analysis of real-time reinforcement learning
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Easy and hard testbeds for real-time search algorithms
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Efficient goal-directed exploration
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Predicting the labels of an unknown graph via adaptive exploration
Theoretical Computer Science
Online graph exploration: new results on old and new algorithms
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Black hole search in directed graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Periodic data retrieval problem in rings containing a malicious host
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
Computer Science Review
Online multi-robot exploration of grid graphs with rectangular obstacles
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
It is desired to explore all edges of an unknown directed, strongly connected graph. At each point one has a map of all nodes and edges visited, one can recognize these nodes and edges upon seeing them again, and it is known how many unexplored edges emanate from each node visited. The goal is to minimize the ratio of the total number of edges traversed to the optimum number of traversals had the graph been known. For Eulerian graphs this ratio cannot be better than 2, and 2 is achievable by a simple algorithm. In contrast, the ratio is unbounded when the deficiency of the graph (the number of edges that have to be added to make it Eulerian) is unbounded. The main result is an algorithm that achieves a bounded ratio when the deficiency is bounded; unfortunately the ratio is exponential in the deficiency. It is also shown that, when partial information about the graph is available, minimizing the worst-case ratio is PSPACE-complete.