
==== Front
Sci Rep
Sci Rep
Scientific Reports
2045-2322
Nature Publishing Group UK London

39261585
72196
10.1038/s41598-024-72196-3
Article
A novel formula for representing the equivalent resistance of the m×n cylindrical resistor network
Meng Xin 1
Jiang Xiaoyu jxy19890422@sina.com

1
Zheng Yanpeng zhengyanpeng0702@sina.com

2
Jiang Zhaolin 3
1 https://ror.org/01knv0402 grid.410747.1 0000 0004 1763 3680 School of Information Science and Engineering, Linyi University, Linyi, 276000 China
2 https://ror.org/01knv0402 grid.410747.1 0000 0004 1763 3680 School of Automation and Electrical Engineering, Linyi University, Linyi, 276000 China
3 https://ror.org/01knv0402 grid.410747.1 0000 0004 1763 3680 School of Mathematics and Statistics, Linyi University, Linyi, 276000 China
11 9 2024
11 9 2024
2024
14 2125428 5 2024
4 9 2024
© The Author(s) 2024
2024
https://creativecommons.org/licenses/by-nc-nd/4.0/ Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.
The problem of solving the equivalent resistance between two points for resistor networks has important significance in physics. This paper mainly changes and rewrites the formula for calculating the resistance between two points of an unconventional m×n cylindrical resistor network with a zero resistor axis and any two left and right boundaries. To enhance the efficiency of calculating the equivalent resistance between two points, Chebyshev polynomials and hyperbolic cosine functions are employed to represent the new formula. And in the inference process, the famous discrete cosine transform of the third kind (DCT-III) is used to process the matrix. We give the equivalent resistance formula for several special cases, and display them by a three-dimensional graph. Subsequently, the calculation efficiency of the original formula and the rewritten formula are compared. At the end of the paper, a heuristic algorithm suitable for robot path planning on cylindrical environment is proposed.

Subject terms

Electrical and electronic engineering
Applied mathematics
Computational science
http://dx.doi.org/10.13039/501100001809 National Natural Science Foundation of China 12101284 Jiang Xiaoyu http://dx.doi.org/10.13039/100012906 Department of Education of Shandong Province 2023KJ214 Jiang Xiaoyu http://dx.doi.org/10.13039/501100007129 Natural Science Foundation of Shandong Province ZR2022MA092 Jiang Zhaolin issue-copyright-statement© Springer Nature Limited 2024
==== Body
pmcIntroduction

The widespread application of resistor networks has played a crucial role in shaping today’s developed society. In community detection, resistor network has been used to study the number of communities in a network1 and the relationship between structure and function in flow networks2. In biology, resistor networks have been used to study high-density loops in leaf veins3 and to investigate the dynamics of a material’s pore space by interpreting metal accumulation as resistance4. In data networks, researchers have studied the relationship between current flow in a resistor network and data flow in a communication network by comparing Ohm’s law and Little’s theorem5. In the field of sociology, the opinion heterogeneity and their statistical properties under non-consensus conditions have been studied by analogy with the resistance distance in a resistor network6. In the study of damaged plates, the accuracy of damaged plate imaging has been enhanced by modeling the resistor network based on the resistance characteristics obtained through calculation and simulation7. Additionally, resistor networks have also played an important role in the research of ecological network modeling8 and power-grid networks9–11. With the deepening of applied research, the research of resistor networks becomes more and more important. One of the most common problems with resistor network is the calculation of equivalent resistance. However, recent studies have shown that building a mathematical equation model of resistor network can help derive its equivalent resistance formula12–19. In order to improve the computational efficiency of the equivalent resistance, our focus should be on optimizing and rewriting the nearly perfect formula for equivalent resistance. This is an important and challenging task.

In the past few years, many results are achieved in the study of resistor networks. For example, the researches on Laplacian matrix method20–24 of resistor network, corner-to-corner resistance25, infinite network26, and finite network27–37. Since 2013, Tan38–54 creatively proposed the Recursive Transformation (RT) method, which is of great significance in calculating the potential and equivalent resistance of the resistor network. The RT methods includes the RT-V method based on node voltage and the RT-I method based on branch current. Tan uses a different approach than the Laplacian matrix method to solve the resistor network calculation problem, which is simpler and more accurate than the previous methods. As a result, Tan’s RT method has become the foundation for large majority of studies of resistor networks. The RT method uses a modified tridiagonal Toeplitz matrix and the eigenvalues of the matrix in the calculation. Currently, tridiagonal matrices55–59 are extensively researched. Furthermore, the equivalent resistance in graph theory is called the resistance distance60–62.

Planning optimal paths63,64 is consistently a challenging task. To this day, path planning is utilized across various fields such as autonomous driving65, ship route navigation66, UAV path optimization and control67, and robot path planning68. When planning a path on geometric shapes, the minimum distance calculation method based on Euclidean distance fails in this case, making the optimal path planning more complicated. In recent years, as researchers conduct in-depth studies of path planning on geometric shapes, related results continue to emerge. For example, Kulathunga69 and Mazaheri70 respectively study path planning in 3D environment, UĞUR studies path planning on cuboids71, and Xue studies path planning on cylindrical storage tanks72. These researches fully demonstrate the importance of path planning on geometric shapes. In this paper, a path planning algorithm on the cylindrical environment is proposed, which is capable of avoiding local optima, achieving obstacle avoidance and optimal path planning.

The structure of this article is as follows: In section “Re-derivation of equivalent resistance formula”, the re-derived equivalent resistance formula and related proofs are given, several examples of special cases are shown, and made a detailed analysis between the equivalent resistance formula derived in this paper and the formula given by Tan. Finally, a path planning algorithm on the cylinder is designed using the potential formula. In section “Discussion”, the significance and contribution of this study are discussed. In section “Equivalent resistance formula of Tan”, we introduced the equivalent resistance formula derived by Tan.Fig. 1 A cylindrical resistor network model of m×n (n+1 and m are the number of vertical lines and horizontal lines, respectively) with an OA zero resistor axis, where the left and right edge vertical resistances are r1 and r2, respectively, the resistance between two nodes on each horizontal line is r, and the resistance between two nodes on each vertical line is r0.

Fig. 2 Segment of the resistor network with current directions and parameters taken from Fig. 1.

Re-derivation of equivalent resistance formula

In this section, we first present the formula for the equivalent resistance, then derive it in detail in sections “Rederive the equivalent resistance formula using the discrete cosine transform”, “Horadam sequence and Chebyshev polynomials”, “Express the solution of the matrix equations in terms of Chebyshev polynomials”. In section “Rederive the equivalent resistance formula using the discrete cosine transform”, we left-multiplied Eq. (9) by DCT-II, and the resulting Eq. (23) is more suitable for solution. In section “Horadam sequence and Chebyshev polynomials”, we used Chebyshev polynomials to process Eq. (23), and the resulting Eq. (30) helps to derive the final formula. Subsequently, several special cases are discussed and the efficiency of the original and rewritten formulas are compared. Finally, the application of potential functions in path planning is demonstrated.

Equivalent resistance formula expressed by Chebyshev polynomials

In this subsection, the re-derived equivalent resistance formula of the cylindrical resistor network in Fig. 1 is given.

Let current J flow in from d1(x1,y1) and flow out in d2(x2,y2), then the exact equivalent resistance formula between d1(x1,y1) and d2(x2,y2) in the m×n cylindrical resistor network is1 Rm×n(d1,d2)=r0m×∑i=2mr1,1(i)Cy1,i2-2r1,2(i)Cy1,iCy2,i+r2,2(i)Cy2,i2(1-cosθi)Ψn(i),

where2 Ψn(i)=Bn+1(i)+(r1r0+r2r0-2)Bn(i)+(r2r0-1)(r1r0-1)Bn-1(i),

3 rk,s(i)=∂1,xk(i)∂2,n-xs(i),

4 Cq,i=sinq(i-1)πm,q=y1,y2,

