Two-stage Hybrid A* path-planning in large petrochemical complexes

In this study, we aim to achieve path-planning for firefighter robots in large petrochemical complexes. In large environments, path-planning (e.g., Hybrid A*) requires a large computation memory and a long execution time. These constrains are not feasible for firefighter robots. In order to overcome these two challenges, we propose a two-stage hybrid A* path-planning. For the first stage we use a global path-planner that makes a path using a low-resolution grid map of 2 m. The global path-planner generates a path for an area of approx. 500 m ×1000 m in 10 seconds. In the second stage, we refine the path by using a local-planner that uses a local-map of 100 m ×100 m size around the robot with a high resolution grid of 1 m. The local planner receives its sub-goal from the global planner and recalculates a local path at a high speed of a few hundred milliseconds. Therefore, the local-planner can react to changes of the map due to obstacles in real-time. We evaluated our proposed method by comparing with conventional hybrid A* in simulated as well as real experimental data of petrochemical complexes. By employing the local-planner our method could drastically reduce the used memory and execution time for the re-planning. For a trajectory of 600 m, our method reduces the execution time by 99.2% for real data and by 94.34% for simulated data. The memory usage was likewise drastically reduced by 97.45% for real data and by 97.91% for simulated data.

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

[2]  Mark H. Overmars,et al.  New methods for computing visibility graphs , 1988, SCG '88.

[3]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[4]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[5]  L. Dubins On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[6]  Ben J. A. Kröse,et al.  Hierarchical map building and planning based on graph partitioning , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[7]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[8]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[9]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[10]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

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

[12]  Robert C. Holte,et al.  Hierarchical A*: Searching Abstraction Hierarchies Efficiently , 1996, AAAI/IAAI, Vol. 1.

[13]  Sebastian Thrun,et al.  Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments , 2010, Int. J. Robotics Res..

[14]  Anthony Stentz,et al.  Field D*: An Interpolation-Based Path Planner and Replanner , 2005, ISRR.

[15]  Adi Botea,et al.  Near Optimal Hierarchical Path-Finding , 2004, J. Game Dev..