A competitive analysis of algorithms for searching unknown scenes
From MaRDI portal
Recommendations
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
- Competitive complexity of mobile robot on-line motion planning problems
- How to learn an unknown environment. I
- Competitive exploration of rectilinear polygons.
- AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
Cites work
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Constructing competitive tours from local information
- scientific article; zbMATH DE number 4149525 (Why is no real title available?)
- Optimum watchman routes
- Searching in the plane
Cited in
(12)- Classifying the multi robot path finding problem into a quadratic competitive complexity class
- How to find a point on a line within a fixed distance
- Optimal robot localization in trees
- Rendezvous in planar environments with obstacles and unknown initial distance
- A new fast and accurate heuristic for the automatic scene detection problem
- Multidimensional online motion planning for a spherical robot
- Competitive complexity of mobile robot on-line motion planning problems
- Worst-case optimal exploration of terrains with obstacles
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
- Competitive Searching for a Line on a Line Arrangement.
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
- Competitive searching over terrains
This page was built for publication: A competitive analysis of algorithms for searching unknown scenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685600)
