{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T10:53:59Z","timestamp":1766400839982,"version":"3.37.3"},"reference-count":39,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:00:00Z","timestamp":1699488000000},"content-version":"vor","delay-in-days":6,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005073","name":"ADD","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005073","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003626","name":"DAPA","doi-asserted-by":"publisher","award":["915027201"],"award-info":[{"award-number":["915027201"]}],"id":[{"id":"10.13039\/501100003626","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,11,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>This study focuses on the path planning problem for unmanned combat vehicles (UCVs), where the goal is to find a viable path from the starting point to the destination while avoiding collisions with moving obstacles, such as enemy forces. The objective is to minimize the overall cost, which encompasses factors like travel distance, geographical difficulty, and the risk posed by enemy forces. To address this challenge, we have proposed a heuristic algorithm based on D* Lite. This modified algorithm considers not only travel distance but also other military-relevant costs, such as travel difficulty and risk. It generates a path that navigates around both fixed unknown obstacles and dynamically moving obstacles (enemy forces) that change positions over time. To assess the effectiveness of our proposed algorithm, we conducted comprehensive experiments, comparing and analyzing its performance in terms of average pathfinding success rate, average number of turns, and average execution time. Notably, we examined how the algorithm performs under two UCV path search strategies and two obstacle movement strategies. Our findings shed light on the potential of our approach in real-world UCV path planning scenarios.<\/jats:p>","DOI":"10.1093\/jcde\/qwad099","type":"journal-article","created":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T08:49:05Z","timestamp":1699692545000},"page":"2251-2270","source":"Crossref","is-referenced-by-count":4,"title":["A study on unmanned combat vehicle path planning for collision avoidance with enemy forces in dynamic situations"],"prefix":"10.1093","volume":"10","author":[{"given":"Jisoo","family":"Ahn","sequence":"first","affiliation":[{"name":"Department of Industrial and Data Engineering, Hongik University , Seoul 04066 , Republic of Korea"}]},{"given":"Sewoong","family":"Jung","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Hongik University , Seoul 04066 , Republic of Korea"}]},{"given":"Hansom","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Industrial and Data Engineering, Hongik University , Seoul 04066 , Republic of Korea"}]},{"given":"Ho-Jin","family":"Hwang","sequence":"additional","affiliation":[{"name":"Department of Software Engineering, Joongbu University , Goyang 10279 , Republic of Korea"}]},{"given":"Hong-Bae","family":"Jun","sequence":"additional","affiliation":[{"name":"Department of Industrial and Data Engineering, Hongik University , Seoul 04066 , Republic of Korea"}]}],"member":"286","published-online":{"date-parts":[[2023,11,9]]},"reference":[{"key":"2023112719062124900_bib1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.procs.2020.10.011","article-title":"Path planning algorithm for unmanned ground vehicles (UGVs) in known static environments","volume":"177","author":"Almoaili","year":"2020","journal-title":"Procedia Computer Science"},{"key":"2023112719062124900_bib2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.cie.2014.12.016","article-title":"Finding a risk-constrained shortest path for an unmanned combat vehicle","volume":"80","author":"Bae","year":"2015","journal-title":"Computers and Industrial Engineering"},{"key":"2023112719062124900_bib3","doi-asserted-by":"crossref","first-page":"3420","DOI":"10.1016\/j.cor.2012.05.002","article-title":"A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment","volume":"39","author":"Berger","year":"2012","journal-title":"Computers and Operations Research"},{"key":"2023112719062124900_bib4","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1093\/jcde\/qwac125","article-title":"Real-time unmanned aerial vehicle flight path prediction using a bi-directional long short-term memory network with error compensation","volume":"10","author":"Chen","year":"2022","journal-title":"Journal of Computational Design and Engineering"},{"key":"2023112719062124900_bib5","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1093\/jcde\/qwad055","article-title":"Voyage optimization using dynamic programming with initial quadtree based route","volume":"10","author":"Choi","year":"2023","journal-title":"Journal of Computational Design and Engineering"},{"key":"2023112719062124900_bib6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"issue":"2","key":"2023112719062124900_bib7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/rob.20109","article-title":"Using interpolation to improve path planning: The field D* algorithm","volume":"23","author":"Ferguson","year":"2006","journal-title":"Journal of Field Robotics"},{"issue":"1","key":"2023112719062124900_bib8","first-page":"17","article-title":"Minimum-cost path finding algorithm in real-time for computer generated force","volume":"48","author":"Han","year":"2011","journal-title":"Journal of the Institute of Electronics Engineers of Korea"},{"key":"2023112719062124900_bib9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.cie.2014.02.013","article-title":"Multiple-criterion shortest path algorithms for global path planning of unmanned combat vehicles","volume":"71","author":"Han","year":"2014","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"2023112719062124900_bib10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Transaction on Systems Science and Cybernetics"},{"issue":"1","key":"2023112719062124900_bib11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1056777.1056779","article-title":"Correction to \u201ca formal basis for the heuristic determination of minimum cost paths\u201d","volume":"37","author":"Hart","year":"1972","journal-title":"SIGART Bulletin"},{"key":"2023112719062124900_bib12","doi-asserted-by":"crossref","first-page":"1820","DOI":"10.1109\/ACCESS.2017.2656999","article-title":"A green ant-based method for path planning of unmanned ground vehicles","volume":"5","author":"Jabbarpour","year":"2017","journal-title":"IEEE Access"},{"key":"2023112719062124900_bib13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/SYSOSE.2008.4724200","article-title":"An evolutionary path planning algorithm for military applications","volume-title":"Proceedings of the 2008 IEEE 3rd International Conference on System of Systems Engineering (SoSE 2008)","author":"Jha","year":"2008"},{"key":"2023112719062124900_bib14","doi-asserted-by":"crossref","first-page":"108473","DOI":"10.1016\/j.compeleceng.2022.108473","article-title":"Conflict-based search with D* Lite algorithm for robot path planning in unknown dynamic environments","volume":"105","author":"Jin","year":"2023","journal-title":"Computers and Electrical Engineering"},{"key":"2023112719062124900_bib15","first-page":"476","article-title":"D* Lite","volume-title":"Proceedings of the 8th National Conference on Artificial Intelligence","author":"Koenig","year":"2002"},{"key":"2023112719062124900_bib16","first-page":"1539","article-title":"Incremental A*","volume":"14","author":"Koenig","year":"2002","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"3","key":"2023112719062124900_bib17","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TRO.2004.838026","article-title":"Fast replanning of navigation in unknown terrain","volume":"21","author":"Koenig","year":"2005","journal-title":"IEEE Transactions on Robotics"},{"issue":"2","key":"2023112719062124900_bib18","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1093\/jcde\/qwad020","article-title":"Hierarchical reinforcement learning from competitive self-play for dual-aircraft formation air combat","volume":"10","author":"Kong","year":"2023","journal-title":"Journal of Computational Design and Engineering"},{"issue":"2","key":"2023112719062124900_bib19","first-page":"180","article-title":"Mission oriented global path generation for unmanned combat vehicle based on the mission type and multiple grid maps","volume":"13","author":"Lee","year":"2010","journal-title":"Journal of the Korean Society of Military Science and Technology"},{"key":"2023112719062124900_bib20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/ICASTech.2013.6707501","article-title":"A focussed dynamic path finding algorithm with constraints","volume-title":"Proceedings of 2013 International Conference on Adaptive Science and Technology","author":"Leenen","year":"2013"},{"key":"2023112719062124900_bib21","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10489-021-02397-0","article-title":"Prioritized planning algorithm for multi-robot collision avoidance based on artificial untraversable vertex","volume":"52","author":"Li","year":"2022","journal-title":"Applied Intelligence"},{"key":"2023112719062124900_bib25","doi-asserted-by":"crossref","first-page":"116605","DOI":"10.1016\/j.eswa.2022.116605","article-title":"Modified continuous ant colony optimisation for multiple unmanned ground vehicle path planning","volume":"196","author":"Liu","year":"2022","journal-title":"Expert Systems with Applications"},{"key":"2023112719062124900_bib23","first-page":"1","article-title":"UGV path planning based on an improved continuous ant colony optimisation algorithm","volume-title":"Proceedings of the 2021 IEEE Symposium Series on Computational Intelligence (SSCI)","author":"Liu","year":"2021"},{"key":"2023112719062124900_bib22","doi-asserted-by":"crossref","first-page":"110540","DOI":"10.1016\/j.knosys.2023.110540","article-title":"An improved heuristic mechanism ant colony optimization algorithm for solving path planning","volume":"271","author":"Liu","year":"2023","journal-title":"Knowledge-Based Systems"},{"key":"2023112719062124900_bib24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.cogr.2020.12.002","article-title":"Visual information processing for deep-sea visual monitoring system","volume":"1","author":"Ma","year":"2021","journal-title":"Cognitive Robotics"},{"key":"2023112719062124900_bib26","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1007\/s10846-020-01240-x","article-title":"iADA*: Improved anytime path planning and replanning algorithm for autonomous vehicle","volume":"100","author":"Maw","year":"2020","journal-title":"Journal of Intelligent and Robotic Systems"},{"issue":"3","key":"2023112719062124900_bib27","first-page":"505","article-title":"A decision policy for the routing and munitions management of multi formations of unmanned combat vehicles in adversarial urban environments","volume":"17","author":"Mora","year":"2008","journal-title":"IEEE Transactions on Control Systems Technology"},{"key":"2023112719062124900_bib28","doi-asserted-by":"crossref","first-page":"2859","DOI":"10.1145\/1274000.1274032","article-title":"Balancing safety and speed in the military path finding problem: Analysis of different ACO algorithms","volume-title":"Proceedings of the 9th Annual Conference Companion on Genetic and Evolutionary Computation","author":"Mora","year":"2007"},{"key":"2023112719062124900_bib29","article-title":"Military unit path finding problem","volume-title":"Proceedings of the ECIAIR 2021 3rd European Conference on the Impact of Artificial Intelligence and Robotics","author":"Mundell","year":"2021"},{"key":"2023112719062124900_bib30","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.cie.2012.02.007","article-title":"Heuristics for determining a patrol path of an unmanned combat vehicle","volume":"63","author":"Park","year":"2012","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"2023112719062124900_bib31","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/j.jcde.2019.04.004","article-title":"Donkey and smuggler optimization algorithm: A collaborative working approach to path finding","volume":"6","author":"Shamsaldin","year":"2019","journal-title":"Journal of Computational Design and Engineering"},{"key":"2023112719062124900_bib32","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","article-title":"Conflict-based search for optimal multi-agent pathfinding","volume":"219","author":"Sharon","year":"2015","journal-title":"Artificial Intelligence"},{"key":"2023112719062124900_bib33","article-title":"Path planning: A 2013 survey","volume-title":"Proceedings of 2013 International Conference on Industrial Engineering and Systems Management (IESM)","author":"Souissi","year":"2013"},{"article-title":"The D* algorithm for real-time planning of optimal traverses","year":"1994","author":"Stentz","key":"2023112719062124900_bib34"},{"key":"2023112719062124900_bib35","first-page":"1652","article-title":"The focussed D* algorithm for real-time planning","volume-title":"Proceedings of the 14th International Joint Conference on Artificial Intelligence","author":"Stentz","year":"1995"},{"issue":"2","key":"2023112719062124900_bib36","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1109\/LRA.2021.3056028","article-title":"Path planning for UGVs based on traversability hybrid A","volume":"6","author":"Thoresen","year":"2021","journal-title":"IEEE Robotics and Automation Letters"},{"issue":"2","key":"2023112719062124900_bib37","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1093\/jcde\/qwac025","article-title":"Target-biased informed trees: Sampling-based method for optimal motion planning in complex environments","volume":"9","author":"Wang","year":"2022","journal-title":"Journal of Computational Design and Engineering"},{"key":"2023112719062124900_bib38","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/SSST.2005.1460918","article-title":"Path planning and path tracking control of unmanned ground vehicles (UGVs)","volume-title":"Proceedings of the Thirty-Seventh Southeastern Symposium on System Theory, 2005. SSST\u201905","author":"Weng","year":"2005"},{"issue":"6","key":"2023112719062124900_bib39","doi-asserted-by":"crossref","first-page":"2343","DOI":"10.1093\/jcde\/qwac109","article-title":"A novel bio-inspired approach with multi-resolution mapping for the path planning of multi-robot system in complex environments","volume":"9","author":"Yi","year":"2022","journal-title":"Journal of Computational Design and Engineering"}],"container-title":["Journal of Computational Design and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jcde\/advance-article-pdf\/doi\/10.1093\/jcde\/qwad099\/53180593\/qwad099.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/10\/6\/2251\/53818850\/qwad099.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/10\/6\/2251\/53818850\/qwad099.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T23:14:53Z","timestamp":1701126893000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jcde\/article\/10\/6\/2251\/7395013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,3]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11,3]]}},"URL":"https:\/\/doi.org\/10.1093\/jcde\/qwad099","relation":{},"ISSN":["2288-5048"],"issn-type":[{"type":"electronic","value":"2288-5048"}],"subject":[],"published-other":{"date-parts":[[2023,12]]},"published":{"date-parts":[[2023,11,3]]}}}