Weighted time-based global hierarchical path planning in dynamic environment

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.

[1]  Roland Siegwart,et al.  Smooth path planning in constrained environments , 2009, ICRA 2009.

[2]  Sven Koenig,et al.  Improved fast replanning for robot navigation in unknown terrain , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[3]  Kemal Leblebicioglu,et al.  Path Planning for UAVs for Maximum Information Collection , 2013, IEEE Transactions on Aerospace and Electronic Systems.

[4]  Dinesh Manocha,et al.  Real-time Path Planning for Virtual Agents in Dynamic Environments , 2007, VR.

[5]  Dilip Kumar Pratihar,et al.  Time-optimal, collision-free navigation of a car-like mobile robot using neuro-fuzzy approaches , 2006, Fuzzy Sets Syst..

[6]  Wolfram Burgard,et al.  The dynamic window approach to collision avoidance , 1997, IEEE Robotics Autom. Mag..

[7]  Vincent Roberge,et al.  Comparison of Parallel Genetic Algorithm and Particle Swarm Optimization for Real-Time UAV Path Planning , 2013, IEEE Transactions on Industrial Informatics.

[8]  Weiwei Cao,et al.  ID* Lite: improved D* Lite algorithm , 2011, SAC '11.

[9]  Mahyar A. Amouzegar,et al.  World Congress on Engineering and Computer Science , 2008 .

[10]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

[11]  Ming C. Lin,et al.  Hybrid Long-Range Collision Avoidance for Crowd Simulation , 2013, IEEE Transactions on Visualization and Computer Graphics.

[12]  Maxim Likhachev,et al.  Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles , 2008, Int. J. Robotics Res..

[13]  Maxim Likhachev,et al.  SIPP: Safe interval path planning for dynamic environments , 2011, 2011 IEEE International Conference on Robotics and Automation.

[14]  Beatrice Gralton,et al.  Washington DC - USA , 2008 .

[15]  Luca Maria Gambardella,et al.  Human-friendly robot navigation in dynamic environments , 2013, 2013 IEEE International Conference on Robotics and Automation.

[16]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[17]  Simon X. Yang,et al.  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 , 2013, IEEE Transactions on Cybernetics.

[18]  Oscar Castillo,et al.  Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation , 2009, Appl. Soft Comput..

[19]  Yasamin Mostofi,et al.  Path Planning for Networked Robotic Surveillance , 2012, IEEE Transactions on Signal Processing.

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[21]  Panagiotis Tsiotras,et al.  A Beamlet-Based Graph Structure for Path Planning Using Multiscale Information , 2012, IEEE Transactions on Automatic Control.

[22]  Dinesh Manocha,et al.  Generalized velocity obstacles , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.