A shortest distance route is crucial in emergent navigations including rescue and military applications. This paper proposes a method of the shortest distance routing considering turn penalties. First, unnavigable shallow areas are obtained based on tracing of the safety contours, and they are processed together with other fixed obstacle areas. Then paths bypassing two sides of obstacle areas are analyzed, a binary tree of route is created, navigable paths are tested, and a shortest route is acquired automatically. Finally, a penalty is considered for each turn, and different penalties of turn angles are further analyzed. Experimental results demonstrate that the proposed method can acquire a shortest distance route considering turn penalties.
CITATION STYLE
Zhang, L., & Wang, T. (2014). A method for the shortest distance routing considering turn penalties. In Advances in Intelligent Systems and Computing (Vol. 279, pp. 219–227). Springer Verlag. https://doi.org/10.1007/978-3-642-54927-4_21
Mendeley helps you to discover research relevant for your work.