Reaching a goal with directional uncertainty

DOI10.1016/0304-3975(94)00237-DzbMATH Open0873.68190OpenAlexW1983054278MaRDI QIDQ673767FDOQ673767

Authors: Leonidas Guibas, Dan Halperin, Mark de Berg, Mark H. Overmars, Otfried Cheong 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00237-d

Recommendations

• REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY
• An efficient algorithm for one-step planar compliant motion planning with uncertainty
• Efficiently Planning Compliant Motion in the Plane
• The complexity of planar compliant motion planning under uncertainty

zbMATH Keywords

planar motion planning for robots

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Automated systems (robots, etc.) in control theory (93C85)

Cites Work

• Constructing Arrangements of Lines and Hyperplanes with Applications
• The complexity and construction of many faces in arrangements of lines and of segments
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Landmark-based robot navigation
• On fat partitioning, fat covering and the union size of polygons
• The complexity of planar compliant motion planning under uncertainty
• Input-sensitive compliant motion in the plane

Cited In (3)

• REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY
• Reachability in a planar subdivision with direction constraints
• An efficient algorithm for one-step planar compliant motion planning with uncertainty

This page was built for publication: Reaching a goal with directional uncertainty

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