{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:52:44Z","timestamp":1774993964123,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100007053","name":"Korea Institute of Energy Technology Evaluation and Planning","doi-asserted-by":"publisher","award":["RS-2022-KP002860"],"award-info":[{"award-number":["RS-2022-KP002860"]}],"id":[{"id":"10.13039\/501100007053","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003052","name":"Ministry of Trade, Industry and Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003052","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["IITP-2025-RS-2021-II211835"],"award-info":[{"award-number":["IITP-2025-RS-2021-II211835"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers and Electrical Engineering"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.compeleceng.2025.110820","type":"journal-article","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T06:40:10Z","timestamp":1763361610000},"page":"110820","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"PB","title":["Rolling-horizon genetic algorithm for adaptive path planning in hazardous environments"],"prefix":"10.1016","volume":"129","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2554-2749","authenticated-orcid":false,"given":"Sangmin","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3753-364X","authenticated-orcid":false,"given":"Hyeontae","family":"Joo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5307-528X","authenticated-orcid":false,"given":"Kiseok","family":"Kim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4322-8518","authenticated-orcid":false,"given":"Hwangnam","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.compeleceng.2025.110820_b1","series-title":"Computational approaches to archaeological spaces","first-page":"179","article-title":"The potential and limits of optimal path analysis","author":"Herzog","year":"2016"},{"issue":"12","key":"10.1016\/j.compeleceng.2025.110820_b2","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","article-title":"A survey on coverage path planning for robotics","volume":"61","author":"Galceran","year":"2013","journal-title":"Robot Auton Syst"},{"issue":"13","key":"10.1016\/j.compeleceng.2025.110820_b3","doi-asserted-by":"crossref","first-page":"14794","DOI":"10.1007\/s11227-022-04478-4","article-title":"Enhancing gas detection-based swarming through deep reinforcement learning","volume":"78","author":"Lee","year":"2022","journal-title":"J Supercomput"},{"key":"10.1016\/j.compeleceng.2025.110820_b4","doi-asserted-by":"crossref","unstructured":"Dijkstra EW. A note on two problems in connexion with graphs. In: Edsger wybe dijkstra: his life, work, and legacy. 2022, p. 287\u201390.","DOI":"10.1145\/3544585.3544600"},{"key":"10.1016\/j.compeleceng.2025.110820_b5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.procs.2021.01.034","article-title":"A systematic literature review of A* pathfinding","volume":"179","author":"Foead","year":"2021","journal-title":"Procedia Comput Sci"},{"key":"10.1016\/j.compeleceng.2025.110820_b6","doi-asserted-by":"crossref","first-page":"119310","DOI":"10.1109\/ACCESS.2021.3108177","article-title":"A comprehensive review of coverage path planning in robotics using classical and heuristic algorithms","volume":"9","author":"Tan","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.compeleceng.2025.110820_b7","series-title":"Evolutionary algorithms and neural networks: theory and applications","first-page":"43","article-title":"Genetic algorithm","author":"Mirjalili","year":"2018"},{"key":"10.1016\/j.compeleceng.2025.110820_b8","series-title":"2016 IEEE 11th conference on industrial electronics and applications","first-page":"2478","article-title":"Advantages and limitations of genetic algorithms for clustering records","author":"Beg","year":"2016"},{"key":"10.1016\/j.compeleceng.2025.110820_b9","series-title":"Evolutionary algorithms and neural networks: Theory and applications","first-page":"43","article-title":"Genetic algorithm","author":"Mirjalili","year":"2019"},{"key":"10.1016\/j.compeleceng.2025.110820_b10","doi-asserted-by":"crossref","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","article-title":"A review on genetic algorithm: past, present, and future","volume":"80","author":"Katoch","year":"2021","journal-title":"Multimedia Tools Appl"},{"key":"10.1016\/j.compeleceng.2025.110820_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2021.107419","article-title":"Hybrid ant genetic algorithm for efficient task scheduling in cloud data centers","volume":"95","author":"Ajmal","year":"2021","journal-title":"Comput Electr Eng"},{"key":"10.1016\/j.compeleceng.2025.110820_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2021.107640","article-title":"Towards the realization of regular clocking-based QCA circuits using genetic algorithm","volume":"97","author":"Pramanik","year":"2022","journal-title":"Comput Electr Eng"},{"key":"10.1016\/j.compeleceng.2025.110820_b13","series-title":"2019 international conference on machine learning, big data, cloud and parallel computing","first-page":"380","article-title":"Genetic algorithm-a literature review","author":"Lambora","year":"2019"},{"issue":"5","key":"10.1016\/j.compeleceng.2025.110820_b14","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1109\/TRO.2016.2593448","article-title":"Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics","volume":"32","author":"Yu","year":"2016","journal-title":"IEEE Trans Robot"},{"issue":"3","key":"10.1016\/j.compeleceng.2025.110820_b15","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1016\/j.asoc.2011.11.011","article-title":"Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment","volume":"12","author":"Deng","year":"2012","journal-title":"Appl Soft Comput"},{"key":"10.1016\/j.compeleceng.2025.110820_b16","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.procs.2018.01.113","article-title":"Genetic algorithm based approach for autonomous mobile robot path planning","volume":"127","author":"Lamini","year":"2018","journal-title":"Procedia Comput Sci"},{"issue":"7","key":"10.1016\/j.compeleceng.2025.110820_b17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3390\/chemosensors12070131","article-title":"Unveiling hidden insights in gas chromatography data analysis with generative adversarial networks","volume":"12","author":"Yoon","year":"2024","journal-title":"Chemosensors"},{"key":"10.1016\/j.compeleceng.2025.110820_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.110146","article-title":"Fick\u2019s law algorithm: A physical law-based algorithm for numerical optimization","volume":"260","author":"Hashim","year":"2023","journal-title":"Knowl-Based Syst"},{"key":"10.1016\/j.compeleceng.2025.110820_b19","series-title":"Thermodynamics, diffusion and the kirkendall effect in solids","first-page":"115","article-title":"Fick\u2019s laws of diffusion","author":"Paul","year":"2014"},{"issue":"10","key":"10.1016\/j.compeleceng.2025.110820_b20","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1177\/02783649231183458","article-title":"Convex risk-bounded continuous-time trajectory planning and tube design in uncertain nonconvex environments","volume":"42","author":"Jasour","year":"2023","journal-title":"Int J Robot Res"},{"key":"10.1016\/j.compeleceng.2025.110820_b21","article-title":"Learning-based risk-bounded path planning under environmental uncertainty","author":"Meng","year":"2023","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"1","key":"10.1016\/j.compeleceng.2025.110820_b22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Quart Appl Math"},{"key":"10.1016\/j.compeleceng.2025.110820_b23","unstructured":"Koenig S, Likhachev M. D* lite. In: Eighteenth national conference on artificial intelligence. 2002, p. 476\u201383."},{"issue":"1\u20132","key":"10.1016\/j.compeleceng.2025.110820_b24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","article-title":"Lifelong planning A*","volume":"155","author":"Koenig","year":"2004","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.compeleceng.2025.110820_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120254","article-title":"Path planning techniques for mobile robots: Review and prospect","volume":"227","author":"Liu","year":"2023","journal-title":"Expert Syst Appl"},{"key":"10.1016\/j.compeleceng.2025.110820_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.robot.2024.104630","article-title":"Path planning algorithms in the autonomous driving system: A comprehensive review","volume":"174","author":"Reda","year":"2024","journal-title":"Robot Auton Syst"},{"issue":"3","key":"10.1016\/j.compeleceng.2025.110820_b27","doi-asserted-by":"crossref","first-page":"8154","DOI":"10.1109\/LRA.2022.3187270","article-title":"Multi-objective safe-interval path planning with dynamic obstacles","volume":"7","author":"Ren","year":"2022","journal-title":"IEEE Robot Autom Lett"}],"container-title":["Computers and Electrical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790625007633?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790625007633?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T03:18:09Z","timestamp":1766114289000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0045790625007633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":27,"alternative-id":["S0045790625007633"],"URL":"https:\/\/doi.org\/10.1016\/j.compeleceng.2025.110820","relation":{},"ISSN":["0045-7906"],"issn-type":[{"value":"0045-7906","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Rolling-horizon genetic algorithm for adaptive path planning in hazardous environments","name":"articletitle","label":"Article Title"},{"value":"Computers and Electrical Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.compeleceng.2025.110820","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"110820"}}