{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:45:23Z","timestamp":1780764323740,"version":"3.54.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Technology Innovation Program","award":["20014121"],"award-info":[{"award-number":["20014121"]}]},{"name":"Ministry of Trade, Industry & Energy","award":["20014121"],"award-info":[{"award-number":["20014121"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3597311","type":"journal-article","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T17:44:23Z","timestamp":1754934263000},"page":"141717-141731","source":"Crossref","is-referenced-by-count":2,"title":["Optimization-Based Path Planning With Artificial Potential Function"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0637-8907","authenticated-orcid":false,"given":"Seongyeon","family":"Kim","sequence":"first","affiliation":[{"name":"Department of Mechanical Engineering, Chungbuk National University, Cheongju, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6039-9564","authenticated-orcid":false,"given":"Kiyun","family":"Gil","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, Chungbuk National University, Cheongju, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9817-3556","authenticated-orcid":false,"given":"Jongho","family":"Shin","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, Chungbuk National University, Cheongju, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2023.3338722"},{"key":"ref2","first-page":"112345","article-title":"Review: Path planning techniques for automated guided vehicles (AGVs)","volume":"10","author":"Lee","year":"2022","journal-title":"IEEE Access"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/sym10100450"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509700"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20258"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487782"},{"key":"ref7","article-title":"Traverse the non-traversable: Estimating traversability for wheeled mobility on vertically challenging terrain","author":"Pan","year":"2024","journal-title":"arXiv:2409.17479"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-016-0362-z"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICAT.2011.6102088"},{"key":"ref10","article-title":"Mobile robot path planning in dynamic environments: A survey","author":"Cai","year":"2020","journal-title":"arXiv:2006.14195"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2014.12.098"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14705-5_1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2976560"},{"key":"ref14","article-title":"An improved rapidly exploring random tree algorithm for path planning in configuration spaces with narrowchannels","author":"Noel","year":"2024","journal-title":"arXiv:2411.00357"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-021-05445-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s12555-021-0462-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2507\/22nd.daaam.proceedings.422"},{"key":"ref18","article-title":"Levenberg\u2013Marquardt algorithm in robotic controls","author":"Love","year":"2020"},{"key":"ref19","article-title":"Artificial potential field-based path planning for cluttered environments","author":"Diab","year":"2022","journal-title":"arXiv:2210.17482"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2021.3123341"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3212741"},{"key":"ref22","volume-title":"Carmaker"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1433-9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812431"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC55140.2022.9922353"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981263"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC57777.2023.10422045"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/s0003-2670(00)82860-3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.23943\/princeton\/9780691147321.001.0001"},{"issue":"3","key":"ref30","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10514-012-9321-0","article-title":"OctoMap: An efficient probabilistic 3D mapping framework based on octrees","volume":"34","author":"Hornung","year":"2013","journal-title":"Auto. Robots"},{"key":"ref31","volume-title":"Youngin-Speedway"},{"key":"ref32","volume-title":"Kia Ev6 Spectification"},{"key":"ref33","volume-title":"Clearpath-Robotics Jackal"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10160508"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11121838.pdf?arnumber=11121838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T19:46:19Z","timestamp":1755546379000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11121838\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3597311","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}