Skip to main content

A Method for the Shortest Distance Routing Considering Turn Penalties

  • Conference paper
  • First Online:
  • 1226 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 279))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Chang KY, Jan GE, Parberry I (2003) A method for searching optimal routes with collision. Avoidance on raster charts. J Navig 56:371–384

    Article  Google Scholar 

  2. Rafal S (2006) A new method of ship routing on raster grids, with turn penalties and collision avoidance. J Navig 59:371–384

    Google Scholar 

  3. Wang K (2004) A study for designing navigation route based on ECDIS. MS thesis, Dalian Naval Academy

    Google Scholar 

  4. Ye Q, Zhen ZW (2003) The improved shortcut algorithm and its application in selecting ship’s optimum route. Navig China 55:15–17

    Google Scholar 

  5. Zhang LH, Zhu Q, Liu YC, Li SJ (2007) A method for automatic routing based on ENC. J Dalian Marit Univ 33:109–112

    Google Scholar 

  6. Zhang L, Zhang LH, Wang Z, Jia SD (2010) A method for shortest distance routing in a chart based on testing a spatial relation of a route segment and an obstacle area. In: Proceedings of the 2nd international conference on advanced computer control. Shenyang 142–147

    Google Scholar 

  7. Zhang L, Wang Z, Li SJ, Zhang LH (2010) A method for automatic routing based on comprehensive evaluation on limiting conditions of maneuverability. In: The 18th international conference on geoinformatics, Bejing

    Google Scholar 

  8. Li ZB, Zhang XK, Jia Y (2008) A study for slowdown effect during a ship altering its course. Mar Technol 3:1–4

    Google Scholar 

Download references

Acknowledgments

This study is supported by the National High Technology Research and Development Program of China (2012AA12A406) and the National Natural Science Foundation of China (41171349).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lihua Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, L., Wang, T. (2014). A Method for the Shortest Distance Routing Considering Turn Penalties. In: Wen, Z., Li, T. (eds) Practical Applications of Intelligent Systems. Advances in Intelligent Systems and Computing, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54927-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54927-4_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54926-7

  • Online ISBN: 978-3-642-54927-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics