On the competitive complexity of navigation tasks
From MaRDI portal
Recommendations
Cited in
(8)- Classifying the multi robot path finding problem into a quadratic competitive complexity class
- Competitive on-line coverage of grid environments by a mobile robot
- The simple grid polygon exploration problem
- Inspecting a Set of Strips Optimally
- Searching for an axis-parallel shoreline
- Navigability with intermediate constraints
- Optimality and competitiveness of exploring polygons by mobile robots
- On the approximation of shortest escape paths
This page was built for publication: On the competitive complexity of navigation tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736555)