REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY

DOI10.1142/S0218195901000456MaRDI QIDQ4682175zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Computational geometryconvex polygonmotion planninguncertainty

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(1)

• Reaching a goal with directional uncertainty

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)