会议专题

An Adaptive Domain Decomposition Method for the Hamilton-Jacobi-Bellman Equation

  In this paper, we propose an efficient algorithm for Hamilton-Jacobi-Bellman (HJB) equations governing a class of optimal feedback control problems. This algorithm is based on a non-overlapping domain decomposition method and an adaptive least-squares collocation radial basis function discretization with a novel matrix inversion technique. To demonstrate the accuracy and the effectiveness of this method, numerical experiments on test problems with up to three states and two control variables have been performed. The numerical results show that the proposed algorithm is a scalable parallel one and the computational costs decrease exponentially as the number of subdomains increases.

HJB equation optimal feedback control least-squares collocation method radial basis functions shape parameter adaptive method domain decomposition parallel computations

H.Alwardi S.Wang L.S.Jennings

Department of Mathematics, Nizwa College of Applied Sciences,P O Box 699, PC 611 Nizwa, Sultanate of School of Mathematics & Statistics, The University of Western Australia,35 Stirling Hwy, Crawley 600

国际会议

第8届国际最优化方法及应用大会

上海

英文

164-165

2010-12-10(万方平台首次上网日期,不代表论文的发表时间)