Finding the Safest One-Dimensional Path among Obstacles for the Acceleration Constrained Robot
Reference8 articles.
1. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Näher, S. Schirra and C. Uhrig, “Approximate motion planning and the complexity of the boundary o the union of simple geometric figures,” Proc. 6th Annual Symposium on Computational Geometry, pp. 281-289, 1990. 2. B. Donald, P. Xavier, “Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators,” Proc. 6th Annual Symposium on Computational Geometry, pp. 290-300, 1990. 3. J. Canny, B. Donald, J. Reif and P. Xavier, “On the complexity of kinodynamic planning,” Proc. 29th IEEE Symposium on Foundations of Computer Science, pp. 306-318, 1988. 4. J. Canny, A. Rege, and J. Reif, “An exact algorithm for kinodynamic planning in the plane,” Proc. 6th Annual Symposium on Computational Geometry, pp. 271-280, 1990. 5. C. Ó’Dúnlaing, “Motion planning with inertial constraints,” Algorithmica, vol. 2(4), pp. 431–475, 1987.
|
|