Continuous alternation: The complexity of pursuit in continuous domains
暂无分享,去创建一个
[1] Bruce Randall Donald,et al. Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators , 1990, SCG '90.
[2] Micha Sharir,et al. On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..
[3] Arthur E. Bryson,et al. Applied Optimal Control , 1969 .
[4] J. Reif. A Survey on Advances in the Theory of Computational Robotics , 1986 .
[5] John F. Canny,et al. Some algebraic and geometric computations in PSPACE , 1988, STOC '88.
[6] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[7] S. LaValle,et al. Motion Planning , 2008, Springer Handbook of Robotics.
[8] J. T. Shwartz,et al. On the Piano Movers' Problem : III , 1983 .
[9] J. Reif,et al. Approximate Kinodynamic Planning Using L2-norm Dynamic Bounds , 1990 .
[10] J. Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .
[11] Bruce Randall Donald,et al. On the complexity of kinodynamic planning , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[12] James A. Storer,et al. 3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles , 1988, MFCS.
[13] A. Guez. Optimal control of robotic manipulators , 1983 .
[14] Kang G. Shin,et al. Selection of Near-Minimum Time Geometric Paths for Robotic Manipulators , 1985, 1985 American Control Conference.
[15] Jean-Claude Latombe,et al. Motion planning in the presence of moving obstacles , 1992 .
[16] 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).
[17] W. Böge,et al. Quantifier Elimination for Real Closed Fields , 1985, AAECC.
[18] J. Hollerbach. Dynamic Scaling of Manipulator Trajectories , 1983, 1983 American Control Conference.
[19] Christos H. Papadimitriou,et al. An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..
[20] Heinz M. Schaettler. On the time-optimality of bang-bang trajectories in ³ , 1987 .
[21] John M. Hollerbach,et al. Planning of Minimum- Time Trajectories for Robot Arms , 1986 .
[22] Bruce Randall Donald,et al. A provably good approximation algorithm for optimal-time trajectory planning , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[23] Colm Ó'Dúnlaing. Motion planning with inertial constraints , 2005, Algorithmica.
[24] Kenneth L. Clarkson,et al. Approximation algorithms for shortest path motion planning , 1987, STOC.
[25] John F. Canny,et al. An exact algorithm for kinodynamic planning in the plane , 1990, SCG '90.
[26] James A. Storer,et al. Minimizing turns for discrete movement in the interior of a polygon , 1987, IEEE J. Robotics Autom..
[27] John H. Reif,et al. Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[28] George E. Collins,et al. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.
[29] Bruce Randall Donald. The complexity of planar compliant motion planning under uncertainty , 1988, SCG '88.
[30] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.