An optimized potential formula of the m × n apple surface network and its application of potential in path planning

i

This article has been updated. A Correction to this article was published on .

i

The Original Article was published on

i

The Original Article was published on

i

This article has been updated

i

This article was retracted on

i

This article has been updated

Abstract

An optimized potential formula for the m × n apple surface network has been introduced in this paper. Compared with the original potential formula, this method significantly enhances the efficiency required for rapid and large-scale numerical simulations. Based on the optimized potential function, we proposed a metaheuristic algorithm suitable for apple surface environment path planning. Chebyshev polynomials of the first class were employed to represent the potential function. Subsequently, a fast algorithm for calculating the potential utilizing the first kind of discrete sine transform (DST-I) was devised. We proposed potential formulas for several cases to visually present the distribution of the potential and illustrated them using three-dimensional graphs. We also conducted simulation experiments on the computational efficiency of the original and optimized formulas at different data scales, verifying the superiority of the optimized formulas. These findings provided new perspectives and tools for the computation of resistor networks and the design of path planning algorithms. Experiments were conducted to analyze the efficiency and availability of various techniques for computing potential.

Keywords

resistor network / potential / path planning / tridiagonal matrices

CHANGE HISTORY

A Correction to this paper has been published:
https://doi.org

The Retraction Note was updated to reflect reception of statements of disagreement from all authors.

This article has been retracted.Please see the Retraction Notice for more detail:
https://doi.org

References

[1] X. Jiang, D. Meng, Y. Zheng, Z. Jiang, A dynamic cobweb resistance network solution based on a structured zeroing neural network and its applications, Sci. Rep., 15 (2025), 5222. https://doi.org/10.1038/s41598-025-89471-6

[2] G. Kirchhoff, Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird, Ann. Phys., 148 (1847), 497-508. https://doi.org/10.1002/andp.18471481202

[3] J. Cserti, Application of the lattice Green’s function for calculating the resistance of an infinite network of resistors, Am. J. Phys., 68 (2000), 896-906. https://doi.org/10.1119/1.1285881

[4] F. Perrier, F. Girault, Rotational invariance in resistor networks: Two-point resistances around an n-fold corner, Eur. J. Phys., 42 (2021), 025803. https://doi.org/10.1088/1361-6404/abc63d

[5] F. Perrier, F. Girault, Two-point resistances in symmetric bracelet resistor networks: Accurate estimates and exact expressions, Eur. J. Phys., 45 (2024), 025805. https://doi.org/10.1088/1361-6404/ad242a

[6] F. Y. Wu, Theory of resistor networks: the two-point resistance, J. Phys. A: Math. Gen., 37 (2004), 6653. https://doi.org/10.1088/0305-4470/37/26/004

[7] Z. Tan, Theory of an m × n apple surface network with special boundary , Commun. Theor. Phys., 75 (2023), 065701. https://doi.org/10.1088/1572-9494/accb82

[8] F. Luo, L. Luo, Study on the electrical characteristics of 6 × n cobweb cascaded circuit network model , Results Phys., 33 (2022), 105160. https://doi.org/10.1016/j.rinp.2021.105160

[9] J. Wang, Y. Zheng, Z. Jiang, Norm equalities and inequalities for tridiagonal perturbed Toeplitz operator matrices, J. Appl. Anal. Comput., 13 (2023), 671-683. https://doi.org/10.11948/20210489

[10] Y. Fu, X. Jiang, Z. Jiang, S. Jhang, Properties of a class of perturbed Toeplitz periodic tridiagonal matrices, Comput. Appl. Math., 39 (2020), 146. https://doi.org/10.1007/s40314-020-01171-1

[11] H. Chen, F. Zhang, Resistance distance local rules, J. Math. Chem., 44 (2008), 405-417. https://doi.org/10.1007/s10910-007-9317-8

[12] X. Jiang, G. Zhang, Y. Zheng, Z. Jiang, Explicit potential function and fast algorithm for computing potentials in α × β conic surface resistor network, Expert Syst. Appl., 238 (2024), 122157. https://doi.org/10.1016/j.eswa.2023.122157

[13] Z. Jiang, Y. Zhou, X. Jiang, Y. Zheng, Analytical potential formulae and fast algorithm for a horn torus resistor network, Phys. Rev. E, 107 (2023), 044123. https://doi.org/10.1103/PhysRevE.107.044123

[14] S. M. LaValle, Planning Algorithms , Cambridge University Press, 2006. https://doi.org/10.1017/CBO9780511546877

[15] C. Mahulea, M. Kloetzer, R. González, Path Planning of Cooperative Mobile Robots Using Discrete Event Models , Wiley-IEEE Press, 2019. https://doi.org/10.1002/9781119486305

[16] Y. Ji, L. Ni, C. Zhao, C. Lei, Y. Du, W. Wang, Tripfield: A 3D potential field model and its applications to local path planning of autonomous vehicles, IEEE Trans. Intell. Transp. Syst., 24 (2023), 3541-3554. https://doi.org/10.1109/TITS.2022.3231259

[17] Z. Yu, J. Yuan, Y. Li, C. Yuan, S. Deng, A path planning algorithm for mobile robot based on water flow potential field method and beetle antennae search algorithm, Comput. Electr. Eng., 109 (2023), 108730. https://doi.org/10.1016/j.compeleceng.2023.108730

[18] Z. Pan, C. Zhang, Y. Xia, H. Xiong, X. Shao, An improved artificial potential field method for path planning and formation control of the multi-UAV systems, IEEE Trans. Circuits Syst.-II: Express Briefs, 69 (2022), 1129-1133. https://doi.org/10.1109/TCSII.2021.3112787

[19] G. Kulathunga, A reinforcement learning based path planning approach in 3D environment, Procedia Comput. Sci., 212 (2022), 152-160. https://doi.org/10.1016/j.procs.2022.10.217

[20] H. Mazaheri, S. Goli, A. Nourollah, Path planning in three-dimensional space based on butterfly optimization algorithm, Sci. Rep., 14 (2024), 2332. https://doi.org/10.1038/s41598-024-52750-9

[21] J. Xue, J. Li, J. Chen, C. Tu, A. Stancu, X. Wang, Wall-climbing robot path planning for cylindrical storage tank inspection based on modified A-star algorithm, in 2021 IEEE Far East NDT New Technology & Application Forum (FENDT), (2021), 191-195. https://doi.org/10.1109/FENDT54151.2021.9749634

[22] A. Uğur, Path planning on a cuboid using genetic algorithms, Inf. Sci., 178 (2008), 3275-3287. https://doi.org/10.1016/j.ins.2008.04.005

[23] Z. Tan, Electrical property of an m × n apple surface network , Results Phys., 47 (2023), 106361. https://doi.org/10.1016/j.rinp.2023.106361

[24] A. F. Horadam, Basic properties of a certain generalized sequence of numbers, Fibonacci Q., 3 (1965), 161-176. https://doi.org/10.1080/00150517.1965.12431416

[25] G. Udrea, A note on the sequence (W_n)_n≥0 of A. F. Horadam , Port. Math., 53 (1996), 143-155.