Skip to main content

Robot Path Planning by LSTM Network Under Changing Environment

  • Conference paper
  • First Online:
Advances in Computer Communication and Computational Sciences

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 759))

Abstract

Path planning is an important function for executing autonomous moving robots, and many path planning methods that satisfy various constraints, such as avoiding obstacles and energy efficiency, have been proposed. However, these conventional methods have several difficulties for apply to the actual applications, such as the instability, low reproducibility, huge training data set required. Therefore, we propose a novel robot path planning method that combines the rapidly exploring random tree (RRT) and long short-term memory (LSTM) network. In this method, numerous and good paths are generated in the robot configuration space by the RRT method, a convolutional autoencoder and LSTM combination network is trained by them. The proposed method overcomes the difficulty of general methods with neural networks, i.e., “the acquisition of a large amount of training data.” Moreover, the difficulty of general random based methods, i.e., “the reproducible path generation” is resolved with high-speed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kavraki, L.E., Svestka, P., Latombe, J.-C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566–580 (1996)

    Article  Google Scholar 

  2. LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: progress and prospects. Algorithmic and Computational Robotics: New Directions, pp. 293–308. Wellesley (2001)

    Google Scholar 

  3. Choset, H., Lynch, K., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)

    Google Scholar 

  4. Yang, S.X., Meng, M.: An efficient neural network approach to dynamic robot motion planning. Neural Netw. 13(2), 143–148 (2000)

    Google Scholar 

  5. Gu, S., et al.: Deep reinforcement learning for robotic manipulation with asynchronous off-policy updates (2016). arXiv:1610.00633

  6. Masci, J., Meier, U., Cireşan, D., Schmidhuber, J.: Stacked convolutional auto-encoders for hierarchical feature extraction. In: Proceedings of Artificial Neural Networks and Machine Learning ICANN 2011, pp. 52–59 (2011)

    Google Scholar 

  7. Ilya, S.: Training recurrent neural networks, University of Toronto (2013)

    Google Scholar 

  8. Bin, N., Xiong, C., Liming, Z., Wendong, X.: Recurrent neural network for robot path planning. Parallel and Distributed Computing: Applications and Technologies, pp. 188–191. Springer Berlin Heidelberg (2004)

    Google Scholar 

  9. Zeiler, M.D., Krishnan, D., Taylor, G.W., Fergus, R.: Deconvolutional networks. In: 2010 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2528–2535 (2010)

    Google Scholar 

  10. Gers, F.A., Schmidhuber, J., Cummins, F.: Learning to forget: continual prediction with LSTM. Neural Comput. 12(10), 2451–2471 (2000)

    Google Scholar 

  11. Sucan, I.A., Moll, M., Kavraki, L.E.: The open motion planning library. IEEE Robot. Autom. Mag. 19(4), 72–82 (2012)

    Google Scholar 

  12. Diederik, D., Ba, J.: Adam: a method for stochastic optimization (2014). arXiv:1412.6980

  13. Harada, K.: Optimization in robot motion planning. JRSJ 32(6), 508–511 (2014)

    Google Scholar 

  14. Harada, K., Hattori, S., Hirukawa, H., Morisawa, M., Kajita, S., Yoshida, E.: Two-stage time-parametrized gait planning for humanoid robots. IEEE/ASME Trans. Mech. 15(5), 694–703 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Masaya Inoue .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Inoue, M., Yamashita, T., Nishida, T. (2019). Robot Path Planning by LSTM Network Under Changing Environment. In: Bhatia, S., Tiwari, S., Mishra, K., Trivedi, M. (eds) Advances in Computer Communication and Computational Sciences. Advances in Intelligent Systems and Computing, vol 759. Springer, Singapore. https://doi.org/10.1007/978-981-13-0341-8_29

Download citation

Publish with us

Policies and ethics