The Robot Localization Problem
From MaRDI portal
Recommendations
Cited in
(19)- Efficient visibility queries in simple polygons
- Visibility queries in a polygonal region
- A near-tight approximation algorithm for the robot localization problem
- Query point visibility computation in polygons with holes
- Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
- Polygonal model fitting
- Localizing a Robot with Minimum Travel
- A logical theory of localization
- Kernel-based construction operators for Boolean sum and ruled geometry
- scientific article; zbMATH DE number 910901 (Why is no real title available?)
- Locating a robot with angle measurements
- On validating planar worlds
- Voronoi graph matching for robot localization and mapping
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- On the minimum-time control problem for differential drive robots with bearing constraints
- Incremental algorithms to update visibility polygons
- scientific article; zbMATH DE number 1803766 (Why is no real title available?)
- Dynamic algorithms for visibility polygons in simple polygons
- Robot Localization without Depth Perception
This page was built for publication: The Robot Localization Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376162)