5 ∂u,x(i)=ΔBx(i)+(hu-1)ΔBx-1(i),ΔBk(i)=Bk+1(i)-Bk(i),

6 Bk(i)(coshφi)=sinh(kφi)sinhφi,coshφi=ti2,k=x1+1,x1,x1-1,n-x1+1,n-x1,n-x1-1,x2+1,x2,x2-1,n-x2+1,n-x2,n-x2-1,i=2,3,...,m,

7 ti=2+2rr0-2rr0cosθi,θi=(i-1)π/m,

Equation (1) applies to all nodes (xq,yp) where 0≤xq<n and 0≤yp<m. Its input and output points can be any two points. r1, r2, r0 and r represent the longitudinal resistances of the left boundary, right boundary, the remaining longitudinal resistance and all the lateral resistances in the network, respectively, as shown in Fig. 1.

Rederive the equivalent resistance formula using the discrete cosine transform

In this subsection, we will show how to use the well-known discrete cosine transform of the third kind(DCT-III) to process matrix.

In order to obtain a novel formula for calculating equivalent resistance, we use the matrix Am, Am is a corrected tridiagonal Toeplitz matrix given by Tan128 Am=2+h-h0⋯0-h2(1+h)-h⋱⋮0⋱⋱⋱0⋮⋱-h2(1+h)-h0⋯0-h2+hm×m,

where h=r/r0.

Tan12 used Kirchhoff’s law and RT-I method to eliminate the horizontal current shown in Fig. 2, and established a recursive matrix equation model, which is given as follows9 Ik+1=AmIk-Ik-1-JHyδk,x,

the Am is a corrected tridiagonal Toeplitz matrix in Eq. (8), J means current,  δk,x is defined as follow δk,x=1,x=k,0,x≠k, Ik and Hy are column vectors of m×1, defined as followsIk=[Ik(1),Ik(2),...,Ik(m)]T,(0≤k≤n),(Hz)i=h(-1)z(δi,yz-δi,yz+1),z=1,2.

Subsequently, we consider the boundary case, we can obtain the following equations when we use Kirchhoff’s law for the left and right boundaries10 I1=[Am-(2-h1)E]I0,h1I0+I2=AmI1,

11 In-1=[Am-(2-h2)E]In,h2In+In-2=AmIn-1.

where h1=r1/r0,h2=r2/r0.

We will perform the matrix transformation. Let12 CmIII=2mdicos(2k-1)(i-1)π2mk,i=1m,

where di=min{1,22-1+i}.

Obviously, the matrix CmIII73–76 we use is an orthogonal matrix, which is the famous third kind of discrete cosine transform, and its transpose and inverse are both CmII, which has the following property13 (CmIII)-1=(CmIII)T=CmII,

where the CmII is the famous second kind of discrete cosine transform.

We ortho-diagonalize Am, the following equation is obtained by means of matrix multiplication and a series of complex algebraic operations14 (CmIII)-1AmCmIII=CmIIAmCmIII=diag(t1,t2,…,tm),

i.e.,15 Am=CmIIIdiag(t1,t2,...,tm)(CmIII)-1=CmIIIdiag(t1,t2,...,tm)CmII,

where16 ti=2+2h-2hcos(i-1)πm,i=1,2,…,m.

From Eq. (14), it is evident that the matrix Am is similar to diag(t1,t2,...,tm), and thus ti is the eigenvalue of Am.

By left-multiplying Eq. (14) by CmIII the following equation is obtained17 AmCmIII=CmIIIdiag(t1,t2,…,tm),

i.e.,18 Am(ζ(1),ζ(2),⋯,ζ(m))=(ζ(1),ζ(2),⋯,ζ(m))diag(t1,t2,…,tm),

where ζ(i)=(ζ1(i),…,ζm(i))T,19 ζk(i)=2mdicos(2k-1)(i-1)π2m,k=1,2,…,m,i=1,2,…,m,

and di=min{1,22-1+i}.

Equation (18) can be written as follows20 Amζ(i)=tiζ(i),i=1,2,…,m.

According to Eq. (20), we get the eigenvector ζ(i)=(ζ1(i),…,ζm(i))T corresponding to ti.

Let21 Wk=CmIIIk,

i.e.,22 Ik=CmIIIWk,

Wk is a column vector of m×1,Wk=[Wk(1),Wk(2),...,Wk(m)]T,(0≤k≤n).

Equations (9), (10) and (11) are multiplied by CmII on the left, and then combine with Eq. (21) to obtain the following equations23 Wk+1(i)=tiWk(i)-Wk-1(i)-Jhδk,xξxz,i,

24 W1(i)=(ti+h1-2)W0(i),h1W0(i)+W2(i)=tiW1(i),

25 Wn-1(i)=(ti+h2-2)Wn(i),h2Wn(i)+Wn-2(i)=tiWn-1(i),

where ξxz,i=2(-1)zsin((i-1)π2m)sin(yz(i-1)πm), z=1,2.

Horadam sequence and Chebyshev polynomials

In the following, we express the explicit formulation of the Horadam sequence77 by Chebyshev polynomials78 of the second kind.

The Horadam sequence is defined by the following recurrence relation26 Hk=dHk-1-qHk-2,H0=M,H1=Z,

where k∈N,k≥2,M,Z,d,q∈C,  N is the set of all natural numbers and C is the set of all complex numbers.

Subsequently, we rewrite Eq. (26) with Chebyshev polynomials of the second kind27 Hk=(q)kZqUk-1d2q-MUk-2d2q,

where28 Uk(cosL)=sin((k+1)L)sinL,cosL=d2q,L∈C.

The homogeneous equation of Eq. (23) is given by29 Wk+1(i)=tiWk(i)-Wk-1(i),

let H0=Wc, H1=Wc+1, d=ti and q=1 in Eq. (26), based on Eqs. (27) and (28), the following equation is obtained30 Wk(i)=Wc+1(i)Bk-c(i)-Wc(i)Bk-c-1(i),

where31 Bk(cosL)=sin(kL)sinL,cosL=ti2,

the Chebyshev polynomials of the second kind is re-described by hyperbolic functions, then Eq. (31) is transformed into32 Bk(coshL)=sinh(kL)sinhL,coshL=ti2,L∈R,

where R is the set of all real numbers.

Express the solution of the matrix equations in terms of Chebyshev polynomials

In this subsection, we will complete the final derivation of the equivalent resistance formula.

Taking into account the disturbance caused by the input d1(x1,y1) and output d2(x2,y2) points of current, and based on Eqs. (23) and (30), the following piecewise formula is obtained33 Wk(i)=W1(i)Bk(i)-W0(i)Bk-1(i),0≤k≤x1,

34 Wx1+1(i)=tiWx1(i)-Wx1-1(i)-Jhξx1,i,

35 Wk(i)=Wx1+1(i)Bk-x1(i)-Wx1(i)Bk-x1-1(i),x1≤k≤x2,

36 Wx2+1(i)=tiWx2(i)-Wx2-1(i)-Jhξx2,i,

37 Wk(i)=Wx2+1(i)Bk-x2(i)-Wx2(i)Bk-x2-1(i),x2≤k≤n,

by combining Eqs. (24) and (25) with Eqs. (33) to (37), the following expression is obtained38 Wx1(i)=r1,1(i)ξx1,i+r1,2(i)ξx2,i(ti-2)ψn(i)hJ,(i>1),

39 Wx2(i)=r1,2(i)ξx1,i+r2,2(i)ξx2,i(ti-2)ψn(i)hJ,(i>1),

where ξxz,i=2(-1)zsin((i-1)π2m)sin(yz(i-1)πm), z=1,2, ψn(i), rk,s(i), ∂u,x(i) and ti are given in Eqs. (2), (3), (5) and (16), respectively.

According to the cyclic property shown in Fig. 1, when i=1, we obtain40 ∑i=1mUk(j)=0,

combining Eq. (21), the following equation is obtained41 Wk(1)=22∑i=1mIk(i)=22r0∑i=1mUk(i)=0.

