End-to-end deep reinforcement learning enables bionic fish to learn efficient obstacle avoidance in unknown underwater environments
Source abstract
Abstract
Path planning is a core issue in fields such as robotics, autonomous driving, and unmanned navigation systems. Nevertheless, traditional path planning methods face substantial challenges in dynamic, nonlinear, and stochastic underwater environments. In this study, a fluid solver module capable of simulating fluid–structure interaction with high precision and efficiency was constructed based on the immersed boundary–lattice Boltzmann method. The perception and decision-making system of the bionic intelligent fish was constructed using deep reinforcement learning (DRL) algorithms, and a concise visual perception modality representation based on one-hot encoding was proposed. The obstacle avoidance performance of the bionic intelligent fish trained via end-to-end DRL was tested in both still-water environments and dynamic flow environments with complex geometries. The results demonstrate that the intelligent fish exhibits efficient local path planning and obstacle avoidance capabilities in both environments while possessing a certain robustness against disturbances in nonlinear environments. This research can provide a reference for the design of local path planning modules for bionic robotic fish and is expected to further enhance the mission execution capabilities of autonomous underwater vehicles in unmapped deep and far-sea areas with high uncertainty.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Biomimetic flight and propulsion mechanisms · Micro and Nano Robotics · Zebrafish Biomedical Research Applications
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (34)
Show source-provided references
1. Def. Technol. · 2019 · 15 · 58210.1016/j.dt.2019.04.011 ↗
2. IEEE Access · 2020 · 8 · 14782710.1109/access.2020.3015976 ↗
3. Int. J. Adv. Rob. Syst. · 2021 · 18 · 1729881421101922010.1177/17298814211019220 ↗
4. J. Res. Sci. Eng. · 2022 · 4 · 1010.53469/jrse.2022.04(10).07 ↗
5. Wireless Commun. Mobile Comput. · 2022 · 163269810.1155/2022/1632698 ↗
6. J. Mar. Sci. Appl. · 2022 · 21 · 10210.1007/s11804-022-00258-x ↗
7. Inf. Sci. · 2008 · 178 · 327510.1016/j.ins.2008.04.005 ↗
8. 2017 · 1
9. J. Mar. Sci. Eng. · 2022 · 10 · 125310.3390/jmse10091253 ↗
10. Neural Networks · 2000 · 13 · 14310.1016/s0893-6080(99)00103-3 ↗
11. Mech. Mach. Theory · 2005 · 40 · 64510.1016/j.mechmachtheory.2005.01.006 ↗
12. IEEE Trans. Veh. Technol. · 2016 · 66 · 95210.1109/tvt.2016.2555853 ↗
13. Sensors · 2021 · 21 · 831210.3390/s21248312 ↗
14. Math. Probl. Eng. · 2022 · 569235010.1155/2022/5692350 ↗
15. IEEE Access · 2022 · 10 · 1701810.1109/access.2022.3150036 ↗
16. 2023 · 865
17. IEEE Trans. Rob. · 2007 · 23 · 33110.1109/tro.2007.895057 ↗
18. Phys. Fluids · 2025 · 37 · 03191010.1063/5.0259251 ↗
19. Bioinspiration Biomimetics · 2024 · 19 · 05601410.1088/1748-3190/ad6544 ↗
20. Bioinspiration Biomimetics · 2025 · 20 · 02600110.1088/1748-3190/ada59c ↗
21. IEEE Trans. Neural Networks Learn. Syst. · 2023 · 36 · 84210.1109/tnnls.2023.3332172 ↗
22. IEEE Trans. Intell. Veh. · 2022 · 8 · 10810.1109/tiv.2022.3153352 ↗
23. Acta Numer. · 2002 · 11 · 47910.1017/s0962492902000077 ↗
24. J. Comput. Phys. · 2011 · 230 · 726610.1016/j.jcp.2011.05.028 ↗
25. Comput. Math. Appl. · 2020 · 79 · 15910.1016/j.camwa.2017.09.002 ↗
26. J. Mol. Liq. · 2019 · 296 · 11196910.1016/j.molliq.2019.111969 ↗
27. Appl. Sci. · 2023 · 13 · 999510.3390/app13189995 ↗
28. IEEE Trans. Rob. · 2008 · 24 · 20110.1109/tro.2007.914850 ↗
29. Bioinspiration Biomimetics · 2021 · 16 · 05601310.1088/1748-3190/ac165e ↗
30. Phys. Fluids · 2024 · 36 · 12190110.1063/5.0244010 ↗
31. Phys. Fluids · 2024 · 36 · 01190410.1063/5.0184690 ↗
32. Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor
33. Comput. Electr. Eng. · 2015 · 43 · 31710.1016/j.compeleceng.2014.12.014 ↗
34. J. Wireless Commun. Network · 2019 · 7010.1186/s13638-019-1396-2 ↗