Advertisement

A temporal path planner for solving information inconsistency in an integrated path planner

  • Joon-Hong Seok
  • Joon-Woo Lee
  • Jung-Hyun Wang
  • Ju-Jang Lee
  • Ho Joo Lee
Robotics and Automation

Abstract

This paper proposes a temporal path planner (TPP) in an integrated path planner (IPP), which is composed of a global path planner (GPP) and a local path planner (LPP). The LPPs are able to avoid obstacles within the range of built-in sensors, but it is difficult to generate an efficient path outside of the sensor range and to avoid getting stuck in cul-de-sacs. The GPPs can generate efficient global paths in a target region using a built-in global map, but the accuracy is not always sufficient to avoid collision, and the performance is highly dependent upon the accuracy of the global map. A simple combination of a GPP and an LPP causes path mismatch problems due to inconsistencies between the information acquired from the local sensors and the information from the preliminary global map. When erroneous global waypoints caused by low-accuracy information or a change of terrain are given to the unmanned ground vehicle (UGV), the proposed method attempts to find a detour via the original global waypoints located nearby to accomplish successful navigation using only sensory information and the global waypoint sequence from the GPP result provided initially. The TPP includes three subalgorithms: the Temporal Waypoint Reviser (TWR), the Temporal Map Reviser (TMR) and the Temporal Distance-Heuristic-based Decision (TDHD). The simulation results demonstrate that the performance of the TPP outperforms other planners.

Keywords

Information inconsistency integrated path planner path mismatch problem temporal path planner 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Lee, B. Choi, K. Park, and J. Lee, “Comparison between heterogeneous ant colony optimization algorithm and genetic algorithm for global path planning of mobile robot,” Proc. of the IEEE Int. Symp. Ind. Electron., pp. 881–886, 2011.Google Scholar
  2. [2]
    S. Park, H. Jeong, J. Kim, D. Hwang, and S. Lee, “Magnetic compass fault detection method for GPS/INS/magnetic compass integrated navigation systems,” Int. J. Control, Automation, and Systems, vol. 9, no. 2, pp. 276–284, 2011.CrossRefGoogle Scholar
  3. [3]
    S. Park and B. Lee, “A new analytical representation to robot path generation with collision avoidance through the use of the collision map,” Int. J. Control, Automation, and Systems, vol. 4, no. 1, p. 77, 2006.Google Scholar
  4. [4]
    B. Choi, J. Lee, J. Lee, and K. Park, “A hierarchical algorithm for indoor mobile robot localization using RFID sensor fusion,” IEEE Trans. Ind. Electron., vol. 58, no. 6, pp. 2226–2235, 2011.CrossRefGoogle Scholar
  5. [5]
    S. Bandi and D. Thalmann, “Space discretization for efficient human navigation,” Computer Graphics Forum, vol. 17, no. 3, pp. 195–206, 1998.CrossRefGoogle Scholar
  6. [6]
    A. Howard, H. Seraji, and B. Werger, “Global and regional path planners for integrated planning and navigation,” J. Robotic Systems, vol. 22, no. 12, pp. 767–778, 2005.CrossRefzbMATHGoogle Scholar
  7. [7]
    K. Chu, M. Lee, and M. Sunwoo, “Local path planning for offroad autonomous driving with avoidance of static obstacles,” IEEE Trans. Intell. Transp. Syst., vol. 13, no. 4, pp. 1599–1616, 2012.CrossRefzbMATHGoogle Scholar
  8. [8]
    A. Kelly, A. Stentz, O. Amidi, M. Bode, D. Bradley, and A. Diaz-Calderon et al., “Toward reliable off road autonomous vehicles operating in challenging environments,” Int. J. Rob. Res., vol. 25, no. 5–6, pp. 449–483, 2006.CrossRefGoogle Scholar
  9. [9]
    S. Thrun, M. Montemerlo, H. Dahlkamp, D. Stavens, A. Aron, and J. Diebel et al., “Stanley: The robot that won the DARPA grand challenge,” The 2005 DARPA Grand Challenge, pp. 1–43, 2007.CrossRefGoogle Scholar
  10. [10]
    T. Luettel, M. Himmelsbach, and H. Wuensche, “Autonomous ground vehicles? Concepts and a path to the future,” Proc. the IEEE, vol. 100, no. 13, pp. 1831–1839, 2012.CrossRefGoogle Scholar
  11. [11]
    N. Nilsson, “Problem-solving methods in,” Artificial Intelligence, 1971.Google Scholar
  12. [12]
    A. Stentz, “The focused D* algorithm for real-time replanning,” Proc. of Int. Joint Conf. Artificial Intelligence, vol. 14, pp. 1652–1659, 1995.Google Scholar
  13. [13]
    S. Koenig and M. Likhachev, “D* lite,” Proc. Int. Conf. Artificial Intelligence, pp. 476–483, 2002.Google Scholar
  14. [14]
    M. Seder, P. Mostarac, and I. Petrović, “Hierarchical path planning of mobile robots in complex indoor environments,” Trans. Inst. Meas. Control, vol. 33, no. 3–4, pp. 332–358, 2011.CrossRefGoogle Scholar
  15. [15]
    K. W. Kwak, K.-S. Kim, and S. Kim, “Weighted virtual tangential vector algorithm for local path planning of mobile robots,” Electron. Letters, vol. 49, no. 4, pp. 255–256, 2013.CrossRefGoogle Scholar
  16. [16]
    J. Borenstein and Y. Koren, “The vector field histogram-fast obstacle avoidance for mobile robots,” IEEE Trans. Robot. Autom., vol. 7, no. 3, pp. 278–288, 1991.CrossRefGoogle Scholar

Copyright information

© Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Joon-Hong Seok
    • 1
  • Joon-Woo Lee
    • 1
  • Jung-Hyun Wang
    • 2
  • Ju-Jang Lee
    • 1
  • Ho Joo Lee
    • 3
  1. 1.Department of Electrical EngineeringKorea Advanced Institute of Science and TechnologyDaejeonKorea
  2. 2.Robotics ProgramKorea Advanced Institute of Science and TechnologyDaejeonKorea
  3. 3.5th R&D Institute at Agency for Defense DevelopmentDaejeonKorea

Personalised recommendations