Based on Eqs. (22), (38), (39) and (41) we can get the following equations42 ∑i=1y1Ix1(i)=1m∑i=2mWx1(i)sin(y1(i-1)π/m)sin((i-1)π/2m),

43 ∑i=1y2Ix2(i)=1m∑i=2mWx2(i)sin(y2(i-1)π/m)sin((i-1)π/2m).

According to Ohm’s law, the principle formula of the equivalent resistance between d1(x1,y1) and d2(x2,y2) is obtained44 Rm×n(d1,d2)=r0J(∑i=1y2I2(i)-∑i=1y1I1(i)),

where Ix(i) is expressed as the current in the vertical direction.

Finally, based on Eqs. (42), (43) and (44), the equivalent resistance formula (1) is obtained.

Display the equivalent resistance formula for special cases

In the previous subsection, we obtained the exact equivalent resistance formula (1) for cylindrical resistor network. In this subsection, we will present formulas under several specific conditions. The equivalent resistance 3D graphs under different cases are given. To enhance readability and facilitate comparison between different cases, this subsection presents a table at the outset summarizing all the variables in the special cases as shown in Table 1. Among them, r, r0, r1 and r2 represent the resistance of the lateral, longitudinal, left boundary, and right boundary segments, respectively, as shown in Fig. 1.Table 1 Variable changes in special cases.

Special	d1(x1,y1)	d2(x2,y2)	r	r0	r1	r2	
Special 1	(x, y)	(0 , 0)	1	1	1	0	
Special 2	(0 , 0)	(x, y)	1	1	0	0	
Special 3	(0 , 0)	(x, y)	20	1	1	1	
Special 4	(0 , 0)	(x, y)	1	20	1	1	

Special 1 and 2 illustrate the equivalent resistance diagrams when the resistance on one boundary is zero and when the resistance on both boundaries is zero, respectively. In contrast, Special 3 and 4 show the equivalent resistance diagrams when the resistance in the horizontal segment is r=20 and the resistance in the vertical segment is r0=20, respectively.

Special 1 In an arbitrary m×n network, given that the input point of the current is d1(x1,y1) and the fixed output point is d2(0,0)=O, the exact formula for the equivalent resistance between d1 and d2 is45 Rm×n(d1,d2)=r0m×∑i=2mr1,1(i)Cy1,i2(1-cosθi)ψn(i),

where ψn(i),rk,s(i),Cq,i and θi are defined in Eqs. (2), (3), (4) and (7), respectively.

In the exact formula, we assume that m=n=100, x2=0, y2=0, r=r0=r1=1, and r2=0. The formula can be derived using the above equation46 R100×100(d1,O)=1100×∑i=2100r1,1(i)Cy1,i2(1-cosθi)ψ100(i),

where47 r1,1(i)=(Bx1+1(i)-Bx1(i))(B101-x1(i)-2B100-x1(i)+B99-x1(i)),

48 ψ100(i)=B100(i)-B99(i),Cy1,i=siny1(i-1)π100,k=x1,x1+1,101-x1,100-x1,99-x1,100,99,i=1,2,...,100,

49 Bk(i)(coshφi)=sinh(kφi)sinhφi,coshφi=ti2,ti=2+2rr0-2rr0cosθi,θi=(i-1)πm.

Use Matlab to get a 3D graph about the equivalent resistance between d1(x1,y1) and d2(0,0), as shown in Fig. 3.Fig. 3 Three-dimensional graph for R100×100(d1,O) in Eq. (46).

Fig. 4 Three-dimensional graph for R100×100(O,d2) in Eq. (51).

Special 2 Subsequently, when we fix the resistance of the left and right boundaries to 0(r1=r2=0), and allow the current to be input at point d1(0,0) and output at point d2(x2,y2), the exact equivalent resistance formula between d1 and d2 is as follows50 Rm×n(d1,d2)=r0m×∑i=2mr2,2(i)Cy2,i2(1-cosθi)ψn(i),

where ψn(i),rk,s(i),Cq,i and θi are defined in Eqs. (2), (3), (4) and (7), respectively.

When m=n=100, x1=0, y1=0, r=r0=1, and r1=r2=0, the following formula is obtained51 R100×100(O,d2)=1100×∑i=2100r2,2(i)Cy2,i2(1-cosθi)ψ100(i),

where52 r2,2(i)=(Bx2+1(i)-2Bx2(i)+Bx2-1(i))(B101-x2(i)-2B100-x2(i)+B99-x2(i)),

53 ψ100(i)=B100(i)-2B99(i)+B98(i),Cy2,i=siny2(i-1)π100,

k=x2-1,x2,x2+1,101-x2,100-x2,99-x2,i=1,2,...,100,

Bk(i)(coshφi) and θi are the same as Eq. (49).

Use Matlab to get a 3D graph about the equivalent resistance between d1(0,0) and d2(x2,y2), as shown in Fig. 4.

Special 3 When the input point of the current is at d1(0,0) and the output point is at d2(x2,y2), the exact equivalent resistance formula between d1 and d2 can be written as follows54 Rm×n(d1,d2)=r0m×∑i=2mr2,2(i)Cy2,i2(1-cosθi)ψn(i),

where ψn(i),rk,s(i),Cq,i and θi are defined in Eqs. (2), (3), (4) and (7), respectively.

When m=n=100, x1=0, y1=0, r0=r1=r2=1, r=20, substituting into the above Eq. (54) yields55 R100×100(O,d2)=1100×∑i=2100r2,2(i)Cy2,i2(1-cosθi)ψ100(i),

where56 r2,2(i)=(Bx2+1-Bx2)(B101-x2-B100-x2),

57 ψ100(i)=B100(i),Cy2,i=siny2(i-1)π100,

58 Bk(i)(coshφi)=sinh(kφi)sinhφi,coshφi=ti2,ti=2+2rr0-2rr0cosθi,θi=(i-1)πm,k=x2,x2+1,101-x2,100-x2,100,i=1,2,...,100.

Use Matlab to get a 3D graph about the equivalent resistance between d1(0,0) and d2(x2,y2), as shown in Fig. 5.Fig. 5 Three-dimensional graph for R100×100(O,d2) in Eq. (55).

Fig. 6 Three-dimensional graph for R100×100(O,d2) in Eq. (60).

Special 4 Subsequently, let’s change the vertical resistance value to r0=20. The input point for the current is the fixed point d1(0,0)=O, and the output point is any point d2(x2,y2). The exact equivalent resistance formula between d1 and d2 can be written as59 Rm×n(d1,d2)=r0m×∑i=2mr2,2(i)Cy2,i2(1-cosθi)ψn(i),

where ψn(i),rk,s(i),Cq,i and θi are defined in Eqs. (2), (3), (4) and (7), respectively.

When m=n=100, x1=0, y1=0, r=r1=r2=1, and r0=20, the above formula can be written as follows60 R100×100(O,d2)=15×∑i=2100r2,2(i)Cy2,i2(1-cosθi)ψ100(i),

where61 r2,2(i)=(Bx2+1(i)-3920Bx2(i)+1920Bx2-1(i))(B101-x2(i)-3920B100-x2(i)+1920B99-x2(i)),

62 ψ100(i)=B100(i)-1910B99(i)+361400B98(i),Cy2,i=siny2(i-1)π100,k=x2-1,x2,x2+1,101-x2,100-x2,99-x2,98,99,100,i=1,2,...,100,

Bk(i)(coshφi) and θi are the same as Eq. (58).

Use Matlab to get a 3D graph about the equivalent resistance between d1(0,0) and d2(x2,y2), as shown in Fig. 6.

Comparison of computational efficiency

In this subsection, we provide some examples to compare two different methods of calculating equivalent resistance in papers, and use time to compare the computational efficiency of the two methods. We let the current input at d1(x1,y1)and output at d2(x2,y2) in an m×n cylindrical resistor network with a zero resistor axis. In the comparison, The computational efficiency of the equivalent resistance formula is shown, where the CPU processing time of the original formula and the rewritten formula is represented by t1 and t2, respectively. Formula (1) is the new formula, and formula (68) is the original formula.

