Planning constrained motion

Authors:
Steven Fortune;Gordon Wilfong
Affiliations:
AT&T Bell Laboratories, Murray Hill, New Jersey;AT&T Bell Laboratories, Murray Hill, New Jersey
Venue:
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Year:
1988

Citing 3
Cited 11

The complexity of elementary algebra and geometry

Journal of Computer and System Sciences
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints

Intelligent Autonomous Systems, An International Conference

Computational geometry column

ACM SIGACT News
Algorithmic Motion Planning in Robotics

Computer
Motion planning in the presence of movable obstacles

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Compliant motion in a simple polygon

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An exact algorithm for kinodynamic planning in the plane

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Gross motion planning—a survey

ACM Computing Surveys (CSUR)
Kinodynamic motion planning

Journal of the ACM (JACM)
A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)

Proceedings of the twelfth annual symposium on Computational geometry
Time-optimal smooth-path motion planning for a mobile robot with kinematic constraints

Robotica
Robot algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract