[2] KAVRAKI L E, SVESTKA P, LATOMBE J C, et al.Probabilistic roadmaps for path planning in high-dimensional configuration spaces［J］.IEEE Transactions on Robotics and Automation, 1996, 12(4):566-580.

[4] DIJKSTRA E W.A note on two problems in connexion with graphs［J］.Numerische Mathematik, 1959, 1:269-271.

[8] KORF R E.Depth-first iterative-deepening:an optimal admissible tree search［M］//RAETH P G.Expert systems:a software methodology for modern applications, Washington D.C.:IEEE Computer Society Press, 1991:380-389.

[10] BOTEA A, MLLER M, SCHAEFFER J.Near optimal hierarchical path-finding［J］.Journal of Game Develop-ment, 2004:1-30.https：//www.docin.com/p-44133263. html.