Skip to main content
SpringerLink
Log in

Weighted time-based global hierarchical path planning in dynamic environment

  • Published:
Transactions of Tianjin University Aims and scope Submit manuscript

Abstract

A weighted time-based global hierarchical path planning method is proposed to obtain the global optimal path from the starting point to the destination with time optimal control. First, the grid- or graph-based modeling is performed and the environment is divided into a set of grids or nodes. Then two time-based features of time interval and time cost are presented. The time intervals for each grid are built, during each interval the condition of the grid remains stable, and a time cost of passing through the grid is defined and assigned to each interval. Furthermore, the weight is introduced for taking both time and distance into consideration, and thus a sequence of multiscale paths with total time cost can be achieved. Experimental results show that the proposed method can handle the complex dynamic environment, obtain the global time optimal path and has the potential to be applied to the autonomous robot navigation and traffic environment.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Zhu D Q, Huang H, Yang S X. Dynamic task assignment and path planning of multi-AUV system based on an improved self-organizing map and velocity synthesis method in three-dimensional underwater workspace[J]. IEEE Transactions on Cybernetics, 2013, 43(2): 504–514.

    Google Scholar 

  2. Sud A, Andersen E, Curtis S et al. Real-time path planning for virtual agents in dynamic environments[C]. In: ACM SIGGRAPH. Los Angeles, USA, 2008.

    Google Scholar 

  3. Guzzi J, Giusti A, Gambardella L M et al. Human-friendly robot navigation in dynamic environments[C]. In: IEEE International Conference on Robotics and Automation (ICRA). Karlsruhe, Germany, 2013.

    Google Scholar 

  4. Garcia M A P, Montiel O, Castillo O et al. Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation[J]. Applied Soft Computing, 2009, 9(3): 1102–1110.

    Article  Google Scholar 

  5. Roberge V, Tarbouchi M, Labonte G. Comparison of parallel genetic algorithm and particle swarm optimization for real-time UAV path planning[J]. IEEE Transactions on Industrial Informatics, 2013, 9(1): 132–141.

    Article  Google Scholar 

  6. Koenig S, Likhachev M. Improved fast replanning for robot navigation in unknown terrain[C]. In: IEEE International Conference on Robotics and Automation (ICRA). Washington DC, USA, 2002.

    Google Scholar 

  7. Ghaffarkhah A, Mostofi Y. Path planning for networked robotic surveillance[J]. IEEE Transactions on Signal Processing, 2012, 60(7): 3560–3575.

    Article  MathSciNet  Google Scholar 

  8. Yue W Y, Franco J, Cao W W et al. A new anytime dynamic navigation algorithm[C]. In: Proceedings of the World Congress on Engineering and Computer Science. San Francisco, USA, 2012.

    Google Scholar 

  9. Ergezer H, Leblebicioglu K. Path planning for UAVs for maximum information collection[J]. IEEE Transactions on Aerospace and Electronic Systems, 2013, 49(1): 502–520.

    Article  Google Scholar 

  10. Lu Y B, Huo X, Tsiotras P. A beamlet-based graph structure for path planning using multiscale information[J]. IEEE Transactions on Automatic Control, 2012, 57(5): 1166–1178.

    Article  MathSciNet  Google Scholar 

  11. Nirmal B H, Mahendar V, Dilip K P. Time-optimal, collision-free navigation of a car-like mobile robot using neurofuzzy approaches[J]. Fuzzy Sets and Systems, 2006, 157(16): 2171–2204.

    Article  MATH  MathSciNet  Google Scholar 

  12. Phillips M, Likhachev M. SIPP: Safe interval path planning for dynamic environments[C]. In: IEEE International Conference on Robotics and Automation. Shanghai, China, 2011.

    Google Scholar 

  13. Ferguson D, Stentz A. The field D* algorithm for improved path planning and replanning in uniform and non-uniform cost environments[R]. Technical Report CMU-TR-RI-05-19. Carnegie Mellon University, USA, 2005.

    Google Scholar 

  14. Dijkstra E W. A note on two problems in connexion with graphs[J]. Numerische Mathematik, 1959, 1(1): 269–271.

    Article  MATH  MathSciNet  Google Scholar 

  15. Hart P E, Nilsson N J, Raphael B. A formal basis for the heuristic determination of minimum cost paths[J]. IEEE Transactions on Systems Science and Cybernetics, 1968, 4(2): 100–107.

    Article  Google Scholar 

  16. Koenig S, Likhachev M. D* lite[C]. In: AAAI Conference on Artificial Intelligence. Edmonton, Canada, 2002.

    Google Scholar 

  17. Stentz A. The focussed D* algorithm for real-time replanning[C]. In: International Joint Conference on Artificial Intelligence. Quebec, Canada, 1995.

    Google Scholar 

  18. Yue W Y, Franco J, Cao W W et al. ID* lite: Improved D* lite algorithm[C]. In: ACM Symposium on Applied Computing. Taiwan, China, 2011.

    Google Scholar 

  19. Likhachev M, Ferguson D. Planning long dynamically feasible maneuvers for autonomous vehicles[J]. The International Journal of Robotics Research, 2009, 28(8): 933–945.

    Article  Google Scholar 

  20. Rufli M, Ferguson D, Siegwart R. Smooth path planning in constrained environments[C]. In: IEEE International Conference on Robotics and Automation. Kobe, Japan, 2009.

    Google Scholar 

  21. Fox D, Burgard W, Thrun S. The dynamic window approach to collision avoidance[J]. IEEE Robotics & Automation Magazine, 1997, 4(1): 23–33.

    Article  Google Scholar 

  22. Wilkie D, van den Berg J, Manocha D. Generalized velocity obstacles[C]. In: International Conference on Intelligent Robots and Systems. St. Louis, USA, 2009.

    Google Scholar 

  23. Abhinav G, Rahul N, Lin M et al. Hybrid long-range collision avoidance for crowd simulation[C]. In: ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games. Orlando, USA, 2013.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Software Engineering, Beijing Jiaotong University, Beijing, 100044, China

    Weiwei Xing  (邢薇薇), Xiang Wei  (魏 翔) & Wei Lu  (卢 苇)

Authors
  1. Weiwei Xing  (邢薇薇)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiang Wei  (魏 翔)
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Lu  (卢 苇)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weiwei Xing  (邢薇薇).

Additional information

Supported by the National Natural Science Foundation of China (No. 61100143, No. 61370128), the Program for New Century Excellent Talents in University of the Ministry of Education of China (NCET-13-0659) and Beijing Higher Education Young Elite Teacher Project (YETP0583).

Xing Weiwei, born in 1980, female, Dr, associate Prof.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xing, W., Wei, X. & Lu, W. Weighted time-based global hierarchical path planning in dynamic environment. Trans. Tianjin Univ. 20, 223–231 (2014). https://doi.org/10.1007/s12209-014-2377-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12209-014-2377-5

Keywords

Search

Navigation