Abstract
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\times 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.
Similar content being viewed by others
Introduction
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,10,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,13,14,15,16,17,18,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,21,22,23,24 of resistor network, corner-to-corner resistance25, infinite network26, and finite network27,28,29,30,31,32,33,34,35,36,37. Since 2013, Tan38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,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,56,57,58,59 are extensively researched. Furthermore, the equivalent resistance in graph theory is called the resistance distance60,61,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.
A cylindrical resistor network model of \(m\times 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 \(r_1\) and \(r_2\), respectively, the resistance between two nodes on each horizontal line is r, and the resistance between two nodes on each vertical line is \(r_0\).
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 \(d_{1}(x_{1}, y_{1})\) and flow out in \(d_{2}(x_{2}, y_{2})\), then the exact equivalent resistance formula between \(d_{1}(x_{1}, y_{1})\) and \(d_{2}(x_{2}, y_{2})\) in the \(m \times n\) cylindrical resistor network is
where
Equation (1) applies to all nodes \((x_{q}, y_{p})\) where \(0\le {x_q} < n\) and \(0\le {y_p} < m\). Its input and output points can be any two points. \(r_1\), \(r_2\), \(r_0\) 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 \(\textbf{A}_m\), \(\textbf{A}_m\) is a corrected tridiagonal Toeplitz matrix given by Tan12
where \(h = r/r_0\).
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 follows
the \(\textbf{A}_{m}\) is a corrected tridiagonal Toeplitz matrix in Eq. (8), J means current, \(\delta _{k,x}\) is defined as follow \(\delta _{k,x}={\left\{ \begin{array}{ll}1,& x=k,\\ 0,& x\ne k,\end{array}\right. }\) \(\textbf{I}_{k}\) and \(\textbf{H}_{y}\) are column vectors of \(m \times 1\), defined as follows
Subsequently, we consider the boundary case, we can obtain the following equations when we use Kirchhoff’s law for the left and right boundaries
where \(h_1=r_1/r_0,~h_2=r_2/r_0\).
We will perform the matrix transformation. Let
where \({d_i} = \min \{ 1,\frac{{\sqrt{2} }}{2}-1 + i\}\).
Obviously, the matrix \(\mathbb {C}_m^{III}\)73,74,75,76 we use is an orthogonal matrix, which is the famous third kind of discrete cosine transform, and its transpose and inverse are both \(\mathbb {C}_m^{II}\), which has the following property
where the \(\mathbb {C}_m^{II}\) is the famous second kind of discrete cosine transform.
We ortho-diagonalize \(A_{m}\), the following equation is obtained by means of matrix multiplication and a series of complex algebraic operations
i.e.,
where
From Eq. (14), it is evident that the matrix \(\textbf{A}_{m}\) is similar to \(\textrm{diag}({t_1},{t_2},...,{t_m})\), and thus \(t_i\) is the eigenvalue of \(\textbf{A}_{m}\).
By left-multiplying Eq. (14) by \(\mathbb {C}_{{m}}^{III}\) the following equation is obtained
i.e.,
where \(\zeta ^{(i)}=\bigg (\zeta ^{(i)}_1,\ldots ,\zeta ^{(i)}_m\bigg )^{T}\),
and \({d_i} = \min \{ 1,\frac{{\sqrt{2} }}{2}-1 + i\}\).
Equation (18) can be written as follows
According to Eq. (20), we get the eigenvector \(\zeta ^{(i)}=\bigg (\zeta ^{(i)}_1,\ldots ,\zeta ^{(i)}_m\bigg )^{T}\) corresponding to \(t_{i}\).
Let
i.e.,
\({W}_{k}\) is a column vector of \(m\times 1\),
Equations (9), (10) and (11) are multiplied by \(\mathbb {C}_m^{II}\) on the left, and then combine with Eq. (21) to obtain the following equations
where \({\xi _{x_z,i}} = 2{( - 1)^z}\sin \bigg (\frac{{(i - 1)\pi }}{{2m}}\bigg )\sin \bigg (\frac{{{y_z}(i - 1)\pi }}{m}\bigg )\), \(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 relation
where \(k\in \textbf{N},~~k\ge 2,~~M,Z,d,q\in \textbf{C}\), \(\textbf{N}\) is the set of all natural numbers and \(\textbf{C}\) is the set of all complex numbers.
Subsequently, we rewrite Eq. (26) with Chebyshev polynomials of the second kind
where
The homogeneous equation of Eq. (23) is given by
let \(H_0=W_c\), \(H_1=W_{c+1}\), \(d=t_i\) and \(q=1\) in Eq. (26), based on Eqs. (27) and (28), the following equation is obtained
where
the Chebyshev polynomials of the second kind is re-described by hyperbolic functions, then Eq. (31) is transformed into
where \(\textbf{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 \(d_1(x_1,y_1)\) and output \(d_2(x_2,y_2)\) points of current, and based on Eqs. (23) and (30), the following piecewise formula is obtained
by combining Eqs. (24) and (25) with Eqs. (33) to (37), the following expression is obtained
where \({\xi _{x_z,i}} = 2{( - 1)^z}\sin (\frac{{(i - 1)\pi }}{{2m}})\sin (\frac{{{y_z}(i - 1)\pi }}{m})\), \(z = 1,2\), \(\psi _n^{(i)}\), \(r_{k,s}^{(i)}\), \(\partial _{u,x}^{(i)}\) and \(t_{i}\) are given in Eqs. (2), (3), (5) and (16), respectively.
According to the cyclic property shown in Fig. 1, when \(i = 1\), we obtain
combining Eq. (21), the following equation is obtained
Based on Eqs. (22), (38), (39) and (41) we can get the following equations
According to Ohm’s law, the principle formula of the equivalent resistance between \(d_{1}(x_{1}, y_{1})\) and \(d_{2}(x_{2}, y_{2})\) is obtained
where \(I_{x}^{(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, \(r_0\), \(r_1\) and \(r_2\) represent the resistance of the lateral, longitudinal, left boundary, and right boundary segments, respectively, as shown in Fig. 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 \(r_0=20\), respectively.
Special 1 In an arbitrary \(m \times n\) network, given that the input point of the current is \(d_{1}(x_{1},y_{1})\) and the fixed output point is \(d_{2}(0,0)=O\), the exact formula for the equivalent resistance between \(d_{1}\) and \(d_{2}\) is
where \(\psi _{n}^{(i)}, r_{k,s}^{(i)},C_{q,i}\) and \(\theta _i\) are defined in Eqs. (2), (3), (4) and (7), respectively.
In the exact formula, we assume that \(m=n=100\), \(x_{2}=0\), \(y_{2}=0\), \(r=r_{0}=r_{1}=1\), and \(r_{2}=0\). The formula can be derived using the above equation
where
Use Matlab to get a 3D graph about the equivalent resistance between \(d_1(x_1,y_1)\) and \(d_2(0,0)\), as shown in Fig. 3.
Three-dimensional graph for \(R_{100\times 100}(d_{1},O)\) in Eq. (46).
Three-dimensional graph for \(R_{100\times 100}(O,d_{2})\) in Eq. (51).
Special 2 Subsequently, when we fix the resistance of the left and right boundaries to \(0 (r_{1}=r_{2}=0)\), and allow the current to be input at point \(d_{1}(0,0)\) and output at point \(d_{2}(x_{2},y_{2})\), the exact equivalent resistance formula between \(d_{1}\) and \(d_{2}\) is as follows
where \(\psi _{n}^{(i)}, r_{k,s}^{(i)},C_{q,i}\) and \(\theta _i\) are defined in Eqs. (2), (3), (4) and (7), respectively.
When \(m=n=100\), \(x_{1}=0\), \(y_{1}=0\), \(r=r_{0}=1\), and \(r_{1}=r_{2}=0\), the following formula is obtained
where
\(B_k^{(i)}(\cosh \varphi _{i})\) and \(\theta _i\) are the same as Eq. (49).
Use Matlab to get a 3D graph about the equivalent resistance between \(d_1(0,0)\) and \(d_2(x_2,y_2)\), as shown in Fig. 4.
Special 3 When the input point of the current is at \(d_{1}(0,0)\) and the output point is at \(d_{2}(x_{2},y_{2})\), the exact equivalent resistance formula between \(d_{1}\) and \(d_{2}\) can be written as follows
where \(\psi _{n}^{(i)}, r_{k,s}^{(i)},C_{q,i}\) and \(\theta _i\) are defined in Eqs. (2), (3), (4) and (7), respectively.
When \(m=n=100\), \(x_{1}=0\), \(y_{1}=0\), \(r_{0}=r_{1}=r_{2}=1\), \(r=20\), substituting into the above Eq. (54) yields
where
Use Matlab to get a 3D graph about the equivalent resistance between \(d_1(0,0)\) and \(d_2(x_2,y_2)\), as shown in Fig. 5.
Three-dimensional graph for \(R_{100\times 100}(O,d_{2})\) in Eq. (55).
Three-dimensional graph for \(R_{100\times 100}(O,d_{2})\) in Eq. (60).
Special 4 Subsequently, let’s change the vertical resistance value to \(r_{0}=20\). The input point for the current is the fixed point \(d_{1}(0,0)=O\), and the output point is any point \(d_{2}(x_{2},y_{2})\). The exact equivalent resistance formula between \(d_{1}\) and \(d_{2}\) can be written as
where \(\psi _{n}^{(i)}, r_{k,s}^{(i)},C_{q,i}\) and \(\theta _i\) are defined in Eqs. (2), (3), (4) and (7), respectively.
When \(m=n=100\), \(x_{1}=0\), \(y_{1}=0\), \(r=r_{1}=r_{2}=1\), and \(r_{0}=20\), the above formula can be written as follows
where
\(B_k^{(i)}(\cosh \varphi _{i})\) and \(\theta _i\) are the same as Eq. (58).
Use Matlab to get a 3D graph about the equivalent resistance between \(d_1(0,0)\) and \(d_2(x_2,y_2)\), 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 \(d_{1}(x_{1},y_{1})\)and output at \(d_{2}(x_{2},y_{2})\) in an \(m\times 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 \(t_{1}\) and \(t_{2}\), 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\times n\)” represents the size of the resistor network, and “−” indicates that the computation time exceeded 1600 seconds or that MATLAB ran out of memory.
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\times 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 \times 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 follows
where
\(F_n^{(i)}\) and \(\alpha _{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 follows
The following is a simulation experiment conducted on the \(10\times 10\) cylindrical environment with obstacles shown in Fig. 13.
Let \(x_1=2, ~y_1=2, ~x_2=6, ~y_2=5, ~r=1, ~r_0=1, ~r_1=1, ~r_2=1\) and \(J=1\). The potential discrete distribution view can be obtained according to formula (63), as shown in Fig. 14.
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.
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 \times n\) cylindrical resistor network, as shown in Fig. 1. The equivalent resistance between \(d_1(x_1, y_1)\) and \(d_2(x_2, y_2)\) in the \(m \times n\) cylindrical resistor network is as follows
where
Conclusions
In this article, we modified the equivalent resistance formula for the \(m\times 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.
Data availability
All data generated or analysed during this study are included in this article.
References
Newman, M. E. & Girvan, M. Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004).
Rubido, N., Grebogi, C. & Baptista, M. S. Structure and function in flow networks. Europhys. Lett. 101(6), 68001 (2013).
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).
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).
Haenggi, M. Analogy between data networks and electric networks. Electron. Lett. 38(12), 1 (2002).
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).
Zhang, D. et al. Impact damage localization and mode identification of CFRPs panels using an electric resistance change method. Compos. Struct. 276, 114587 (2021).
Brown, M. T. A picture is worth a thousand words: Energy systems language and simulation. Ecol. Model. 178(1), 83–100 (2004).
Rubido, N., Grebogi, C. & Baptista, M. S. Resiliently evolving supply-demand networks. Phys. Rev. E 89(1), 012801 (2014).
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).
Tyloo, M. & Jacquod, P. Global robustness versus local vulnerabilities in complex synchronous networks. Phys. Rev. E 100(3), 032303 (2019).
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).
Hadad, Y., Soric, J. C., Khanikaev, A. B. & Alù, A. Self-induced topological protection in nonlinear circuit arrays. Nat. Electron. 1, 178–182 (2018).
Pennetta, C. et al. Biased resistor network model for electromigration failure and related phenomena in metallic lines. Phys. Rev. B 70, 174305 (2004).
Katsura, S. & Inawashiro, S. Lattice Green’s functions for the rectangular and the square lattices at arbitrary points. J. Math. Phys. 12, 1622 (1971).
Kirkpatrick, S. Percolation and conduction. Rev. Mod. Phys. 45, 497–508 (1973).
Owaidat, M. Q., Hijjawi, R. S. & Khalifeh, J. M. Network with two extra interstitial resistors. Int. J. Theor. Phys. 51, 3152–3159 (2012).
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).
Winstead, V. & Demarco, C. L. Network essentiality. IEEE T. Circuits-I 60(3), 703–709 (2012).
Wu, F. Y. Theory of resistor networks: The two-point resistance. J. Phys. A Math. Gen. 37, 6653 (2004).
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).
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).
Izmailian, N. S. & Kenna, R. A generalised formulation of the Laplacian approach to resistor networks. J. Stat. Mech Theor. E 9, 1742–5468 (2014).
Izmailian, N. S. & Kenna, R. The two-point resistance of fan networks. Chin. J. Phys. 53(2), 040703 (2015).
Essam, J. W. & Wu, F. Y. The exact evaluation of the corner-to-corner resistance of an \(M \times N\) resistor network: Asymptotic expansion. J. Phys. A Math. Theor. 42, 025205 (2008).
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).
Giordano, S. Disordered lattice networks: General theory and simulations. Int. J. Circ. Theor. App. 33, 519–540 (2005).
Izmailian, N. S. & Huang, M. C. Asymptotic expansion for the resistance between two maximum separated nodes on an \(M\) by \(N\) resistor network. Phys. Rev. E 82, 011125 (2010).
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).
Borges, L. & Daripa, P. A fast parallel algorithm for the Poisson equation on a disk. J. Comput. Phys. 169, 151–192 (2001).
Chair, N. The effective resistance of the \(N\)-cycle graph with four nearest neighbors. J. Stat. Phys. 154, 1177–1190 (2014).
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).
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).
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\times n\) globe network. Sci. Rep. 12(1), 21260 (2022).
Jiang, X.-Y., Zhang, G.-J., Zheng, Y.-P. & Jiang, Z.-L. Explicit potential function and fast algorithm for computing potentials in \(\alpha \times \beta\) conic surface resistor network. Expert Syst. Appl. 238, 122157 (2024).
Zhao, W.-J., Zheng, Y.-P., Jiang, X.-Y. & Jiang, Z.-L. Two optimized novel potential formulas and numerical algorithms for \(m\times n\) cobweb and fan resistor networks. Sci. Rep. 13(1), 12417 (2023).
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).
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).
Tan, Z.-Z., Zhou, L. & Yang, J.-H. The equivalent resistance of a \(3\times n\) cobweb network and its conjecture of an \(m \times n\) cobweb network. J. Phys. A Math. Theor. 46(19), 195202 (2013).
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).
Tan, Z.-Z. Recursion-transform method to a non-regular \(m\times n\) cobweb with an arbitrary longitude. Sci. Rep. 5, 11266 (2015).
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).
Essam, J. W., Tan, Z.-Z. & Wu, F. Y. Resistance between two nodes in general position on an \(m\times n\) fan network. Phys. Rev. E 90(3), 032130 (2014).
Tan, Z.-Z. & Fang, J.-H. Two-point resistance of a cobweb network with a \(2r\) boundary. Commun. Theor. Phys. 63(1), 36–44 (2015).
Tan, Z.-Z. Theory on resistance of \(m\times n\) cobweb network and its application. Int. J. Circ. Theor. Appl. 43(11), 1687–1702 (2015).
Tan, Z.-Z. Two-point resistance of an \(m\times n\) resistor network with an arbitrary boundary and its application in RLC network. Chin. Phys. B 25(5), 050504 (2016).
Tan, Z.-Z. Recursion-transform method and potential formulae of the \(m\times n\) cobweb and fan networks. Chin. Phys. B 26(9), 090503 (2017).
Tan, Z., Tan, Z.-Z. & Chen, J. Potential formula of the nonregular \(m\times n\) fan network and its application. Sci. Rep. 8(1), 5798 (2018).
Tan, Z., Tan, Z.-Z. & Zhou, L. Electrical properties of an \(m\times n\) hammock network. Commun. Theor. Phys. 69(5), 610 (2018).
Tan, Z. & Tan, Z.-Z. Potential formula of an \(m\times n\) globe network and its application. Sci. Rep. 8(1), 9937 (2018).
Tan, Z., Tan, Z.-Z., Asad, J. H. & Owaidat, M. Q. Electrical characteristics of the \(2\times n\) and \(\square \times n\) circuit network. Phys. Scripta 94(5), 055203 (2019).
Tan, Z.-Z. Theory of an \(m\times n\) apple surface network with special boundary. Commun. Theor. Phys. 75(6), 065701 (2023).
Tan, Z.-Z. Electrical property of an \(m\times n\) apple surface network. Results Phys. 47, 106361 (2023).
Tan, Z.-Z. & Wang, X. Electrical characteristics of a fractional-order \(3\times n\) Fan network. Commun. Theor. Phys. 76(4), 045701 (2024).
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).
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).
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).
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).
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).
Yang, Y. & Klein, D. J. A recursion formula for resistance distances and its applications. Discrete Appl. Math. 161(16), 2702–2715 (2013).
Chen, H.-Y. & Zhang, F.-J. Resistance distance local rules. J. Math. Chem. 44, 405–417 (2008).
Klein, D. J. & Randić, M. Resistance distance. J. Math. Chem. 12, 81–95 (1993).
LaValle, S.-M. Planning Algorithms (Cambridge University Press, 2013).
Mahulea, C., Kloetzer, M. & González, R. Path Planning of Cooperative Mobile Robots Using Discrete Event Models (Wiley, 2020).
Ji, Y.-X. et al. Tripfield: A \(\text{3D }\) potential field model and its applications to local path planning of autonomous vehicles. IEEE T Intell. Transp. 24(3), 3541–3554 (2023).
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).
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).
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).
Kulathunga, G. A reinforcement learning based path planning approach in \(\text{3D }\) environment. Procedia Comput. Sci. 212, 152–160 (2022).
Mazaheri, H., Goli, S. & Nourollah, A. Path planning in three-dimensional space based on butterfly optimization algorithm. Sci. Rep. 14, 2332 (2024).
Aybars, U. Path planning on a cuboid using genetic algorithms. Inf. Sci. 178(16), 3275–3287 (2008).
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).
Garcia, S. R. & Yih, S. Supercharacters and the discrete Fourier, cosine, and sine transforms. Commun. Algebra 46(9), 3745–3765 (2018).
Sanchez, V. et al. Diagonalizing properties of the discrete cosine transforms. IEEE Trans. Signal Process. 43(11), 2631–2641 (1995).
Strang, G. The discrete cosine transform. SIAM REV 41(1), 135–147 (1999).
Liu, Z. et al. The eigen-structures of real (skew) circulant matrices with some applications. Comput. Appl. Math. 38, 1–13 (2019).
Udrea, G. A note on the sequence \((W_n)_{n\ge 0}\) of A. F. Horadam. Port. Math. 53, 143–156 (1996).
Mason, J. C. & Handscomb, D. C. Chebyshev Polynomials (CRC Press, 2002).
Tan, Z.-Z. & Tan, Z. Electrical properties of \(m \times n\) cylindrical network. Chin. Phys. B 29(8), 080503 (2020).
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 information
Authors and Affiliations
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.
Corresponding authors
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
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/.
About this article
Cite this article
Meng, X., Jiang, X., Zheng, Y. et al. A novel formula for representing the equivalent resistance of the \(m\times n\) cylindrical resistor network. Sci Rep 14, 21254 (2024). https://doi.org/10.1038/s41598-024-72196-3
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-024-72196-3