SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Piecemeal learning of an unknown environment
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Searching for the kernel of a polygon—a competitive strategy
Proceedings of the eleventh annual symposium on Computational geometry
Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polylogarithmic-overhead piecemeal graph exploration
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Visibility-based pursuit-evasion in a polygonal room with a door
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A competitive strategy for learning a polygon
SODA '97 Proceedings of the eighth 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 undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal constrained graph exploration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitive on-line coverage of grid environments by a mobile robot
Computational Geometry: Theory and Applications
Exploring an Unknown Polygonal Environment with Bounded Visibility
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
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
Collaborative Exploration of Unknown Environments with Teams of Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Approximating a Shortest Watchman Route
Fundamenta Informaticae
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
Efficient exploration of unknown indoor environments using a team of mobile robots
Annals of Mathematics and Artificial Intelligence
Application of ε -testers algorithms under sketch calculation model in robot navigation problem
ICS'09 Proceedings of the 13th WSEAS international conference on Systems
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
Application of Ɛ-testers algorithms under sketch and streaming calculation model in robot navigation
WSEAS Transactions on Computers
Optimality and competitiveness of exploring polygons by mobile robots
Information and Computation
Efficient goal-directed exploration
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Real-Time search algorithms for exploration and mapping
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Exploring an unknown environment with an intelligent virtual agent
AIMSA'06 Proceedings of the 12th international conference on Artificial Intelligence: methodology, Systems, and Applications
Optimal exploration of terrains with obstacles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Computer Science Review
Approximating a Shortest Watchman Route
Fundamenta Informaticae
Worst-case optimal exploration of terrains with obstacles
Information and Computation
Information-Seeking Control Under Visibility-Based Uncertainty
Journal of Mathematical Imaging and Vision
| Hi-index | 0.01 |
The authors consider the problem faced by a newborn that must explore and learn an unknown room with obstacles in it. They seek algorithms that achieve a bounded ratio of the worst-case distance traversed in order to see all visible points of the environment (thus creating a map), divided by the optimum distance needed to verify the map. The situation is complicated by the fact that the latter offline problem (optimally verifying a map) is NP-hard and thus must be solved approximately. Although the authors show that there is no such competitive algorithm for general obstacle courses, they give a competitive algorithm for the case of a polygonal room with a bounded number of obstacles in it.