A neural network algorithm for superstructure quadrilateral dynamic resistor networks on hammock surfaces with application to artificial intelligence
Yanpeng ZHENG , Guijie ZHANG , Xiaoyu JIANG , Zhaolin JIANG , Sung-Kwun OH
Eng Inform Technol Electron Eng ›› 2026, Vol. 27 ›› Issue (6) : 260055
This study proposes a fast zeroing neural network algorithm to solve time-varying Laplacian linear systems arising from the modeling of superstructure quadrilateral dynamic resistor networks on hammock surfaces. By incorporating the intrinsic structure of the underlying special-form matrices into the core neurodynamic design, the proposed algorithm enables efficient real-time computation of electric potentials under dynamic conditions. The Lyapunov-based analysis proves global exponential convergence. Numerical simulations on resistor networks of various scales demonstrate high computational efficiency and verify convergence to solutions from arbitrary initial conditions. Furthermore, by integrating the proposed algorithm as a potential field solver with a directional potential field path planning algorithm and exploiting the natural descent property of resistor network node potentials, we propose a fast path planning algorithm for robotic navigation on hammock surfaces. Compared with conventional path planning approaches, the proposed algorithm achieves higher computational efficiency in the aforementioned hammock surface path planning task, and this advantage becomes increasingly pronounced as the scale increases. The proposed algorithm is also applied to dynamic path planning tasks, further validating its potential in robotics and control applications. Finally, we present two conjectures.
Zeroing neural network / Resistor network / Laplacian system / Equivalent resistance / Potential / Path planning
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
| [47] |
|
| [48] |
|
| [49] |
|
| [50] |
|
| [51] |
|
| [52] |
|
| [53] |
|
| [54] |
|
| [55] |
|
| [56] |
|
| [57] |
|
| [58] |
|
| [59] |
|
| [60] |
|
| [61] |
|
| [62] |
|
The Authors. Published by Zhejiang University Press Co., Ltd.
/
| 〈 |
|
〉 |