A Fast Single-Pass Method for Solving Min-Time Non-Autonomous Anisotropic Control Problems

被引:0
作者
Ho, M. S. [1 ]
Pak, J. S. [1 ]
机构
[1] Kim Il Sung Univ, Dept Math, Pyongyang, North Korea
关键词
ordered upwind method; non-autonomous anisotropic time-optimal control problem; neighbor-gradient single-pass method; HAMILTON-JACOBI EQUATIONS; ORDERED UPWIND METHODS; FAST SWEEPING METHODS; ALGORITHMS;
D O I
10.1134/S0965542524701884
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We develop a fast method for solving non-autonomous anisotropic time-optimal control problem. The ordered upwind method (OUM) developed for the autonomous anisotropic time-optimal control problem can be extended to this non-autonomous case. OUM uses the search along the accepted front (SAAF) to update the value at considered nodes. Unfortunately, SAAF does significantly increase the computational cost in practice. To overcome this difficulty, neighbor-gradient single-pass method (NGSPM) without using SAAF is proposed for the autonomous control problem. Unfortunately, there are several difficulties in extending the NGSPM to the non-autonomous case. We propose a fast single-pass method for solving min-time non-autonomous anisotropic control problems by overcoming the difficulties of extending the NGSPM to the non-autonomous case. We show that our method is faster and more accurate than OUM via several numerical examples.
引用
收藏
页码:35 / 48
页数:14
相关论文
共 24 条