{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T02:27:30Z","timestamp":1780108050013,"version":"3.54.0"},"reference-count":37,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The original concept of the artificial potential field in robot path planning has spawned a variety of extensions to address its main weakness, namely the formation of local minima in which the robot may be trapped. In this paper, a smooth navigation function combining the Dijkstra-based discrete static potential field evaluation with bilinear interpolation is proposed. The necessary modifications of the bilinear interpolation method are developed to make it applicable to the path-planning application. The effect is that the strategy makes it possible to solve the problem of the local minima, to generate smooth paths with moderate computational complexity, and at the same time, to largely preserve the product of the computationally intensive static plan. To cope with detected changes in the environment, a simple planning strategy is applied, bypassing the static plan with the solution of the A* algorithm to cope with dynamic discoveries. Results from several test environments are presented to illustrate the advantages of the developed navigation model.<\/jats:p>","DOI":"10.3390\/s22093295","type":"journal-article","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T02:14:39Z","timestamp":1650939279000},"page":"3295","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Robot Navigation Based on Potential Field and Gradient Obtained by Bilinear Interpolation and a Grid-Based Search"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1461-3321","authenticated-orcid":false,"given":"Gregor","family":"Klan\u010dar","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, University of Ljubljana, Tr\u017ea\u0161ka 25, 1000 Ljubljana, Slovenia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2254-6069","authenticated-orcid":false,"given":"Andrej","family":"Zde\u0161ar","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering, University of Ljubljana, Tr\u017ea\u0161ka 25, 1000 Ljubljana, Slovenia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohan","family":"Krishnan","sequence":"additional","affiliation":[{"name":"Electrical & Computer Engineering and Computer Science Department, University of Detroit Mercy, Detroit, MI 48208, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"LaValle, S.M. (2006). Planning Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511546877"},{"key":"ref_2","unstructured":"Stentz, A. (1994, January 8\u201313). Optimal and efficient path planning for partially-known environments. Proceedings of the 1994 IEEE International Conference on Robotics and Automation, San Diego, CA, USA."},{"key":"ref_3","unstructured":"Stentz, A. (1995, January 20\u201325). The Focussed D* Algorithm for Real-Time Replanning. Proceedings of the International Joint Conference on Artificial Intelligence, Montreal, QC, Canada."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TRO.2004.838026","article-title":"Fast replanning for navigation in unknown terrain","volume":"21","author":"Koenig","year":"2005","journal-title":"IEEE Trans. Robot."},{"key":"ref_5","unstructured":"Philippsen, R., and Siegwart, R. (2005, January 18\u201322). An Interpolated Dynamic Navigation Function. Proceedings of the 2005 IEEE International Conference on Robotics and Automation, Barcelona, Spain."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1177\/0278364911406761","article-title":"Sampling-based algorithms for optimal motion planning","volume":"30","author":"Karaman","year":"2011","journal-title":"Int. J. Robot. Res."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Ib\u00e1\u00f1ez, J.R., P\u00e9rez-del Pulgar, C.J., and Garc\u00eda-Cerezo, A. (2021). Path Planning for Autonomous Mobile Robots: A Review. Sensors, 21.","DOI":"10.3390\/s21237898"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1177\/027836498600500106","article-title":"Real-Time Obstacle Avoidance for Manipulators and Mobile Robots","volume":"5","author":"Khatib","year":"1986","journal-title":"Int. J. Robot. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/MRA.2008.921540","article-title":"Roadmap-based path planning-using the voronoi diagram for a clearance-based shortest path","volume":"15","author":"Bhattacharya","year":"2008","journal-title":"IEEE Robot. Autom. Mag."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1177\/027836499201100409","article-title":"Path Planning Using a Tangent Graph for Mobile Robots Among Polygonal and Curved Obstacles: Communication","volume":"11","author":"Liu","year":"1992","journal-title":"Int. J. Robot. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1017\/S0263574712000331","article-title":"Reactive and the shortest path navigation of a wheeled mobile robot in cluttered environments","volume":"31","author":"Savkin","year":"2013","journal-title":"Robotica"},{"key":"ref_12","first-page":"1415","article-title":"Path planning of a mobile robot among curved obstacles through tangent drawing and trapezoidal decomposition","volume":"24","author":"Eapen","year":"2021","journal-title":"Eng. Sci. Technol. Int. J."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A Note on Two Problems in Connexion with Graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2021.01.019","article-title":"Planning and control of autonomous mobile robots for intralogistics: Literature review and research agenda","volume":"294","author":"Fragapane","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Klan\u010dar, G., and Seder, M. (2022). Coordinated Multi-Robotic Vehicles Navigation and Control in Shop Floor Automation. Sensors, 22.","DOI":"10.3390\/s22041455"},{"key":"ref_16","unstructured":"Lee, N. (2018). Motion Planning in Computer Games. Encyclopedia of Computer Graphics and Games, Springer International Publishing."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TRO.2021.3123896","article-title":"Attack-Resilient Path Planning Using Dynamic Games With Stopping States","volume":"38","author":"Banik","year":"2022","journal-title":"IEEE Trans. Robot."},{"key":"ref_18","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 Trans. Syst. Sci. Cybern."},{"key":"ref_19","unstructured":"Choset, H., Lynch, K., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L., and Thrun, S. (2005). Principles of Robot Motion: Theory, Algorithms, and Implementations, MIT Press."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF00711254","article-title":"Robot navigation in a known environment with unknown moving obstacles","volume":"1","author":"Ratering","year":"1995","journal-title":"Auton. Robot."},{"key":"ref_21","unstructured":"Wang, L.C., Yong, L.S., and Ang, M. (2002, January 30). Hybrid of global path planning and local navigation implemented on a mobile robot in indoor environment. Proceedings of the IEEE Internatinal Symposium on Intelligent Control, Vancouver, BC, Canada."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Azmi, M.Z., and Ito, T. (2020). Artificial Potential Field with Discrete Map Transformation for Feasible Indoor Path Planning. Appl. Sci., 10.","DOI":"10.3390\/app10248987"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"221013","DOI":"10.1109\/ACCESS.2020.3043539","article-title":"Comparison of Discrete Artificial Potential Field Algorithm and Wave-Front Algorithm for Autonomous Ship Trajectory Planning","volume":"8","author":"Lazarowska","year":"2020","journal-title":"IEEE Access"},{"key":"ref_24","unstructured":"Amiryan, J., and Jamzad, M. (2020). Adaptive Motion Planning with Artificial Potential Fields Using a Prior Path. arXiv."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-981-13-1595-4_11","article-title":"An Optimized Path Planning for the Mobile Robot Using Potential Field Method and PSO Algorithm","volume":"Volume 2","author":"Mandava","year":"2019","journal-title":"Soft Computing for Problem Solving"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Lyu, H., and Yin, Y. (2018). Fast Path Planning for Autonomous Ships in Restricted Waters. Appl. Sci., 8.","DOI":"10.3390\/app8122592"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1876","DOI":"10.1007\/BF02982426","article-title":"A new technique to escape local minimum in artificial potential field based path planning","volume":"17","author":"Park","year":"2003","journal-title":"KSME Int. J."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.conengprac.2016.07.008","article-title":"Avoiding Local Minima in the Potential Field Method using Input-to-State Stability","volume":"55","author":"Guerra","year":"2016","journal-title":"Control Eng. Pract."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Cheng, C., and Chen, Y. (2021, January 22\u201324). A Neural Network based Mobile Robot Navigation Approach using Reinforcement Learning Parameter Tuning Mechanism. Proceedings of the 2021 China Automation Congress (CAC), Beijing, China.","DOI":"10.1109\/CAC53003.2021.9728061"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.1016\/j.asoc.2009.02.014","article-title":"Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation","volume":"9","author":"Castillo","year":"2009","journal-title":"Appl. Soft Comput."},{"key":"ref_31","unstructured":"Tarokh, M. (2000, January 11\u201316). Path planning of rovers using fuzzy logic and genetic algorithm. Proceedings of the World Automation Conference ISORA-026, Maui, HI, USA."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"\u0110akulovi\u0107, M., Sprunk, C., Spinello, L., Petrovic, I., and Burgard, W. (2013, January 3\u20137). Efficient navigation for anyshape holonomic mobile robots in dynamic environments. Proceedings of the 2013 IEEE\/RSJ International Conference on Intelligent Robots and Systems, Tokyo, Japan.","DOI":"10.1109\/IROS.2013.6696729"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Karaman, S., and Frazzoli, E. (2010, January 15\u201317). Optimal kinodynamic motion planning using incremental sampling-based methods. Proceedings of the 49th IEEE conference on decision and control (CDC), Atlanta, GA, USA.","DOI":"10.1109\/CDC.2010.5717430"},{"key":"ref_34","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P. (1992). Numerical Recipes in C: The Art of Scientific Computing, ACM. [2nd ed.]."},{"key":"ref_35","unstructured":"(2022, February 15). Bilinear Interpolation. Available online: https:\/\/en.wikipedia.org\/wiki\/Bilinear_interpolation."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1109\/TASSP.1981.1163711","article-title":"Cubic convolution interpolation for digital image processing","volume":"29","author":"Keys","year":"1981","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"ref_37","unstructured":"Forsyth, D., and Ponce, J. (2011). Computer Vision: A Modern Approach, Prentice Hall."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/9\/3295\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:00:58Z","timestamp":1760137258000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/9\/3295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":37,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,5]]}},"alternative-id":["s22093295"],"URL":"https:\/\/doi.org\/10.3390\/s22093295","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,25]]}}}