scientific article; zbMATH DE number 1182933
From MaRDI portal
Publication:4401030
zbMATH Open0925.93625MaRDI QIDQ4401030FDOQ4401030
Authors: Micha Sharir 
Publication date: 8 November 1999
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Automated systems (robots, etc.) in control theory (93C85)
Cited In (13)
- \textsc{Pull} and \textsc{PushPull} are PSPACE-complete
- On-line motion planning: Case of a planar rod
- Motion planning in connected sums of real projective spaces
- Instabilities of robot motion
- Approximation algorithms for aligning points
- Pushing blocks is hard.
- On the growth of topological complexity
- Leaving an unknown maze using an error-prone compass
- Minimizing interference of a wireless ad-hoc network in a plane
- Geometric design of motions constrained by a contacting surface pair
- Online exploration outside a convex obstacle
- Smoothed analysis of probabilistic roadmaps
- Polygonal chains cannot lock in 4D
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)
