Fast Marching and Fast Driving: Combining Off-Line Search and Reactive AI.
作者： Daniel Livingstone , Robert McDowell
DOI:
关键词: Feature (computer vision) 、 Off line 、 Computer science 、 Range (mathematics) 、 Fast marching method 、 Motion planning 、 Computer engineering 、 Strengths and weaknesses
摘要: Fast Marching Methods, FMM, have a wide range of applications, including path planning and navigation, but rarely feature in surveys techniques. For some however, FMM are more suitable than other popular techniques, such as A*. This paper provides brief outline how may be applied to problems notes the strengths weaknesses method. Finally, an example application is provided, derived from work that was carried out on published game.
参考文章(7)
James Albert Sethian, Level set methods and fast marching methods : evolving interfaces in computational geometry, fluid mechanics, computer vision, and materials science Cambridge University Press. ,(1999)
Matt Ginsberg, Essentials of Artificial Intelligence ,(1993)
Ron Kimmel, James A. Sethian, Optimal Algorithm for Shape from Shading and Path Planning Journal of Mathematical Imaging and Vision. ,vol. 14, pp. 237- 244 ,(2001) , 10.1023/A:1011234012449
R. Kimmel, J. A. Sethian, Computing geodesic paths on manifolds Proceedings of the National Academy of Sciences of the United States of America. ,vol. 95, pp. 8431- 8435 ,(1998) , 10.1073/PNAS.95.15.8431
J. A. Sethian, Fast Marching Methods SIAM Review. ,vol. 41, pp. 199- 235 ,(1999) , 10.1137/S0036144598347059
E. W. Dijkstra, A note on two problems in connexion with graphs Numerische Mathematik. ,vol. 1, pp. 269- 271 ,(1959) , 10.1007/BF01386390
Bryan Stout, Smart Moves: Intelligent Pathfinding ,(1998)