AI Chat Paper
Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
{{expandStatus?'Exit ':''}}Advanced Search
With the continuous innovation in household appliance technology and the improvement of living standards, the production of discarded household appliances has rapidly increased, making their recycling increasingly significant. Traditional path planning algorithms encounter difficulties in balancing efficiency and constraints in addressing the multi-objective, multi-constraint challenge posed by discarded household appliance recycling routes. To tackle this issue, this study introduces a bi-directional Q-learning-based path planning algorithm. By developing a bi-directional Q-learning mechanism and enhancing the initialization method of Q-learning, the algorithm aims to achieve efficient and effective optimization of discarded household appliance recycling routes. It implements bidirectional updates of the state-action value function from both the starting point and the target point. Additionally, a hierarchical reinforcement learning strategy and guided rewards are introduced to minimize blind exploration and expedite convergence. By decomposing complex recycling tasks into multiple sub-tasks and seeking paths with superior performance at each sub-task level, the initial exploratory blindness is reduced. To validate the efficacy of the proposed algorithm, gridbased modeling of real-world environments is utilized. Comparative experiments reveal significant improvements in iteration counts and path lengths, thereby validating its practical applicability in path planning for recycling initiatives.
Baxter, J., Lyng, K.A., Askham, C., Hanssen, O.J., 2016. High-quality collection and disposal of WEEE: environmental impacts and resultant issues. Waste Manag. 57, 17–26.
Cao, J.X., Liu, Q.C., 2022. Research on path planning algorithms based on deep reinforcement learning. Comput. Appl. 39, 231–237.
Demir, E., Bektaş, T., Laporte, G., 2014. The bi-objective pollution-routing problem. Eur. J. Oper. Res. 232, 464–478.
Džeroski, S., De Raedt, L., Driessens, K., 2001. Relational reinforcement learning. Mach. Learn. 43, 7–52.
El-Hussieny, H., Hameed, I., 2024. Obstacle-aware navigation of soft growing robots via deep reinforcement learning. IEEE Access 12, 38192–38201.
Gao, L., Ma, T., Liu, K., Zhang, Y., 2018. Application of improved Q-learning algorithm in path planning. J. Jilin. Univ. 36, 439–443.
Ge, Y., Zhu, F., Ling, X., Liu, Q., 2019. Safe Q-learning method based on constrained markov decision processes. IEEE Access 7, 165007–165017.
Hart, P.E., Nilsson, N.J., Raphael, B., 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4, 100–107.
He, J., Fan, H., Yin, J., 2014. Research on the design of waste electrical appliance recycling network in guangdong province. Sci. Technol. Manag. Res. 34, 235–238.
Jiang, J., Xin, J., 2019. Path planning of a mobile robot in a free-space environment using Q-learning. Prog. Artif. Intell. 8, 133–142.
Jin, W., Gu, R., Ji, Y., 2019. Reward function learning for Q-learning-based geographic routing protocol. IEEE Commun. Lett. 23, 1236–1239.
Kang, Y., Yin, H., Berger, C., 2019. Test your self-driving algorithm: an overview of publicly available driving datasets and virtual testing environments. IEEE Trans. Intell. Veh. 4, 171–185.
Li, Z.Y., Hu, X.T., Zhang, Y.L., Xu, J.J., 2024. Adaptive Q-learning path planning algorithm based on virtual target guidance. Comput. Integr. Manuf. Syst. 30, 553.
Liu, Y., Ye, Q., Escribano-Macias, J., Feng, Y., Candela, E., Angeloudis, P., 2023. Route planning for last-mile deliveries using mobile parcel lockers: a hybrid Q-learning network approach. Transport. Res. E Logist. Transport. Rev. 177, 103234.
Saeed, R.A., Ali, E.S., Abdelhaq, M., Alsaqour, R., Ahmed, F.R.A., Saad, A.M.E., 2023. Energy efficient path planning scheme for unmanned aerial vehicle using hybrid generic algorithm based Q-learning optimization. IEEE Access 12, 113400–113417.
Si, Y., Pu, J., Lifan, S., 2022. Review of research on approximate reinforcement learning algorithms. J. Comput. Eng. Appl. 58, 30.
Song, L., Li, D.Z., 2023. Local path planning via improved fuzzy and Q(λ)-learning algorithms for the mobile robot. J. Comput. 34, 265–284.
Sun, P.F., Li, J.Y., Li, M.Y., Gao, Z.Y., Jin, H., Jeon, S.W., et al., 2024. Tour multi-route planning with matrix-based differential evolution. IEEE Trans. Intell. Transport. Syst. 25, 11753–11767.
Wang, J., Zhu, K., Dai, P., Han, Z., 2023. An adaptive Q-value adjustment-based learning model for reliable vehicle-to-UAV computation offloading. IEEE Trans. Intell. Transport. Syst. 25, 3699–3713.
Yang, K., Liu, L., 2024. An improved deep reinforcement learning algorithm for path planning in unmanned driving. IEEE Access 12, 67935–67944.
Yin, Y., Wang, X., Zhou, J., 2023. Q-learning-based multi-UAV cooperative path planning method. Acta Armamentarii 44, 484.
Yuan, Y., Yu, Z.L., Gu, Z., Yeboah, Y., Wei, W., Deng, X., Li, J., et al., 2019. A novel multistep Q-learning method to improve data efficiency for deep reinforcement learning. Knowl. Base Syst. 175, 107–117.
Zhou, Q., Lian, Y., Wu, J., Zhu, M., Wang, H., Cao, J., 2024. An optimized Q-learning algorithm for mobile robot local path planning. Knowl. Base Syst. 286, 111400.
This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
京公网安备11010802044758号