|
|
Frontiers of Information Technology & Electronic Engineering
ISSN 2095-9184 (print), ISSN 2095-9230 (online)
2025 Vol.26 No.6 P.946-958
An optimized formula for the two-point resistance of a cobweb resistance network and its potential application
Abstract: In recent years, the exploration and application of resistance networks have expanded significantly, and solving the equivalent resistance between two points of a resistance network has been an important topic. In this paper, we focus on optimizing the formula for calculating the two-point resistance of an m × n cobweb resistance network with 2r boundary conditions. To improve the computational efficiency of the equivalent resistance between two points, the formula is optimized by using the optimal approximation property of Chebyshev polynomials in combination with hyperbolic functions, and the derivation process is simplified. We discuss the equivalent resistance formulas in several special cases and compare the computational efficiency of the equivalent resistance formulas before and after optimization. Finally, we make an innovative attempt at path planning through potential formulas and propose a heuristic algorithm based on cobweb potential function for robot path planning in a cobweb environment with obstacles.
Key words: Resistance network; Equivalent resistance; Potential function; Chebyshev polynomials; Path planning
1临沂大学信息科学与工程学院,中国临沂市,276000
2临沂大学自动化与电气工程学院,中国临沂市,276000
2临沂大学数学与统计学院,中国临沂市,276000
摘要:近年来,电阻网络的探索和应用范围显著扩大,求解电阻网络两点间的等效电阻一直是一个重要课题。本文重点优化了具有2r边界条件的m×n蛛网电阻网络的两点电阻计算公式。为提高两点间等效电阻的计算效率,利用切比雪夫多项式的最优逼近特性,结合双曲函数对公式进行优化,并简化推导过程。讨论了几种特殊情况下的等效电阻公式,并比较了优化前后等效电阻公式的计算效率。最后,通过势公式进行路径规划的创新尝试,提出一种基于蛛网势函数的启发式算法,用于机器人在有障碍物的蛛网环境中的路径规划。
关键词组:
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
DOI:
10.1631/FITEE.2400613
CLC number:
TM13;O441.1
Download Full Text:
Downloaded:
2920
Download summary:
<Click Here>Downloaded:
603Clicked:
1513
Cited:
0
On-line Access:
2025-07-02
Received:
2024-07-21
Revision Accepted:
2025-07-02
Crosschecked:
2024-10-10