[1] SNAPE J, van den BERG J, GUY S J, et al. Smooth and collision-free navigation for multiple robots under differential-drive constraints[C]// IEEE/RSJ International Conference on Intelligent Robots and Systems. Piscataway: IEEE, 2010: 4584-4589.[2] van den BERG J, GUY S J, LIN M, et al. Reciprocal n-body collision avoidance[C]// Proceedings of the 14th International Symposium on International Symposium of Robotics Research. Berlin: Springer, 2011:3-19.[3] van den BERG J, ABBEEL P, GOLDBERG K. LQG-MP: optimized path planning for robots with motion uncertainty and imperfect state information[J]. The International Journal of Robotics Research, 2011,30(7):895-913.[4] HELBING D, VICSEK T. Optimal self-organization[J]. New Journal of Physics, 1999,1(3):1-13.[5] HELBING D, FARKAS I, VICSEK T, et al. Simulating dynamical features of escape panic[J]. Nature, 2000,407(6803):487-490.[6] HELBING D, BUZNA L, JOHANSSON A, et al. Self-organized pedestrian crowd dynamics: experiments, simulations, and design solutions[J]. Transportation Science, 2005,39(1):1-24.[7] 方正, 卢兆明. 建筑物避难疏散的网格模型[J]. 中国安全科学学报,2001,11(4):10-13.[8] HART P E, NILSSON N J, RAPHAEL B. A formal basis for the heuristic determination of minimum cost paths in graphs[J]. IEEE Transactions on Systems Science and Cybernetics, 1968, 4(2):100-107.[9] 段凡丁. 关于最短路径的SPFA快速算法[J]. 西南交通大学学报,1994,29(2):207-212.[10] WALD I, HAVRAN V. On building fast kd-trees for ray tracing, and on doing that in O(N log N)[C]// Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing. Piscataway: IEEE, 2006:61-69.[11] ZHOU K, HOU Q,WANG R, et al. Real-time kd-tree construction on graphics hardware[J]. ACM Transactions on Graphics,2008,27(5):1-11.[12] HUNT W, MARK W R, STOLL G, et al. Fast KD-tree construction with an adaptive error-bounded heuristic[C]// Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing. Piscataway: IEEE, 2006:81-88. |