These experiments are done with MATLAB (R2021a) on an AMD Ryzen 7 5800H laptop with a 3.20 GHz CPU. In the table below, the computation time is in seconds, “m×n” represents the size of the resistor network, and “−” indicates that the computation time exceeded 1600 seconds or that MATLAB ran out of memory.Fig. 7 Comparison of the calculation efficiency of formulas (1) and (68) when r/r0=r1/r0=r2/r0=1.

Fig. 8 Comparison of the calculation efficiency of formulas (1) and (68) when r/r0=r1/r0=r2/r0=1.

Fig. 9 Comparison of the computational efficiency between Eqs. (1) and (68) as m increases, with r/r0=r1/r0=r2/r0=1 and n=100.

Fig. 10 Comparison of the computational efficiency between Eqs. (1) and (68) as n increases, with r/r0=r1/r0=r2/r0=0.1 and m=100.

Fig. 11 Comparison of the computational efficiency of formula (1) and formula (68) at scale of 200×200 when r/r0=r1/r0=r2/r0 are 0.001, 0.01, 0.1, 1 and 10, respectively. (No data means the numerical calculation is invalid).

Fig. 12 Comparison of the calculation efficiency of formulas (1) and (68) when r/r0=r1/r0=r2/r0=0.01. (No data means the numerical calculation is invalid).

Remark 1

It can be observed from Fig. 7 that when the number of nodes in the resistor network is the same i.e., the result of m×n is constant, as m increases, the time required for calculation also increases. Nevertheless, regardless of these changes, the computational efficiency of Eq. (1) remains consistently higher than that of Eq. (68). As shown in Fig. 8, when the size of the resistor network is less than 300×300, the computation time is quite small, making it the most suitable for numerical calculations. The computational efficiency of Eq. (1) improves significantly with increasing network size. Let’s fix n, the calculation time increases significantly after m is greater than 1000, as shown in Fig. 9. In particular, the calculation time of Eq. (68) increases more obviously. Similarly, Fig. 10 shows the efficiency comparison when m is fixed and n is increased, when n is greater than 500, the calculation time increases significantly. Figures 9 and 10 clearly demonstrate the superiority of Eq. (1) when handling large-scale networks.

Remark 2

Referring to Fig. 11, it is evident that the electrical resistivity significantly influences the calculation of the equivalent resistance. When the resistivity ratio increases to 10, it becomes unsuitable for numerical calculation. As shown in Fig. 12, the computation time increases by a factor of 8 for every 4-fold increase in the number of nodes in the resistor network, and the original formula cannot handle large-scale resistor networks within the specified time, whereas the improved formula can.

Application to robot path planning

In this subsection, a path planning method on the cylindrical environment is designed based on the potential formula of the cylindrical given by Tan79.

The formula for the cylindrical potential is as follows63 Um×n(x,y)J=x1-xτmr+r02m∑i=1m-1βx1∨x(i)Cy1-y(i)-βx2∨x(i)Cy2-y(i)(1-cosθi)Gn(i),

where64 βx∨xs(i)=βx,xs(i)=α1,x(i)α2,n-xs(i),ifx≤xs,βxs,x(i)=α1,xs(i)α2,n-x(i),ifx≥xs,

65 Gn(i)=Fn+1(i)+(r1/r0+r2/r0-2)Fn(i)+(r2/r0-1)(r1/r0-1)Fn-1(i),

66 Cyk-y(i)=cos(yk-y)θi,θi=2iπ/m,

67 xτ={x1,0≤x≤x1}∪{x,x1≤x≤x2}∪{x2,x2≤x≤n},

Fn(i) and αu,x(i) are given in Eqs. (69) and (70), respectively.

This algorithm is a heuristic method that completes path planning by simulating potential decline. Compared to the traditional method, the path planning algorithm of potential formula is more suitable for path planning on cylindrical, particularly because it can accommodate the bidirectional reachability characteristic of paths on cylindrical. The algorithm is described as followsAlgorithm: Path planning algorithm

The following is a simulation experiment conducted on the 10×10 cylindrical environment with obstacles shown in Fig. 13.

Let x1=2,y1=2,x2=6,y2=5,r=1,r0=1,r1=1,r2=1 and J=1. The potential discrete distribution view can be obtained according to formula (63), as shown in Fig. 14.Fig. 13 10×10 cylindrical environment with obstacles.

Fig. 14 Obstacle-free potential distribution diagram.

When obstacles are present in the environment, a fixed increment is added to the potential value at the locations of the obstacles. This adjustment allows the robot to effectively navigate around obstacles and achieve obstacle avoidance during path finding, ensuring optimal path planning from high potential to low potential. Path planning in a node-weighted potential distribution diagram is shown in Figs. 15, and 16 presents the robot path planning corresponding to the real cylindrical environment.Fig. 15 Path planning in a node-weighted potential distribution diagram.

Fig. 16 Robot path planning in 10×10 cylindrical environment.

Discussion

This paper utilizes DCT-III and Chebyshev polynomials to derive an equivalent resistance formula. On the one hand, the properties of DCT-III simplify the derivation process. On the other hand, the optimal approximation properties of Chebyshev polynomials enhance the efficiency of the new formula. Based on the efficiency comparison in section “Discussion”, it is clear that the equivalent resistance Eq. (1) is more computationally efficient than Eq. (68). The computing efficiency is increased by 5 times at the same scale. This is especially noticeable as the scale of the resistor network increases. A detailed comparison of the two formulas shows that Eq. (69) requires exponential operations, significantly slowing down the calculation speed. Currently, the equivalent resistance formula has been used to impact damage localization and mode identification of carbon fiber reinforced plastic composites panels7. However, as the area of the composite material plate increases, the computational cost of the original equivalent resistance formula also increases significantly. The equivalent resistance formula proposed in this paper is very suitable for locating the damage position of large materials due to its high calculation efficiency.

This is an innovative attempt to perform path planning by potential formula. The process of finding a path is to find a path from the input point to the output point on the circuit. The process of finding a path is to find the path from the input point to the output point on the circuit. This search is mainly carried out using the numerical results of the potential. In addition, Since most storage tanks are cylindrical, the path planning algorithm designed in this paper is very suitable for the needs of wall-climbing robots to inspect cylindrical storage tanks. The natural downward trend of the potential enables the robot to quickly approach the target, and adding a fixed increment at the obstacle allows the robot to effectively avoid the obstacle. The numerical simulation experiments in section “Application to robot path planning” also demonstrate the effectiveness of the algorithm.

Equivalent resistance formula of Tan

In 2017, Tan12 proposed a non-regular m×n cylindrical resistor network, as shown in Fig. 1. The equivalent resistance between d1(x1,y1) and d2(x2,y2) in the m×n cylindrical resistor network is as follows68 Rm×n(d1,d2)=r0m×∑i=2mβ1,1(i)S1,i2-2β1,2(i)S1,iS2,i+β2,2(i)S2,i2(1-cos(θi))Gn(i),

where69 Fk(i)=(λik-λ¯ik)/(λi-λ¯i),

70 ΔFk(i)=Fk+1(i)-Fk(i),αu,x(i)=ΔFx(i)+(hu-1)ΔFx-1(i),βk,s(i)=α1,xk(i)α2,n-xs(i),

71 Gn(i)=Fn+1(i)+(h1+h2-2)Fn(i)+(h2-1)(h1-1)Fn-1(i),

72 h=r/r0,h1=r1/r0,h2=r2/r0,Sk,i=sin(ykθi),θi=(i-1)π/m,

73 λi=1+h-hcosθi+(1+h-hcosθi)2-1,λ¯i=1+h-hcosθi-(1+h-hcosθi)2-1,

Conclusions

