An optimized potential formula of the $ m \times n $ apple surface network and its application of potential in path planning
An optimized potential formula for the $ m \times n $ apple surface network has been introduced in this paper. Compared with the original potential formula, this method significantly enhances the efficiency required for rapid and large-scale numerical simulations. Based on the optimized potential fu...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2025-03-01
|
| Series: | Electronic Research Archive |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/era.2025083 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850151351087005696 |
|---|---|
| author | Yangming Xu Yanpeng Zheng Xiaoyu Jiang Zhaolin Jiang Zhibin Liu |
| author_facet | Yangming Xu Yanpeng Zheng Xiaoyu Jiang Zhaolin Jiang Zhibin Liu |
| author_sort | Yangming Xu |
| collection | DOAJ |
| description | An optimized potential formula for the $ m \times n $ apple surface network has been introduced in this paper. Compared with the original potential formula, this method significantly enhances the efficiency required for rapid and large-scale numerical simulations. Based on the optimized potential function, we proposed a metaheuristic algorithm suitable for apple surface environment path planning. Chebyshev polynomials of the first class were employed to represent the potential function. Subsequently, a fast algorithm for calculating the potential utilizing the first kind of discrete sine transform (DST-I) was devised. We proposed potential formulas for several cases to visually present the distribution of the potential and illustrated them using three-dimensional graphs. We also conducted simulation experiments on the computational efficiency of the original and optimized formulas at different data scales, verifying the superiority of the optimized formulas. These findings provided new perspectives and tools for the computation of resistor networks and the design of path planning algorithms. Experiments were conducted to analyze the efficiency and availability of various techniques for computing potential. |
| format | Article |
| id | doaj-art-06ef95b297eb4b5a8db163e3bcecb360 |
| institution | OA Journals |
| issn | 2688-1594 |
| language | English |
| publishDate | 2025-03-01 |
| publisher | AIMS Press |
| record_format | Article |
| series | Electronic Research Archive |
| spelling | doaj-art-06ef95b297eb4b5a8db163e3bcecb3602025-08-20T02:26:19ZengAIMS PressElectronic Research Archive2688-15942025-03-013331836185710.3934/era.2025083An optimized potential formula of the $ m \times n $ apple surface network and its application of potential in path planningYangming Xu0Yanpeng Zheng1Xiaoyu Jiang2Zhaolin Jiang3Zhibin Liu4School of Automation and Electrical Engineering, Linyi University, Linyi 276000, ChinaSchool of Automation and Electrical Engineering, Linyi University, Linyi 276000, ChinaSchool of Information Science and Engineering, Linyi University, Linyi 276000, ChinaSchool of Mathematics and Statistics, Linyi University, Linyi 276000, ChinaSchool of Automation and Electrical Engineering, Linyi University, Linyi 276000, ChinaAn optimized potential formula for the $ m \times n $ apple surface network has been introduced in this paper. Compared with the original potential formula, this method significantly enhances the efficiency required for rapid and large-scale numerical simulations. Based on the optimized potential function, we proposed a metaheuristic algorithm suitable for apple surface environment path planning. Chebyshev polynomials of the first class were employed to represent the potential function. Subsequently, a fast algorithm for calculating the potential utilizing the first kind of discrete sine transform (DST-I) was devised. We proposed potential formulas for several cases to visually present the distribution of the potential and illustrated them using three-dimensional graphs. We also conducted simulation experiments on the computational efficiency of the original and optimized formulas at different data scales, verifying the superiority of the optimized formulas. These findings provided new perspectives and tools for the computation of resistor networks and the design of path planning algorithms. Experiments were conducted to analyze the efficiency and availability of various techniques for computing potential.https://www.aimspress.com/article/doi/10.3934/era.2025083resistor networkpotentialpath planningtridiagonal matrices |
| spellingShingle | Yangming Xu Yanpeng Zheng Xiaoyu Jiang Zhaolin Jiang Zhibin Liu An optimized potential formula of the $ m \times n $ apple surface network and its application of potential in path planning Electronic Research Archive resistor network potential path planning tridiagonal matrices |
| title | An optimized potential formula of the $ m \times n $ apple surface network and its application of potential in path planning |
| title_full | An optimized potential formula of the $ m \times n $ apple surface network and its application of potential in path planning |
| title_fullStr | An optimized potential formula of the $ m \times n $ apple surface network and its application of potential in path planning |
| title_full_unstemmed | An optimized potential formula of the $ m \times n $ apple surface network and its application of potential in path planning |
| title_short | An optimized potential formula of the $ m \times n $ apple surface network and its application of potential in path planning |
| title_sort | optimized potential formula of the m times n apple surface network and its application of potential in path planning |
| topic | resistor network potential path planning tridiagonal matrices |
| url | https://www.aimspress.com/article/doi/10.3934/era.2025083 |
| work_keys_str_mv | AT yangmingxu anoptimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning AT yanpengzheng anoptimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning AT xiaoyujiang anoptimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning AT zhaolinjiang anoptimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning AT zhibinliu anoptimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning AT yangmingxu optimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning AT yanpengzheng optimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning AT xiaoyujiang optimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning AT zhaolinjiang optimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning AT zhibinliu optimizedpotentialformulaofthemtimesnapplesurfacenetworkanditsapplicationofpotentialinpathplanning |