The Robot Localization Problem
From MaRDI portal
DOI10.1137/S0097539792233257zbMATH Open0933.70004OpenAlexW1971836159MaRDI QIDQ4376162FDOQ4376162
Authors: Prabhakar Raghavan, Leonidas Guibas, Rajeev Motwani 
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792233257
Recommendations
Kinematics of mechanisms and robots (70B15) Computational methods for problems pertaining to mechanics of particles and systems (70-08)
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
- Localizing a Robot with Minimum Travel
- Polygonal model fitting
- Kernel-based construction operators for Boolean sum and ruled geometry
- A logical theory of localization
- Title not available (Why is that?)
- 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
- Incremental algorithms to update visibility polygons
- On the minimum-time control problem for differential drive robots with bearing constraints
- Title not available (Why is that?)
- 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)
