Advertisement

Robot Operating System Based Path Planning

  • Ashwin Vasudevan
  • Ajith Kumar
  • Nrithya TheetharapanEmail author
  • N. S. Bhuvaneswari
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 38)

Abstract

As autonomous cars are catapulted into prominence, path planning has taken the center stage. In this study, We implement the Tangent-bug approach to path planning. We have discretised the Tangent-bug algorithm into a set of independent operations. Transition from one iteration to the next is governed by the value of the range sensor and the convergent criterion. The tangent detection and tangent selection algorithms are tested by implementing on a 2D differential drive robot in the player stage simulator. Contrary to existing solutions, this paper proposes implementation on standard robotics middle-ware ROS (Robot Operating System) allowing effortless deployment on various robotics platforms. Features developed in this module are decentralised, amenable to scaling across multiple robotics platforms with minimal configuration.

Keywords

Tangent-bug Path planning Robot Operating System Obstacle detection Player stage simulator 

References

  1. 1.
    Cousins, S.: Welcome to ROS topics [ROS topics]. IEEE Robot. Autom. Mag. 17(1), 13–14 (2010)CrossRefGoogle Scholar
  2. 2.
    Gerkey, B., Vaughan, R.T., Howard, A.: The player/stage project: tools for multi-robot and distributed sensor systems. In: Proceedings of the 11th International Conference on Advanced Robotics, vol. 1, pp. 317–323 (2003)Google Scholar
  3. 3.
    Gossow, D., Leeper, A., Hershberger, D., Ciocarlie, M.: Interactive markers: 3-D user interfaces for ROS applications [ROS topics]. IEEE Robot. Autom. Mag. 18(4), 14–15 (2011)CrossRefGoogle Scholar
  4. 4.
    Koenig, N., Howard, A.: Design and use paradigms for Gazebo, an open-source multi-robot simulator. In: Proceedings of the 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2004, vol. 3, pp. 2149–2154. IEEE (2004)Google Scholar
  5. 5.
    Ng, J., Bräunl, T.: Performance comparison of bug navigation algorithms. J. Intell. Robot. Syst. 50(1), 73–84 (2007)CrossRefGoogle Scholar
  6. 6.
    Pohl, I.: Bi-directional and heuristic search in path problems. Ph.D. thesis, Department of Computer Science, Stanford University (1969)Google Scholar
  7. 7.
    Rui, W., Xiaoge, L., Shuo, W.: A laser scanning data acquisition and display system based on ROS. In: 2014 33rd Chinese Control Conference (CCC), pp. 8433–8437. IEEE (2014)Google Scholar
  8. 8.
    Selman, B., Gomes, C.P.: Hill-climbing search. In: Encyclopedia of Cognitive Science (2006)Google Scholar
  9. 9.
    Skogestad, S., Postlethwaite, I.: Multivariable Feedback Control: Analysis and Design, vol. 2. Wiley, New York (2007)zbMATHGoogle Scholar
  10. 10.
    Smith, O.J.M.: Feedback Control Systems. McGraw-Hill, New York (1958)Google Scholar
  11. 11.
    Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Verwer, B.J.H., Verbeek, P.W., Dekker, S.T.: An efficient uniform cost algorithm applied to distance transforms. IEEE Trans. Pattern Anal. Mach. Intell. 4, 425–429 (1989)CrossRefGoogle Scholar
  13. 13.
    Yao, J., Lin, C., Xie, X., Wang, A.J., Hung, C.C.: Path planning for virtual human motion using improved a* star algorithm. In: 2010 Seventh International Conference on Information Technology: New Generations (ITNG), pp. 1154–1158. IEEE (2010)Google Scholar
  14. 14.
    Zhou, R., Hansen, E.A.: Breadth-first heuristic search. Artif. Intell. 170(4), 385–408 (2006)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Ashwin Vasudevan
    • 1
  • Ajith Kumar
    • 1
  • Nrithya Theetharapan
    • 1
    Email author
  • N. S. Bhuvaneswari
    • 2
  1. 1.Anna UniversityChennaiIndia
  2. 2.GKM College of Engineering and TechnologyChennaiIndia

Personalised recommendations