Advertisement

Robot Path Planning Using Memory

  • Gadhamsetty Ravi Theja
  • Srinath R. NaiduEmail author
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 65)

Abstract

Proposed work implements the robot path planning using memory. Nowadays, robots are mostly used in agriculture, industrial, and military purposes where the robots are moving autonomously. So, the robot requires planning a path for moving from one spot to other location, which is called as path planning for a robot. Robots are moving in different kinds of environment, mainly obstacle and obstacle-free environment. In obstacle-free environment, path planning must ensure the most direct path between start and end locations. In an environment surrounding with obstacles, path planning must ensure a collision-free shortest path between start and end locations by avoiding obstacles. Most recent works use the A-Star algorithm to catch the most direct route between start and end locations. In the proposed work, once the robot arrives at the end location then the path is stored in memory. The idea behind this is that when the robot reaches the same location in future, there is no requirement to forecast the path again and it can be retrieved from memory which will save the computational time and power requirements of the robot.

Keywords

A-Star algorithm Shortest path Memory Retrieval 

References

  1. 1.
    Liu YQ, Huang QL, Zhang YX, Luan GF, Xu MH (2007) An improved Dijkstra’s shortest path algorithm for sparse network. Appl Math Comput 185(1):247–254Google Scholar
  2. 2.
    Fan DK, Shi P (2010) Improvement of Dijkstra’s algorithm and its application in route planning. In: Proceeding of 7th international conference on fuzzy systems and knowledge discovery (FSKD), Yantai, Shandong, 2010, pp 1901–1904Google Scholar
  3. 3.
    Jeddisaravi K, Alitappeh RJ, Guimari’ies FG (2016) Multi-objective mobile robot path planning based on A* search. In: 6th International conference on computer and knowledge engineering (ICCKE 2016), 20–21 October 2016, Ferdowsi University of MashhadGoogle Scholar
  4. 4.
    Duchon F, Babineca A, Kajana M, Beoa P, Floreka M, Ficoa T, Jurišicaa L (2014) Path planning with modified A star algorithm for a mobile robot. In: Modelling of mechanical and mechatronic systems MMaMS, 2014Google Scholar
  5. 5.
    Vargas GA, Rubiano OG, Castillo RA, Avilés OF, Mauledoux MF (2016) Simulation of e-puck path planning in Webots. Int J Appl Eng Res 11:9772–9775. ISSN 0973-4562Google Scholar
  6. 6.
    Li C, Li Y, Zhou F, Fan C (2007) Multi-objective path planning for the mobile robot. In: Proceedings of the IEEE international conference on automation and logistics, 18–21 August 2007, Jinan, ChinaGoogle Scholar
  7. 7.
    Radhakrishnan G, Gupta D, Sindhuula S, Khokhawat S, Sudarshan TSB (2015) Experimentation and analysis of time series data from multi-path robotic environment. In: 2015 IEEE International conference on electronics, computing and communication technologies (CONECCT), 2015, pp 1–6Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringAmrita School of EngineeringBengaluruIndia
  2. 2.Amrita Vishwa VidyapeethamCoimbatoreIndia

Personalised recommendations