A novel discrete zeroing neural network for online solving time-varying nonlinear optimization problems

被引：2

作者：

Song, Feifan ^{[1
]}

Zhou, Yanpeng ^{[2
]}

Xu, Changxian ^{[3
]}

Sun, Zhongbo ^{[4
]}

机构：

[1] Changchun Finance Coll, Sch Finance, Changchun, Peoples R China

[2] VanJee Technol Co Ltd, Beijing, Peoples R China

[3] Changchun Univ Technol, Dept Mech & Elect Engn, Changchun, Peoples R China

[4] Changchun Univ Technol, Dept Control Engn, Changchun, Peoples R China

来源：

FRONTIERS IN NEUROROBOTICS | 2024年 / 18卷

基金：

中国国家自然科学基金;

关键词：

path planning; discrete zeroing neural network; time-varying nonlinear optimization problem; 0-stability; real-time capability; ALGORITHM; ROBOTS;

D O I：

10.3389/fnbot.2024.1446508

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

To reduce transportation time, a discrete zeroing neural network (DZNN) method is proposed to solve the shortest path planning problem with a single starting point and a single target point. The shortest path planning problem is reformulated as an optimization problem, and a discrete nonlinear function related to the energy function is established so that the lowest-energy state corresponds to the optimal path solution. Theoretical analyzes demonstrate that the discrete ZNN model (DZNNM) exhibits zero stability, effectiveness, and real-time performance in handling time-varying nonlinear optimization problems (TVNOPs). Simulations with various parameters confirm the efficiency and real-time performance of the developed DZNNM for TVNOPs, indicating its suitability and superiority for solving the shortest path planning problem in real time.

引用

页数：9

共 39 条

[1] A neural network for shortest path computation [J].

Araújo, F ;

Ribeiro, B ;

Rodrigues, L .

IEEE TRANSACTIONS ON NEURAL NETWORKS, 2001, 12 (05) :1067-1073

[2] An evaluation of cross-efficiency methods: With an application to warehouse performance [J].

Balk, Bert M. ;

De Koster, M. B. M. ;

Kaps, Christian ;

Zofio, Jose L. .

APPLIED MATHEMATICS AND COMPUTATION, 2021, 406

[3] A point symmetry-based clustering technique for automatic evolution of clusters [J].

Bandyopadhyay, Sanghamitra ;

Saha, Sriparna .

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2008, 20 (11) :1441-1457

[4] A Generalized Voronoi Diagram-Based Efficient Heuristic Path Planning Method for RRTs in Mobile Robots [J].

Chi, Wenzheng ;

Ding, Zhiyu ;

Wang, Jiankun ;

Chen, Guodong ;

Sun, Lining .

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2022, 69 (05) :4926-4937

[5] A review of metaheuristics in robotics [J].

Fong, Simon ;

Deb, Suash ;

Chaudhary, Ankit .

COMPUTERS & ELECTRICAL ENGINEERING, 2015, 43 :278-291

[6] An improved A* algorithm for the industrial robot path planning with high success rate and short length [J].

Fu, Bing ;

Chen, Lin ;

Zhou, Yuntao ;

Zheng, Dong ;

Wei, Zhiqi ;

Dai, Jun ;

Pan, Haihong .

ROBOTICS AND AUTONOMOUS SYSTEMS, 2018, 106 :26-37

[7] A Review of Motion Planning Techniques for Automated Vehicles [J].

Gonzalez, David ;

Perez, Joshue ;

Milanes, Vicente ;

Nashashibi, Fawzi .

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2016, 17 (04) :1135-1145

[8] Novel Discrete-Time Zhang Neural Network for Time-Varying Matrix Inversion [J].

Guo, Dongsheng ;

Nie, Zhuoyun ;

Yan, Laicheng .

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2017, 47 (08) :2301-2310

[9] Zhang neural network, Getz-Marsden dynamic system, and discrete-time algorithms for time-varying matrix inversion with application to robots' kinematic control [J].

Guo, Dongsheng ;

Zhang, Yunong .

NEUROCOMPUTING, 2012, 97 :22-32

[10]

HOPFIELD JJ, 1985, BIOL CYBERN, V52, P141

← 1 2 3 4 →