期刊文献+

A digital twins enabled underwater intelligent internet vehicle path planning system via reinforcement learning and edge computing

下载PDF
导出
摘要 The Autonomous Underwater Glider(AUG)is a kind of prevailing underwater intelligent internet vehicle and occupies a dominant position in industrial applications,in which path planning is an essential problem.Due to the complexity and variability of the ocean,accurate environment modeling and flexible path planning algorithms are pivotal challenges.The traditional models mainly utilize mathematical functions,which are not complete and reliable.Most existing path planning algorithms depend on the environment and lack flexibility.To overcome these challenges,we propose a path planning system for underwater intelligent internet vehicles.It applies digital twins and sensor data to map the real ocean environment to a virtual digital space,which provides a comprehensive and reliable environment for path simulation.We design a value-based reinforcement learning path planning algorithm and explore the optimal network structure parameters.The path simulation is controlled by a closed-loop model integrated into the terminal vehicle through edge computing.The integration of state input enriches the learning of neural networks and helps to improve generalization and flexibility.The task-related reward function promotes the rapid convergence of the training.The experimental results prove that our reinforcement learning based path planning algorithm has great flexibility and can effectively adapt to a variety of different ocean conditions.
出处 《Digital Communications and Networks》 SCIE CSCD 2024年第2期282-291,共10页 数字通信与网络(英文版)
基金 supported by the National Natural Science Foundation of China(No.61871283).
  • 相关文献

参考文献7

二级参考文献26

  • 1赵泽,崔莉.一种基于无线传感器网络的远程医疗监护系统[J].信息与控制,2006,35(2):265-269. 被引量:73
  • 2I. Abraham, D. Delling, A.V. Goidberg, et al., Alternative routes in road net- works, J. Exp. Algorithmics 18 (1) (2013) 1-3.
  • 3D. Luxen, D. Schieferdecker, Candidate Sets for Alternative Routes in Road Networks[M]//Experimental Algorithms, Springer, Berlin, Heidelberg 2012, pp. 260-270.
  • 4Roland Bader, et al., Alternative Route Graphs in Road Networks. Theory and Practice of Algorithms in (Computer) Systems, Springer, Berlin, Heidelberg 2011, pp. 21-32.
  • 5Y. Chen, M.G.H. Bell, K. Bogenberger, Reliable pretrip muttipath planning and dynamic adaptation for a centralized road navigation system, Intell. Transp. Syst. IEEE Trans. 8 (1) (2007) 14-20.
  • 6E.W. Dijkstra, A note on two problems in connexion with Figures, Numer. Math. 1 (1)(1959)269-271.
  • 7A.V. Goldberg, C. Harrelson, Computing the shortest path: a search meets Figure theory, in: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, 2005, pp. 158-165.
  • 8D. Eppstein, Finding the k shortest paths, SIAM J. Comput. 28 (2) (1998) 652-673.
  • 9P. Hansen, Bicriterion Path Problems[M]//Multiple criteria decision making theory and application, Springer, Berlin, Heidelberg 1980, pp. 109-127.
  • 10Camvit: Choice Routing, 2009. (http://www.camvit.com/.

共引文献60

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部