1. A. R. Ahuja, T. L. Magnanti, and J. B. Orlin, “Network Flows: Theory, Algorithms and Applications,” Prentice-Hall, 1993.
2. J.S.B. Mitchell, “Geometric Shortest Paths and Network Optimization,”Handbook of Computational Geometry, Elsevier Science, pp. 633–701, 2000.
3. A. Atramentov and S. LaValle, “Efficient Nearest Neighbor Searching for Motion Planning,”Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Press., pp. 632–637, 2002.
4. D. Aarno, D. Kragic, and H. Christensen, “Artificial Potential Biased Probabilistic Roadmap Method,”Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Press., pp. 461–466, 2004.
5. A. Stenz, “The Focussed D* Algorithm for Real-Time Replanning,”Proceedings of the International Joint Conference on Artifzcial Intelligence, pp. 1652–1659, 1995.