Efficient three-dimensional boxing optimization method based on deep reinforcement learning
By adopting the priority experience playback mechanism and SAC algorithm in deep reinforcement learning, the network convergence and overfitting problems caused by high discretency and sparse rewards in three-dimensional packing problems are solved, and more efficient learning and performance improvement are achieved.
Patent Information
- Application Number
- CN202411805350.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-09
- Publication Date
- 2025-03-28
AI Technical Summary
In deep reinforcement learning, the three-dimensional packing problem causes the network to converge too slowly due to high discreteness and sparse rewards, low learning efficiency, and prone to overfitting problems.
The priority experience playback mechanism is used in combination with the SAC algorithm, and the random and uniform experience playback is replaced by the compound priority experience playback mechanism, which improves the effectiveness of experience, accelerates the convergence of the network and stabilizes the training process.
It significantly improves the learning ability and performance of online three-dimensional packaging, alleviates the overfitting problem, avoids local optimization, and significantly accelerates the convergence speed of the network.