Reaching a goal with directional uncertainty

DOI10.1016/0304-3975(94)00237-DzbMath0873.68190OpenAlexW1983054278MaRDI QIDQ673767

Dan Halperin, Leonidas J. Guibas, Otfried Schwarzkopf, Mark T. de Berg, Mark H. Overmars

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

zbMATH Keywords

planar motion planning for robots

Mathematics Subject Classification ID

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

Related Items (1)

REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY

Cites Work

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

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