ON A CLASS OF STOCHASTIC IMPULSIVE OPTIMAL PARAMETER SELECTION PROBLEMS

被引:0
|
作者
Liu, Chun Min [1 ]
Feng, Zhi Guo [2 ]
Teo, Kok Lay [1 ]
机构
[1] Curtin Univ Technol, Dept Math & Stat, Perth, WA 6845, Australia
[2] Chongqing Normal Univ, Coll Math & Comp Sci, Chongqing 400047, Peoples R China
基金
澳大利亚研究理事会; 中国国家自然科学基金;
关键词
Stochastic impulsive optimal parameter selection problem; Deterministic impulsive optimal parameter selection problem; Probabilistic constraints; Time scaling transformation; Constraint transcription technique; Canonical inequality constraints; Gradient based optimization technique; JACOBI-BELLMAN EQUATIONS; OPTIMIZATION PROBLEMS; DISCRETE-TIME; SYSTEMS; CONSTRAINTS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
:This paper considers a class of stochastic optimal parameter selection problems described by linear Ito stochastic differential equations with state jumps subject to probabilistic constraints on the state, where the times at which the jumps occurred as well as their heights are decision variables. We show that this constrained stochastic impulsive optimal parameter selection problem is equivalent to a deterministic impulsive optimal parameter selection problem subject to continuous state inequality constraints, where the times at which the jumps occurred as well as their heights remain as decision variables. Then, by introducing a time scaling transform, we show that this constrained deterministic impulsive optimal parameter selection problem is transformed into an equivalent constrained deterministic impulsive optimal parameter selection problem with fixed jump times. A constraint, transcription technique is then used to approximate the continuous state. inequality constraints by a sequence of canonical inequality constraints. This leads to a sequence of approximate deterministic impulsive optimal parameter selection problems subject to canonical inequality constraints. For each of these approximate problems, we derive the gradient formulas of the cost function and the constraint functions. On this basis, an efficient computational method is developed.
引用
收藏
页码:1043 / 1054
页数:12
相关论文
共 50 条