PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 1, 2025IEEE Internet of Things Journal5 citations

Multiobjective Optimization of Path Planning and Communication Capacity Based on DQN With Weighted Prioritized Experience Replay

View Full Paper
YLYuzhou LuYZYi Zuo

Key Points

Key points are not available for this paper at this time.

Abstract

Autonomous underwater vehicles (AUV) are popular robots that can independently operate complex tasks in underwater environment. Since AUV not only has highly moving characteristics, but also provides efficiently communicating supports, it is necessary to consider the energy balance of path planning for collision avoidance and communication capacity for all agents, so as to achieve largest endurance during tasks processing. Therefore, this paper focuses on the multi-objective optimization problem (MOP) in AUV case, and includes a new policy of weighted prioritized experience repay (WPER) to improve deep Q-learning network (DQN), which can obtain optimal costs balance between path planning and communication capacity. The proposed WPER policy enhances the experience pool of DQN, so that the AUV can distinguish the importance of empirical samples, improve the sampling efficiency and the training accuracy. In simulation experiment, we construct a three-dimensional underwater environment containing AUV, obstacles and serviced agents, and examine several comparison methods such as Q-learning and its variants to validate the performance of proposed DQN using WPER. Furthermore, we also design scenarios of simulating situation to investigate the capability of proposed method, and the results reveal that our method can effectively obtain MOP solution of shorter path length and larger communication capacity without collision.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Lu et al. (2025) studied this question.

synapsesocial.com/papers/6a6e7bdb660549caf2c360c4https://doi.org/10.1109/jiot.2025.3616362
Ask AI
Helpful
Bookmark
Share
View Full Paper