{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T14:05:33Z","timestamp":1781273133852,"version":"3.54.1"},"reference-count":22,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T00:00:00Z","timestamp":1673395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>With the development and proliferation of unmanned weapons systems, path planning is becoming increasingly important. Existing path-planning algorithms mainly assume a well-known environment, and thus pre-planning is desirable, but the actual ground battlefield is uncertain, and numerous contingencies occur. In this study, we present a novel, efficient path-planning algorithm based on a potential field that quickly changes the path in a constantly changing environment. The potential field is composed of a set of functions representing enemy threats and a penalty term representing distance to the target area. We also introduce a new threat function using a multivariate skew-normal distribution that accurately expresses the enemy threat in ground combat.<\/jats:p>","DOI":"10.3390\/computation11010012","type":"journal-article","created":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T04:45:58Z","timestamp":1673412358000},"page":"12","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Path Planning Algorithm Using a Potential Field for Ground Forces"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2767-5740","authenticated-orcid":false,"given":"Nakyeong","family":"Sung","sequence":"first","affiliation":[{"name":"Department of Operations Research, Korea National Defence University (KNDU), Nonsan 33021, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suhwan","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Operations Research, Korea National Defence University (KNDU), Nonsan 33021, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2754-3120","authenticated-orcid":false,"given":"Namsuk","family":"Cho","sequence":"additional","affiliation":[{"name":"Department of Operations Research, Korea National Defence University (KNDU), Nonsan 33021, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.procs.2018.07.056","article-title":"Development of collision free path planning algorithm for warehouse mobile robot","volume":"133","author":"Kumar","year":"2008","journal-title":"Procedia Comput. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.ymssp.2017.07.019","article-title":"Dynamic path planning for autonomous driving on various roads with avoidance of static and moving obstacles","volume":"100","author":"Hu","year":"2018","journal-title":"Mech. Syst. Signal Process."},{"key":"ref_3","unstructured":"\u0160i\u0161l\u00e1k, D., Volf, P., and Pechoucek, M. (2009, January 19\u201323). Accelerated A* trajectory planning: Grid-based path planning comparison. Proceedings of the 19th International Conference on Automated Planning & Scheduling (ICAPS), Thessaloniki, Greece."},{"key":"ref_4","first-page":"575","article-title":"Artificial potential field algorithm implementation for quadrotor path planning","volume":"10","author":"Iswanto","year":"2019","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"ref_5","unstructured":"Bruvoll, S. (2014). Situation Dependent Path Planning for Computer Generated Forces, Norwegian Defence Research Establishment (FFI)."},{"key":"ref_6","unstructured":"Oroko, J.A., and Nyakoe, G.N. (2022, January 12). Obstacle avoidance and path planning schemes for autonomous navigation of a mobile robot: A review. Proceedings of the Sustainable Research and Innovation Conference, Nairobi, Kenya."},{"key":"ref_7","unstructured":"Krishnaswamy, G., and Stentz, A. (1995). Resolution Independent Grid-Based Path Planning, Carnegie-Mellon Univ Pittsburgh Pa Robotics Inst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"448","DOI":"10.3390\/vehicles3030027","article-title":"A survey of path planning algorithms for mobile robots","volume":"3","author":"Karur","year":"2021","journal-title":"Vehicles"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Stentz, A. (1997). Optimal and efficient path planning for partially known environments. Intelligent Unmanned Ground Vehicles, Springer.","DOI":"10.1007\/978-1-4615-6325-9_11"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Ajeil, F.H., Ibraheem, I.K., Azar, A.T., and Humaidi, A.J. (2020). Grid-based mobile robot path planning using aging-based ant colony optimization algorithm in static and dynamic environments. Sensors, 20.","DOI":"10.3390\/s20071880"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Gammell, J.D., Srinivasa, S.S., and Barfoot, T.D. (2014, January 14\u201318). Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. Proceedings of the 2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems, Chicago, IL, USA.","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"LaValle, S.M. (2006). Planning Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511546877"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1109\/TASE.2015.2487881","article-title":"Optimal path planning in complex cost spaces with sampling-based algorithms","volume":"13","author":"Devaurs","year":"2015","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_14","unstructured":"Khatib, O. (1985, January 25\u201328). Real-time obstacle avoidance for manipulators and mobile robots. Proceedings of the 1985 IEEE International Conference on Robotics and Automation, St. Louis, MO, USA."},{"key":"ref_15","first-page":"C5","article-title":"Penalty functions","volume":"Volume 97","author":"Smith","year":"1997","journal-title":"Handbook of Evolutionary Computation"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/70.143352","article-title":"Real-Time Obstacle Avoidance Using Harmonic Potential Functions","volume":"8","author":"Kim","year":"1992","journal-title":"IEEE Trans. Robot. Autom."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/70.127236","article-title":"A potential field approach to path planning","volume":"8","author":"Hwang","year":"1992","journal-title":"IEEE Trans. Robot. Autom."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1109\/TITS.2016.2604240","article-title":"A potential field-based model predictive path-planning controller for autonomous road vehicles","volume":"18","author":"Rasekhipour","year":"2016","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1093\/biomet\/83.4.715","article-title":"The multivariate skew-normal distribution","volume":"83","author":"Azzalini","year":"1996","journal-title":"Biometrika"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Wright, S., and Nocedal, J. (1999). Numerical Optimization, Springer.","DOI":"10.1007\/b98874"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Bowyer, R. (2018). Dictionary of Military Terms, Routledge.","DOI":"10.4324\/9781315062648"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1109\/TAC.1986.1104175","article-title":"Dynamic path planning for a mobile automaton with limited information on the environment","volume":"31","author":"Lumelsky","year":"1986","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/11\/1\/12\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:06:54Z","timestamp":1760119614000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/11\/1\/12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,11]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["computation11010012"],"URL":"https:\/\/doi.org\/10.3390\/computation11010012","relation":{},"ISSN":["2079-3197"],"issn-type":[{"value":"2079-3197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,11]]}}}