REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY

DOI10.1142/S0218195901000456zbMATH Open1074.68634OpenAlexW2164290756MaRDI QIDQ4682175FDOQ4682175

Authors: René van Oostrum, Otfried Cheong 

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195901000456

Recommendations

• Reaching a goal with directional uncertainty
• An efficient algorithm for one-step planar compliant motion planning with uncertainty
• Going home through an unknown street
• Reachability by paths of bounded curvature in a convex polygon
• On-line path planning in an unknown polygonal environment

zbMATH Keywords

uncertaintyComputational geometryconvex polygonmotion planning

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cites Work

• The complexity and construction of many faces in arrangements of lines and of segments
• Fat Triangles Determine Linearly Many Holes
• Reaching a goal with directional uncertainty

Cited In (1)

• Aperture-angle and Hausdorff-approximation of convex figures

This page was built for publication: REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682175)