GPU-based dynamic search on adaptive resolution grids
暂无分享,去创建一个
[1] Glenn Reinman,et al. Parallelized egocentric fields for autonomous navigation , 2012, The Visual Computer.
[2] Ugo Erra,et al. GPU Accelerated Multi-agent Path Planning Based on Grid Space Decomposition , 2012, ICCS.
[3] Adolfy Hoisie,et al. Performance Analysis of Wavefront Algorithms on Very-Large Scale Distributed Systems , 1998, Wide Area Networks and High Performance Computing.
[4] Norman I. Badler,et al. Dynamic search on the GPU , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[5] Richard E. Korf,et al. Distributed Tree Search and Its Application to Alpha-Beta Pruning , 1988, AAAI.
[6] David Eppstein,et al. The skip quadtree: a simple dynamic data structure for multidimensional data , 2005, SCG.
[7] Murray H. Loew,et al. The quadcode and its arithmetic , 1987, CACM.
[8] Pascal J. Frey,et al. Fast Adaptive Quadtree Mesh Generation , 1998, IMR.
[9] Dinesh Manocha,et al. Reciprocal n-Body Collision Avoidance , 2011, ISRR.
[10] Richard E. Korf,et al. Depth-First Heuristic Search on a SIMD Machine , 1993, Artif. Intell..
[11] Sebastian Thrun,et al. Anytime Dynamic A*: An Anytime, Replanning Algorithm , 2005, ICAPS.
[12] Anupam Shukla,et al. A Focused Wave Front Algorithm for Mobile Robot Path Planning , 2011, HAIS.
[13] Murray H. Loew,et al. Adjacency detection using quadcodes , 1987, CACM.
[14] Dinesh Manocha,et al. ClearPath: highly parallel collision avoidance for multi-agent simulation , 2009, SCA '09.