Skip to main content

The Route Planning Algorithm Based on Polygon Fusion

  • Conference paper
  • First Online:
Modeling, Design and Simulation of Systems (AsiaSim 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 751))

Included in the following conference series:

  • 2558 Accesses


Route planning is widely used in public transportation, military and other fields. However, the mainstream algorithm adaptability is not comprehensive for the terrain, especially in barrier dense areas, such as A* algorithm, ant colony algorithm and so on. In these algorithms, time-consuming may be too high and planned route may be not optimal. To solve this problem, we propose a novel route planning algorithm based on polygon fusion (RABP). The basic principle of RABP is based on the plane geometry of the shortest line between two points, so the algorithm has strong guidance. Therefore, the algorithm has the advantages of low time-consuming and short route length. At the same time, because of the complex polygon fusion, too strong guidance would not make route planning cannot be accomplished. The algorithm needs to merge the barriers to avoid them and carry on route planning. Meanwhile, it will use the simplified operator to remove the redundant points on the planning route, so the final route is smoother and the route length is shorter. The experiment result shows that the RABP algorithm is more adaptive than A* algorithm and ant colony algorithm to dense barrier areas, the planning route is shorted and consumes less time.

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

Access this chapter

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions


  1. Meng, X.Q., Xue, Q., Long, L.: Convex polygon amalgamation algorithm used in real-time obstacle avoidance in virtual environment. J. Syst. Simul. (2006)

    Google Scholar 

  2. Wang, B., Li, J., Gao, L.: An efficient polygon integration algorithm in grid pathfinding-border crawling algorithm. Comput. Inf. Technol. 3, 006 (2012)

    Google Scholar 

  3. Zhang, G., Hu, X., Chai, J., et al.: Summary of path planning algorithm and its application. Mod. Mach. 5, 85–90 (2011)

    Google Scholar 

  4. Qiu, L.: Implementation of pathfinding on game maps based A-star algorithm and compare the performances of various algorithms. J. Shaanxi Univ. Sci. Technol. (2011)

    Google Scholar 

  5. Xin, Y., Liang, H., Du, M., et al.: An improved A* algorithm for searching infinite neighbourhoods. Robot 36, 627–633 (2014)

    Google Scholar 

  6. Shi, E., Chen, M., Li, J., et al.: Research on method of global path-planning for mobile robot based on ant-colony algorithm. Trans. Chin. Soc. Agric. Mach. 45(6), 53–57 (2014)

    Google Scholar 

  7. Li, L.-R., Wang, L., Gao, Y.B., et al.: A dynamic path planning model based on the optimal ant colony algorithm. J. Guangxi Univ. (2013)

    Google Scholar 

  8. Zhou, M.X.: Improved ant colony algorithm with planning of dynamic path. Comput. Sci. 40(1), 314–316 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Jing Luan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Luan, J., Lei, Y., Tang, W., Yao, Y. (2017). The Route Planning Algorithm Based on Polygon Fusion. In: Mohamed Ali, M., Wahid, H., Mohd Subha, N., Sahlan, S., Md. Yunus, M., Wahap, A. (eds) Modeling, Design and Simulation of Systems. AsiaSim 2017. Communications in Computer and Information Science, vol 751. Springer, Singapore.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6462-3

  • Online ISBN: 978-981-10-6463-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics