• Optimized the two-point resistance formula for m×n cobweb resistance networks using Chebyshev polynomials and hyperbolic functions, significantly improving computational efficiency.
• Simplified the derivation process while maintaining accuracy, making the method applicable to complex boundary conditions such as 2r boundaries.
• Demonstrated through comparative analysis that the optimized formula outperforms traditional methods in computational efficiency.
• Proposed a novel heuristic algorithm based on a cobweb potential function for robot path planning in obstacle-rich environments.