In this article, we modified the equivalent resistance formula for the m×n cylindrical resistor network with a zero resistor axis based on the RT-I method. In the derivation process, the third kind of discrete cosine transform is used to process the equation model. For the equivalent resistance formula, we use Chebyshev polynomials to express it. Subsequently, the formula of equivalent resistance in special cases is displayed using 3D views, and the computational efficiency of the original formula and the modified formula is compared. Additionally, a cylindrical environment path planning algorithm based on the potential formula is proposed. Finally, the application scenarios of the new formula and the path planning algorithm are discussed separately.

Acknowledgements

The research was Supported by the National Natural Science Foundation of China (Grant No. 12101284), the Natural Science Foundation of Shandong Province (Grant No. ZR2022MA092), and the Department of Education of Shandong Province (Grant No. 2023KJ214).

Author contributions

X.J. and Y.Z. conceived the project, performed and analyzed formulae calculations. X.M. validated the correctness of the formula calculation, and realized graph drawing. Z.J. proposed an improved formula for calculating equivalent resistance. All authors contributed equally to the manuscript.

Data availability

All data generated or analysed during this study are included in this article.

Competing interests

The authors declare no competing interests.

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
==== Refs
References

1. Newman ME Girvan M Finding and evaluating community structure in networks Phys. Rev. E 2004 69 2 026113 10.1103/PhysRevE.69.026113
Newman, M. E. & Girvan, M. Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004).10.1103/PhysRevE.69.026113
2. Rubido N Grebogi C Baptista MS Structure and function in flow networks Europhys. Lett. 2013 101 6 68001 10.1209/0295-5075/101/68001
Rubido, N., Grebogi, C. & Baptista, M. S. Structure and function in flow networks. Europhys. Lett. 101(6), 68001 (2013).10.1209/0295-5075/101/68001
3. Katifori E Szöllősi GJ Magnasco MO Damage and fluctuations induce loops in optimal transport networks Phys. Rev. Lett. 2010 104 4 048704 10.1103/PhysRevLett.104.048704 20366746
Katifori, E., Szöllősi, G. J. & Magnasco, M. O. Damage and fluctuations induce loops in optimal transport networks. Phys. Rev. Lett. 104(4), 048704 (2010).20366746 10.1103/PhysRevLett.104.048704
4. Liu Y-J Meirer F Krest CM Webb S Weckhuysen BM Relating structure and composition with accessibility of a single catalyst particle using correlative 3-dimensional micro-spectroscopy Nat. Commun. 2016 7 1 12634 10.1038/ncomms12634 27572475
Liu, Y.-J., Meirer, F., Krest, C. M., Webb, S. & Weckhuysen, B. M. Relating structure and composition with accessibility of a single catalyst particle using correlative 3-dimensional micro-spectroscopy. Nat. Commun. 7(1), 12634 (2016).27572475 10.1038/ncomms12634
5. Haenggi M Analogy between data networks and electric networks Electron. Lett. 2002 38 12 1 10.1049/el:20020413
Haenggi, M. Analogy between data networks and electric networks. Electron. Lett. 38(12), 1 (2002).10.1049/el:20020413
6. Baumann F Sokolov IM Tyloo M A Laplacian approach to stubborn agents and their role in opinion formation on influence networks Phys. A 2020 557 124869 10.1016/j.physa.2020.124869
Baumann, F., Sokolov, I. M. & Tyloo, M. A Laplacian approach to stubborn agents and their role in opinion formation on influence networks. Phys. A 557, 124869 (2020).10.1016/j.physa.2020.124869
7. Zhang D Yang B Tan J-P Jin Y-B Xiao B Xian G Xue X-L Li Y Impact damage localization and mode identification of CFRPs panels using an electric resistance change method Compos. Struct. 2021 276 114587 10.1016/j.compstruct.2021.114587
Zhang, D. et al. Impact damage localization and mode identification of CFRPs panels using an electric resistance change method. Compos. Struct. 276, 114587 (2021).10.1016/j.compstruct.2021.114587
8. Brown MT A picture is worth a thousand words: Energy systems language and simulation Ecol. Model. 2004 178 1 83 100
Brown, M. T. A picture is worth a thousand words: Energy systems language and simulation. Ecol. Model. 178(1), 83–100 (2004).
9. Rubido N Grebogi C Baptista MS Resiliently evolving supply-demand networks Phys. Rev. E 2014 89 1 012801 10.1103/PhysRevE.89.012801
Rubido, N., Grebogi, C. & Baptista, M. S. Resiliently evolving supply-demand networks. Phys. Rev. E 89(1), 012801 (2014).10.1103/PhysRevE.89.012801
10. Tyloo M Pagnier L Jacquod P The key player problem in complex oscillator networks and electric power grids: Resistance centralities identify local vulnerabilities Sci. Adv. 2019 5 11 eaaw8359 10.1126/sciadv.aaw8359 31803830
Tyloo, M., Pagnier, L. & Jacquod, P. The key player problem in complex oscillator networks and electric power grids: Resistance centralities identify local vulnerabilities. Sci. Adv. 5(11), eaaw8359 (2019).31803830 10.1126/sciadv.aaw8359
11. Tyloo M Jacquod P Global robustness versus local vulnerabilities in complex synchronous networks Phys. Rev. E 2019 100 3 032303 10.1103/PhysRevE.100.032303 31639963
Tyloo, M. & Jacquod, P. Global robustness versus local vulnerabilities in complex synchronous networks. Phys. Rev. E 100(3), 032303 (2019).31639963 10.1103/PhysRevE.100.032303
12. Tan Z-Z Two-point resistance of a non-regular cylindrical network with a zero resistor axis and two arbitrary boundaries Commun. Theor. Phys. 2017 67 3 280 288 10.1088/0253-6102/67/3/280
Tan, Z.-Z. Two-point resistance of a non-regular cylindrical network with a zero resistor axis and two arbitrary boundaries. Commun. Theor. Phys. 67(3), 280–288 (2017).10.1088/0253-6102/67/3/280
13. Hadad Y Soric JC Khanikaev AB Alù A Self-induced topological protection in nonlinear circuit arrays Nat. Electron. 2018 1 178 182 10.1038/s41928-018-0042-z
Hadad, Y., Soric, J. C., Khanikaev, A. B. & Alù, A. Self-induced topological protection in nonlinear circuit arrays. Nat. Electron. 1, 178–182 (2018).10.1038/s41928-018-0042-z
14. Pennetta C Alfinito E Reggiani L Fantini F DeMunari I Scorzoni A Biased resistor network model for electromigration failure and related phenomena in metallic lines Phys. Rev. B 2004 70 174305 10.1103/PhysRevB.70.174305
Pennetta, C. et al. Biased resistor network model for electromigration failure and related phenomena in metallic lines. Phys. Rev. B 70, 174305 (2004).10.1103/PhysRevB.70.174305
15. Katsura S Inawashiro S Lattice Green’s functions for the rectangular and the square lattices at arbitrary points J. Math. Phys. 1971 12 1622 10.1063/1.1665785
Katsura, S. & Inawashiro, S. Lattice Green’s functions for the rectangular and the square lattices at arbitrary points. J. Math. Phys. 12, 1622 (1971).10.1063/1.1665785
16. Kirkpatrick S Percolation and conduction Rev. Mod. Phys. 1973 45 497 508 10.1103/RevModPhys.45.574
Kirkpatrick, S. Percolation and conduction. Rev. Mod. Phys. 45, 497–508 (1973).10.1103/RevModPhys.45.574
17. Owaidat MQ Hijjawi RS Khalifeh JM Network with two extra interstitial resistors Int. J. Theor. Phys. 2012 51 3152 3159 10.1007/s10773-012-1196-5
Owaidat, M. Q., Hijjawi, R. S. & Khalifeh, J. M. Network with two extra interstitial resistors. Int. J. Theor. Phys. 51, 3152–3159 (2012).10.1007/s10773-012-1196-5
18. Ferri G Antonini G Ladder-network-based model for interconnects and transmission lines time delay and cutoff frequency determination J. Circuit. Syst. Comp. 2007 16 489 505 10.1142/S0218126607003794
Ferri, G. & Antonini, G. Ladder-network-based model for interconnects and transmission lines time delay and cutoff frequency determination. J. Circuit. Syst. Comp. 16, 489–505 (2007).10.1142/S0218126607003794
19. Winstead V Demarco CL Network essentiality IEEE T. Circuits-I 2012 60 3 703 709
Winstead, V. & Demarco, C. L. Network essentiality. IEEE T. Circuits-I 60(3), 703–709 (2012).
20. Wu FY Theory of resistor networks: The two-point resistance J. Phys. A Math. Gen. 2004 37 6653 10.1088/0305-4470/37/26/004
Wu, F. Y. Theory of resistor networks: The two-point resistance. J. Phys. A Math. Gen. 37, 6653 (2004).10.1088/0305-4470/37/26/004
21. Tzeng WJ Wu FY Theory of impedance networks: The two-point impedance and LC resonances J. Phys. A Math. Gen. 2006 39 8579 10.1088/0305-4470/39/27/002
Tzeng, W. J. & Wu, F. Y. Theory of impedance networks: The two-point impedance and LC resonances. J. Phys. A Math. Gen. 39, 8579 (2006).10.1088/0305-4470/39/27/002
22. Izmailian NS Kenna R Wu FY The two-point resistance of a resistor network: A new formulation and application to the cobweb network J. Phys. A Math. Theor. 2014 47 035003 10.1088/1751-8113/47/3/035003
Izmailian, N. S., Kenna, R. & Wu, F. Y. The two-point resistance of a resistor network: A new formulation and application to the cobweb network. J. Phys. A Math. Theor. 47, 035003 (2014).10.1088/1751-8113/47/3/035003
23. Izmailian NS Kenna R A generalised formulation of the Laplacian approach to resistor networks J. Stat. Mech Theor. E 2014 9 1742 5468
Izmailian, N. S. & Kenna, R. A generalised formulation of the Laplacian approach to resistor networks. J. Stat. Mech Theor. E 9, 1742–5468 (2014).
24. Izmailian NS Kenna R The two-point resistance of fan networks Chin. J. Phys. 2015 53 2 040703
Izmailian, N. S. & Kenna, R. The two-point resistance of fan networks. Chin. J. Phys. 53(2), 040703 (2015).
25. Essam JW Wu FY The exact evaluation of the corner-to-corner resistance of an M×N resistor network: Asymptotic expansion J. Phys. A Math. Theor. 2008 42 025205 10.1088/1751-8113/42/2/025205
Essam, J. W. & Wu, F. Y. The exact evaluation of the corner-to-corner resistance of an resistor network: Asymptotic expansion. J. Phys. A Math. Theor. 42, 025205 (2008).10.1088/1751-8113/42/2/025205
26. Cserti J Application of the lattice Green’s function for calculating the resistance of an infinite network of resistors Am. J. Phys. 2000 68 10 896 906 10.1119/1.1285881
Cserti, J. Application of the lattice Green’s function for calculating the resistance of an infinite network of resistors. Am. J. Phys. 68(10), 896–906 (2000).10.1119/1.1285881
27. Giordano S Disordered lattice networks: General theory and simulations Int. J. Circ. Theor. App. 2005 33 519 540 10.1002/cta.335
Giordano, S. Disordered lattice networks: General theory and simulations. Int. J. Circ. Theor. App. 33, 519–540 (2005).10.1002/cta.335
28. Izmailian NS Huang MC Asymptotic expansion for the resistance between two maximum separated nodes on an M by N resistor network Phys. Rev. E 2010 82 011125 10.1103/PhysRevE.82.011125
Izmailian, N. S. & Huang, M. C. Asymptotic expansion for the resistance between two maximum separated nodes on an by resistor network. Phys. Rev. E 82, 011125 (2010).10.1103/PhysRevE.82.011125
29. Lai M-C Wang W-C Fast direct solvers for Poisson equation on 2D polar and spherical geometries Numer. Meth. Part. D. E 2002 18 56 68 10.1002/num.1038
Lai, M.-C. & Wang, W.-C. Fast direct solvers for Poisson equation on 2D polar and spherical geometries. Numer. Meth. Part. D. E 18, 56–68 (2002).10.1002/num.1038
30. Borges L Daripa P A fast parallel algorithm for the Poisson equation on a disk J. Comput. Phys. 2001 169 151 192 10.1006/jcph.2001.6720
Borges, L. & Daripa, P. A fast parallel algorithm for the Poisson equation on a disk. J. Comput. Phys. 169, 151–192 (2001).10.1006/jcph.2001.6720
31. Chair N The effective resistance of the N-cycle graph with four nearest neighbors J. Stat. Phys. 2014 154 1177 1190 10.1007/s10955-014-0916-z
Chair, N. The effective resistance of the -cycle graph with four nearest neighbors. J. Stat. Phys. 154, 1177–1190 (2014).10.1007/s10955-014-0916-z
32. Chair N Trigonometrical sums connected with the chiral Potts model, verlinde dimension formula, two-dimensional resistor network, and number theory Ann. Phys. 2014 341 56 76 10.1016/j.aop.2013.11.012
Chair, N. Trigonometrical sums connected with the chiral Potts model, verlinde dimension formula, two-dimensional resistor network, and number theory. Ann. Phys. 341, 56–76 (2014).10.1016/j.aop.2013.11.012
33. Jiang Z-L Zhou Y-F Jiang X-Y Zheng Y-P Analytical potential formulae and fast algorithm for a horn torus resistor network Phys. Phys. E 2023 107 4 044123
Jiang, Z.-L., Zhou, Y.-F., Jiang, X.-Y. & Zheng, Y.-P. Analytical potential formulae and fast algorithm for a horn torus resistor network. Phys. Phys. E 107(4), 044123 (2023).
34. Zhou Y-F Zheng Y-P Jiang X-Y Jiang Z-L Fast algorithm and new potential formula represented by Chebyshev polynomials for an m×n globe network Sci. Rep. 2022 12 1 21260 10.1038/s41598-022-25724-y 36481689
Zhou, Y.-F., Zheng, Y.-P., Jiang, X.-Y. & Jiang, Z.-L. Fast algorithm and new potential formula represented by Chebyshev polynomials for an globe network. Sci. Rep. 12(1), 21260 (2022).36481689 10.1038/s41598-022-25724-y
35. Jiang X-Y Zhang G-J Zheng Y-P Jiang Z-L Explicit potential function and fast algorithm for computing potentials in α×β conic surface resistor network Expert Syst. Appl. 2024 238 122157 10.1016/j.eswa.2023.122157
Jiang, X.-Y., Zhang, G.-J., Zheng, Y.-P. & Jiang, Z.-L. Explicit potential function and fast algorithm for computing potentials in conic surface resistor network. Expert Syst. Appl. 238, 122157 (2024).10.1016/j.eswa.2023.122157
36. Zhao W-J Zheng Y-P Jiang X-Y Jiang Z-L Two optimized novel potential formulas and numerical algorithms for m×n cobweb and fan resistor networks Sci. Rep. 2023 13 1 12417 10.1038/s41598-023-39478-8 37524723
Zhao, W.-J., Zheng, Y.-P., Jiang, X.-Y. & Jiang, Z.-L. Two optimized novel potential formulas and numerical algorithms for cobweb and fan resistor networks. Sci. Rep. 13(1), 12417 (2023).37524723 10.1038/s41598-023-39478-8
37. Zhou Y-F Jiang X-Y Zheng Y-P Jiang Z-L Exact novel formulas and fast algorithm of potential for a hammock resistor network AIP Adv. 2023 13 9 095127 10.1063/5.0171330
Zhou, Y.-F., Jiang, X.-Y., Zheng, Y.-P. & Jiang, Z.-L. Exact novel formulas and fast algorithm of potential for a hammock resistor network. AIP Adv. 13(9), 095127 (2023).10.1063/5.0171330
38. Tan Z-Z Recursion-transform approach to compute the resistance of a resistor network with an arbitrary boundary Chin. Phys. B 2015 24 2 020503 10.1088/1674-1056/24/2/020503
Tan, Z.-Z. Recursion-transform approach to compute the resistance of a resistor network with an arbitrary boundary. Chin. Phys. B 24(2), 020503 (2015).10.1088/1674-1056/24/2/020503
39. Tan Z-Z Zhou L Yang J-H The equivalent resistance of a 3×n cobweb network and its conjecture of an m×n cobweb network J. Phys. A Math. Theor. 2013 46 19 195202 10.1088/1751-8113/46/19/195202
Tan, Z.-Z., Zhou, L. & Yang, J.-H. The equivalent resistance of a cobweb network and its conjecture of an cobweb network. J. Phys. A Math. Theor. 46(19), 195202 (2013).10.1088/1751-8113/46/19/195202
40. Tan Z-Z Recursion-transform method for computing resistance of the complex resistor network with three arbitrary boundaries Phys. Rev. E 2015 91 5 052122 10.1103/PhysRevE.91.052122
Tan, Z.-Z. Recursion-transform method for computing resistance of the complex resistor network with three arbitrary boundaries. Phys. Rev. E 91(5), 052122 (2015).10.1103/PhysRevE.91.052122
41. Tan Z-Z Recursion-transform method to a non-regular m×n cobweb with an arbitrary longitude Sci. Rep. 2015 5 11266 10.1038/srep11266 26073882
Tan, Z.-Z. Recursion-transform method to a non-regular cobweb with an arbitrary longitude. Sci. Rep. 5, 11266 (2015).26073882 10.1038/srep11266
42. Tan Z-Z Essam JW Wu FY Two-point resistance of a resistor network embedded on a globe Phys. Rev. E 2014 90 1 012130 10.1103/PhysRevE.90.012130
Tan, Z.-Z., Essam, J. W. & Wu, F. Y. Two-point resistance of a resistor network embedded on a globe. Phys. Rev. E 90(1), 012130 (2014).10.1103/PhysRevE.90.012130
43. Essam JW Tan Z-Z Wu FY Resistance between two nodes in general position on an m×n fan network Phys. Rev. E 2014 90 3 032130 10.1103/PhysRevE.90.032130
Essam, J. W., Tan, Z.-Z. & Wu, F. Y. Resistance between two nodes in general position on an fan network. Phys. Rev. E 90(3), 032130 (2014).10.1103/PhysRevE.90.032130
44. Tan Z-Z Fang J-H Two-point resistance of a cobweb network with a 2r boundary Commun. Theor. Phys. 2015 63 1 36 44 10.1088/0253-6102/63/1/07
Tan, Z.-Z. & Fang, J.-H. Two-point resistance of a cobweb network with a boundary. Commun. Theor. Phys. 63(1), 36–44 (2015).10.1088/0253-6102/63/1/07
45. Tan Z-Z Theory on resistance of m×n cobweb network and its application Int. J. Circ. Theor. Appl. 2015 43 11 1687 1702 10.1002/cta.2035
Tan, Z.-Z. Theory on resistance of cobweb network and its application. Int. J. Circ. Theor. Appl. 43(11), 1687–1702 (2015).10.1002/cta.2035
46. Tan Z-Z Two-point resistance of an m×n resistor network with an arbitrary boundary and its application in RLC network Chin. Phys. B 2016 25 5 050504 10.1088/1674-1056/25/5/050504
Tan, Z.-Z. Two-point resistance of an resistor network with an arbitrary boundary and its application in RLC network. Chin. Phys. B 25(5), 050504 (2016).10.1088/1674-1056/25/5/050504
47. Tan Z-Z Recursion-transform method and potential formulae of the m×n cobweb and fan networks Chin. Phys. B 2017 26 9 090503 10.1088/1674-1056/26/9/090503
Tan, Z.-Z. Recursion-transform method and potential formulae of the cobweb and fan networks. Chin. Phys. B 26(9), 090503 (2017).10.1088/1674-1056/26/9/090503
48. Tan Z Tan Z-Z Chen J Potential formula of the nonregular m×n fan network and its application Sci. Rep. 2018 8 1 5798 10.1038/s41598-018-24164-x 29643340
Tan, Z., Tan, Z.-Z. & Chen, J. Potential formula of the nonregular fan network and its application. Sci. Rep. 8(1), 5798 (2018).29643340 10.1038/s41598-018-24164-x
49. Tan Z Tan Z-Z Zhou L Electrical properties of an m×n hammock network Commun. Theor. Phys. 2018 69 5 610 10.1088/0253-6102/69/5/610
Tan, Z., Tan, Z.-Z. & Zhou, L. Electrical properties of an hammock network. Commun. Theor. Phys. 69(5), 610 (2018).10.1088/0253-6102/69/5/610
50. Tan Z Tan Z-Z Potential formula of an m×n globe network and its application Sci. Rep. 2018 8 1 9937 10.1038/s41598-018-27402-4 29967354
Tan, Z. & Tan, Z.-Z. Potential formula of an globe network and its application. Sci. Rep. 8(1), 9937 (2018).29967354 10.1038/s41598-018-27402-4
51. Tan Z Tan Z-Z Asad JH Owaidat MQ Electrical characteristics of the 2×n and □×n circuit network Phys. Scripta 2019 94 5 055203 10.1088/1402-4896/ab033c
Tan, Z., Tan, Z.-Z., Asad, J. H. & Owaidat, M. Q. Electrical characteristics of the and circuit network. Phys. Scripta 94(5), 055203 (2019).10.1088/1402-4896/ab033c
52. Tan Z-Z Theory of an m×n apple surface network with special boundary Commun. Theor. Phys. 2023 75 6 065701 10.1088/1572-9494/accb82
Tan, Z.-Z. Theory of an apple surface network with special boundary. Commun. Theor. Phys. 75(6), 065701 (2023).10.1088/1572-9494/accb82
53. Tan Z-Z Electrical property of an m×n apple surface network Results Phys. 2023 47 106361 10.1016/j.rinp.2023.106361
Tan, Z.-Z. Electrical property of an apple surface network. Results Phys. 47, 106361 (2023).10.1016/j.rinp.2023.106361
54. Tan Z-Z Wang X Electrical characteristics of a fractional-order 3×n Fan network Commun. Theor. Phys. 2024 76 4 045701 10.1088/1572-9494/ad2c81
Tan, Z.-Z. & Wang, X. Electrical characteristics of a fractional-order Fan network. Commun. Theor. Phys. 76(4), 045701 (2024).10.1088/1572-9494/ad2c81
55. Fu Y-R Jiang X-Y Jiang Z-L Jhang S Properties of a class of perturbed Toeplitz periodic tridiagonal matrices Comp. Appl. Math. 2020 39 1 19 10.1007/s40314-020-01171-1
Fu, Y.-R., Jiang, X.-Y., Jiang, Z.-L. & Jhang, S. Properties of a class of perturbed Toeplitz periodic tridiagonal matrices. Comp. Appl. Math. 39, 1–19 (2020).10.1007/s40314-020-01171-1
56. Fu Y-R Jiang X-Y Jiang Z-L Jhang S Inverses and eigenpairs of tridiagonal Toeplitz matrix with opposite-bordered rows J. Appl. Anal. Comput. 2020 10 4 1599 1613
Fu, Y.-R., Jiang, X.-Y., Jiang, Z.-L. & Jhang, S. Inverses and eigenpairs of tridiagonal Toeplitz matrix with opposite-bordered rows. J. Appl. Anal. Comput. 10(4), 1599–1613 (2020).
57. Wei Y-L Jiang X-Y Jiang Z-L Shon S On inverses and eigenpairs of periodic tridiagonal Toeplitz matrices with perturbed corners J. Appl. Anal. Comput. 2020 10 1 178 191
Wei, Y.-L., Jiang, X.-Y., Jiang, Z.-L. & Shon, S. On inverses and eigenpairs of periodic tridiagonal Toeplitz matrices with perturbed corners. J. Appl. Anal. Comput. 10(1), 178–191 (2020).
58. Wei Y-L Jiang X-Y Jiang Z-L Shon S Determinants and inverses of perturbed periodic tridiagonal Toeplitz matrices Adv. Differ. Equ. 2019 2019 1 1687 1847 10.1186/s13662-019-2335-6
Wei, Y.-L., Jiang, X.-Y., Jiang, Z.-L. & Shon, S. Determinants and inverses of perturbed periodic tridiagonal Toeplitz matrices. Adv. Differ. Equ. 2019(1), 1687–1847 (2019).10.1186/s13662-019-2335-6
59. Fu Y-R Jiang X-Y Jiang Z-L Jhang S Analytic determinants and inverses of Toeplitz and Hankel tridiagonal matrices with perturbed columns Spec. Matrices 2020 8 131 143 10.1515/spma-2020-0012
Fu, Y.-R., Jiang, X.-Y., Jiang, Z.-L. & Jhang, S. Analytic determinants and inverses of Toeplitz and Hankel tridiagonal matrices with perturbed columns. Spec. Matrices 8, 131–143 (2020).10.1515/spma-2020-0012
60. Yang Y Klein DJ A recursion formula for resistance distances and its applications Discrete Appl. Math. 2013 161 16 2702 2715 10.1016/j.dam.2012.07.015
Yang, Y. & Klein, D. J. A recursion formula for resistance distances and its applications. Discrete Appl. Math. 161(16), 2702–2715 (2013).10.1016/j.dam.2012.07.015
61. Chen H-Y Zhang F-J Resistance distance local rules J. Math. Chem. 2008 44 405 417 10.1007/s10910-007-9317-8
Chen, H.-Y. & Zhang, F.-J. Resistance distance local rules. J. Math. Chem. 44, 405–417 (2008).10.1007/s10910-007-9317-8
62. Klein DJ Randić M Resistance distance J. Math. Chem. 1993 12 81 95 10.1007/BF01164627
Klein, D. J. & Randić, M. Resistance distance. J. Math. Chem. 12, 81–95 (1993).10.1007/BF01164627
63. LaValle S-M Planning Algorithms 2013 Cambridge University Press
LaValle, S.-M. Planning Algorithms (Cambridge University Press, 2013).
64. Mahulea C Kloetzer M González R Path Planning of Cooperative Mobile Robots Using Discrete Event Models 2020 Wiley
Mahulea, C., Kloetzer, M. & González, R. Path Planning of Cooperative Mobile Robots Using Discrete Event Models (Wiley, 2020).
65. Ji Y-X Ni L-T Zhao C Tripfield: A 3D potential field model and its applications to local path planning of autonomous vehicles IEEE T Intell. Transp. 2023 24 3 3541 3554 10.1109/TITS.2022.3231259
Ji, Y.-X. et al. Tripfield: A potential field model and its applications to local path planning of autonomous vehicles. IEEE T Intell. Transp. 24(3), 3541–3554 (2023).10.1109/TITS.2022.3231259
66. Zhu Z-X Yin Y Lyu H-G Automatic collision avoidance algorithm based on route-plan-guided artificial potential field method Ocean Eng. 2023 271 113737 10.1016/j.oceaneng.2023.113737
Zhu, Z.-X., Yin, Y. & Lyu, H.-G. Automatic collision avoidance algorithm based on route-plan-guided artificial potential field method. Ocean Eng. 271, 113737 (2023).10.1016/j.oceaneng.2023.113737
67. Pan Z-H Zhang C-X Xia Y-Q An improved artificial potential field method for path planning and formation control of the multi-UAV systems IEEE T Circuits-II 2022 69 3 1129 1133
Pan, Z.-H. et al. An improved artificial potential field method for path planning and formation control of the multi-UAV systems. IEEE T Circuits-II 69(3), 1129–1133 (2022).
68. Yu Z-H Yuan J Li Y-S A path planning algorithm for mobile robot based on water flow potential field method and beetle antennae search algorithm Comput. Electr. Eng. 2023 109 108730 10.1016/j.compeleceng.2023.108730
Yu, Z.-H. et al. A path planning algorithm for mobile robot based on water flow potential field method and beetle antennae search algorithm. Comput. Electr. Eng. 109, 108730 (2023).10.1016/j.compeleceng.2023.108730
69. Kulathunga G A reinforcement learning based path planning approach in 3D environment Procedia Comput. Sci. 2022 212 152 160 10.1016/j.procs.2022.10.217
Kulathunga, G. A reinforcement learning based path planning approach in environment. Procedia Comput. Sci. 212, 152–160 (2022).10.1016/j.procs.2022.10.217
70. Mazaheri H Goli S Nourollah A Path planning in three-dimensional space based on butterfly optimization algorithm Sci. Rep. 2024 14 2332 10.1038/s41598-024-52750-9 38282029
Mazaheri, H., Goli, S. & Nourollah, A. Path planning in three-dimensional space based on butterfly optimization algorithm. Sci. Rep. 14, 2332 (2024).38282029 10.1038/s41598-024-52750-9
71. Aybars U Path planning on a cuboid using genetic algorithms Inf. Sci. 2008 178 16 3275 3287 10.1016/j.ins.2008.04.005
Aybars, U. Path planning on a cuboid using genetic algorithms. Inf. Sci. 178(16), 3275–3287 (2008).10.1016/j.ins.2008.04.005
72. Xue, J.-M., Li, J., Chen, J.-Y., et al. Wall-climbing robot path planning for cylindrical storage tank inspection based on modified a-star algorithm. 2021 IEEE FENDT (2021).
73. Garcia SR Yih S Supercharacters and the discrete Fourier, cosine, and sine transforms Commun. Algebra 2018 46 9 3745 3765 10.1080/00927872.2018.1424866
Garcia, S. R. & Yih, S. Supercharacters and the discrete Fourier, cosine, and sine transforms. Commun. Algebra 46(9), 3745–3765 (2018).10.1080/00927872.2018.1424866
74. Sanchez V Garcia P Peinado AM Diagonalizing properties of the discrete cosine transforms IEEE Trans. Signal Process. 1995 43 11 2631 2641 10.1109/78.482113
Sanchez, V. et al. Diagonalizing properties of the discrete cosine transforms. IEEE Trans. Signal Process. 43(11), 2631–2641 (1995).10.1109/78.482113
75. Strang G The discrete cosine transform SIAM REV 1999 41 1 135 147 10.1137/S0036144598336745
Strang, G. The discrete cosine transform. SIAM REV 41(1), 135–147 (1999).10.1137/S0036144598336745
76. Liu Z Chen S Xu W The eigen-structures of real (skew) circulant matrices with some applications Comput. Appl. Math. 2019 38 1 13 10.1016/j.camwa.2019.03.005
Liu, Z. et al. The eigen-structures of real (skew) circulant matrices with some applications. Comput. Appl. Math. 38, 1–13 (2019).10.1016/j.camwa.2019.03.005
77. Udrea G A note on the sequence (Wn)n≥0 of A. F. Horadam Port. Math. 1996 53 143 156
Udrea, G. A note on the sequence of A. F. Horadam. Port. Math. 53, 143–156 (1996).
78. Mason JC Handscomb DC Chebyshev Polynomials 2002 CRC Press
Mason, J. C. & Handscomb, D. C. Chebyshev Polynomials (CRC Press, 2002).
79. Tan Z-Z Tan Z Electrical properties of m×n cylindrical network Chin. Phys. B 2020 29 8 080503 10.1088/1674-1056/ab96a7
Tan, Z.-Z. & Tan, Z. Electrical properties of cylindrical network. Chin. Phys. B 29(8), 080503 (2020).10.1088/1674-1056/ab96a7
