The Robot Localization Problem
From MaRDI portal
Publication:4376162
DOI10.1137/S0097539792233257zbMath0933.70004OpenAlexW1971836159MaRDI QIDQ4376162
Prabhakar Raghavan, Leonidas J. Guibas
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
Computational methods for problems pertaining to mechanics of particles and systems (70-08) Kinematics of mechanisms and robots (70B15)
Related Items (9)
Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints ⋮ Visibility queries in a polygonal region ⋮ On the minimum-time control problem for differential drive robots with bearing constraints ⋮ Kernel-based construction operators for Boolean sum and ruled geometry ⋮ Incremental Algorithms to Update Visibility Polygons ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Query point visibility computation in polygons with holes ⋮ GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST ⋮ Efficient visibility queries in simple polygons
This page was built for publication: The Robot Localization Problem
