scientific article; zbMATH DE number 1182933

MaRDI QIDQ4401030zbMATH OpenFDO

Authors Micha Sharir

Publication date 8 November 1999

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automated systems (robots, etc.) in control theory (93C85)

Cited in

(13)

• Smoothed analysis of probabilistic roadmaps
• On-line motion planning: Case of a planar rod
• Pushing blocks is hard.
• Approximation algorithms for aligning points
• Instabilities of robot motion
• Online exploration outside a convex obstacle
• On the growth of topological complexity
• Geometric design of motions constrained by a contacting surface pair
• \textsc{Pull} and \textsc{PushPull} are PSPACE-complete
• Leaving an unknown maze using an error-prone compass
• Motion planning in connected sums of real projective spaces
• Polygonal chains cannot lock in 4D
• Minimizing interference of a wireless ad-hoc network in a plane

This page was built for publication:

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