混沌粒子群寻优算法和各种常见的混沌吸引子程序,适合新手学习。。。。。。
2022-11-06 20:41:51 3KB 粒子群寻优 混沌粒子群 混沌
1
解析双点双向重分发中的次优路径和环路问题.doc
2022-08-19 19:04:10 646KB 双点双向 重分发
1
解决双点双向重分发次优问题和环路问题的方法.doc
2022-05-05 10:03:34 585KB 双点双向重分发 次优问题 环路问题
1
动力学控制课程的作业,自己搭的模型,一个三自由度楼房仿真模型,分别用最优控制和独立模态控制,包含作业文档和simulink模型
1
用于计算系统状态的卡尔曼最优增益和最小均方误差 (MMSE) 估计的代码。 一阶和二阶模型的示例。 可轻松适应其他系统和输入,非常适合学习应用。
2021-12-02 22:03:56 3KB matlab
1
Given symmetric matrices B,D ∈ R n×n and a symmetric positive definite matrix W ∈ R n×n , maximizingthe sum of the Rayleighquotientx ? Dx andthe gener- alized Rayleigh quotient x ? Bx x ? Wx on the unit sphere not only is of mathematical interest in its own right, but also finds applications in practice. In this paper, we first present a real world application arising from the sparse Fisher discriminant analysis. To tackle this problem, our first effort is to characterize the local and global maxima by investi- gating the optimality conditions. Our results reveal that finding the global solution is closely related with a special extreme nonlinear eigenvalue problem, and in the spe- cial case D = μW (μ > 0), the set of the global solutions is essentially an eigenspace corresponding to the largest eigenvalue of a specially-defined matrix. The characteri- zation of the global solution not only sheds some lights on the maximization problem, but motives a starting point strategy to obtain the global maximizer for any monoton- ically convergent iteration. Our second part then realizes the Riemannian trust-region method of Absil, Baker and Gallivan (Found. Comput. Math. 7:303–330, 2007) into a practical algorithm to solve this problem, which enjoys the nice convergence prop- erties: global convergence and local superlinear convergence. Preliminary numerical tests are carried out and empirical evaluation of its performance is reported.
2021-11-11 11:27:29 2.91MB 广义瑞利商
1
matlab写脑式算法代码作为迷宫求解器实现的 A* 搜索算法 该代码使用 A* 算法来解决输入迷宫,搜索其解决方案路径并直观地表示它。 该搜索算法对目标执行完整的、可接受的和最佳搜索。 这段代码中的 A* 是用 MATLAB 编写的,是作为函数实现的。 注意:使用的启发式函数只是到目标的欧几里德距离,知道它的位置。 函数输入:Square Matrix,代表迷宫,'1' 墙,'0' 空闲位置,'3' 起点,'9' 目标点。 示例:迷宫 = [1 1 1 1 1 1 1 1 1 1 1 1 1 1 1; 1 0 0 0 0 0 0 0 1 0 0 0 0 0 1; 1 0 1 1 1 1 1 0 1 0 1 1 1 0 1; 1 0 1 0 0 0 0 0 1 0 1 0 1 0 1; 3 0 1 0 1 1 1 1 1 0 1 0 1 0 1; 1 0 1 0 0 0 0 0 0 0 0 0 1 0 1; 1 0 1 0 1 1 1 1 1 1 1 0 1 0 1; 1 0 1 0 0 0 0 0 1 0 0 0 1 0 1; 1 0 1 0 1 0 1 0 1 1 1 1 1 0
2021-10-29 18:17:51 90KB 系统开源
1
最优滤波和最优状态估计的两份资料
2021-07-12 17:37:33 60.16MB 资料
1
选择得到最优的c和g的matlab函数,查看网上此资源很多没有,我就免费分享给大家,参数使用说明可以参考 https://www.ilovematlab.cn/thread-47819-1-1.html,不知道如何让其免费上传呀??
2021-04-22 14:27:54 3KB SVMcgForClass 最优c和g SVM
1
使用遗传算法PID整定寻优 代码和仿真
2021-01-01 10:29:14 53KB 遗传算法 PID
1