Optimal path planning under different norms in continuous state spaces

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2006, Issue , 2006, Pages 866-872

  Alton, Ken ^a   Mitchell, Ian M ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; GRAPH THEORY; STATE SPACE METHODS;

DIJKSTRA'S DISCRETE ALGORITHM; DISCRETE GRAPH; OPTIMAL PATH PLANNING;

MOTION PLANNING;

EID: 33845612819     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2006.1641818     Document Type: Conference Paper

References (18)

1. E. W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik 1, pp. 269-271, 1959.
2. J. N. Tsitsiklis, "Efficient algorithms for globally optimal trajectories," IEEE Transactions on Automatic Control, vol. AC-40, no. 9, pp. 1528-1538, 1995.
3. R. Kimmel and J. A. Sethian, "Optimal algorithm for shape from shading and path planning," Journal of Mathematical Imaging and Vision, vol. 14, no. 3, pp. 237-244, 2001.
4. _, "Computing geodesic paths on manifolds," Proceedings of the National Academy of Sciences, USA, vol. 95, no. 15, pp. 8431-8435, 1998.
5. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, UK: Cambridge University Press, 2004.
6. M. Bardi and I. Capuzzo-Dolcetta, Optimal Control and Viscosity Solutions of Hamillon-Jacobi-Bellman equations. Boston: Birkhäuser, 1997.
7. J. A. Sethian and A. Vladimirsky, "Ordered upwind methods for static Hamilton-Jacobi equations," Proceedings of the National Academy of Sciences, USA, vol. 98, no. 20, pp. 11069-11074, 2001.
8. C.-Y. Kao, S. Osher, and Y.-H. Tsai, "Fast sweeping methods for static Hamilton-Jacobi equations," SIAM Journal on Numerical Analysis, vol. 42, no. 6, pp. 2612-2632, 2005.
9. J.-C. Latombe, Robot Motion Planning. Boston: Kluwer Academic Publishers, 1991.
10. J. Barraquand, B. Langlois, and J. Latombe, "Numerical potential field techniques for robot path planning," IEEE Transactions on Systems, Man and Cybernetics, vol. 22, no. 2, pp. 224-241, 1992.
11. S. M. LaValle, "Numerical computation of optimal navigation functions on a simplicial complex," in Robotics: The Algorithmic Perspective, P. Agarwal, L. Kavraki, and M. Mason, Eds. Wellesley, MA: A K Peters, 1998, pp. 339-350.
12. K. Konolige, "A gradient method for realtime robot control," in Proceedings of IEEE IROS, 2000, pp. 639-646.
13. D. Ferguson and A. Stentz, "The delayed D* algorithm for efficient path replanning," in Proceedings of IEEE ICRA, 2005, pp. 2057-2062.
14. J. Rosell and P. Iniguez, "Path planning using harmonic functions and probabilistic cell decomposition," in Proceedings of IEEE ICRA, 2005, pp. 1815-1820.
15. L. E. Kavraki and J.-C. Latombe, "Randomized preprocessing of configuration for fast path planning," in Proceedings of IEEE ICRA, 1994, pp. 2138-2145.
16. S. M. LaValle, M. S. Branicky, and S. R. Lindemann, "On the relationship between classical grid search and probabilistic roadmaps," International Journal of Robotics Research, vol. 23, no. 7-8, pp. 673-692, 2004.
17. J. Sethian and A. Vladimirsky, "Fast methods for the Eikonal and related Hamilton-Jacobi equations on unstructured meshes," Proceedings of the National Academy of Sciences, USA, vol. 97, no. 11, pp. 5699-5703, May, 2000.
18. J. M. Maubach, "Local bisection refinement for n-simplicial grids generated by reflection," SIAM Journal on Scientific Computation, vol. 16, no. 1, pp. 210-227, Jan., 1995.