On computability of fine motion plans
暂无分享,去创建一个
[1] Stephen J. Buckley. Planning and teaching compliant motion strategies , 1987 .
[2] D. Grigor'ev. Complexity of deciding Tarski algebra , 1988 .
[3] John F. Canny,et al. Some algebraic and geometric computations in PSPACE , 1988, STOC '88.
[4] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .
[5] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[6] Bruce Randall Donald. The complexity of planar compliant motion planning under uncertainty , 1988, SCG '88.
[7] Russell H. Taylor,et al. Sensor-based manipulation planning as a game with nature , 1988 .
[8] Michael A. Erdmann,et al. Using Backprojections for Fine Motion Planning with Uncertainty , 1986 .
[9] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[10] Russell H. Taylor,et al. Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .
[11] Matthew T. Mason,et al. An exploration of sensorless manipulation , 1986, IEEE J. Robotics Autom..
[12] Hirochika Inoue,et al. Force Feedback in Precise Assembly Tasks , 1974 .
[13] Bruce Randall Donald,et al. A Geometric Approach to Error Detection and Recovery for Robot Motion Planning with Uncertainty , 1987, Artif. Intell..
[14] Matthew T. Mason,et al. Automatic planning of fine motions: Correctness and completeness , 1984, ICRA.