pathPlanning

主成分分析的代码，数据处理的必备，方便实用！！(Principal component analysis of the code, the data processing required, convenient and practical! !)

用牛顿法解决非线性规划问题，解决问题所需时间少，能提高效率，但须具有二阶导数(Newton' s method to solve nonlinear programming problems, less time, and can improve the efficiency needed to solve the problem, but must have a second derivative)

Traditional police boundaries—precincts, patrol districts, etc.—often fail to reflect the true distribution of criminal activity and thus do little to assist in the optimal allocation of police resources. This paper introduces methods for crime incident forecasting by focusing upon geographical areas of concern that transcend traditional policing boundaries.

1 chaos_draw_GCM.m 基于最大标准差绘制的大域耦合相图（GCM）；2 chaos_GCM.m 特定参数下的大域耦合状态变量的值的时域及频域图； 3 chaos_simple.m 混沌对初始条件敏感的实验； 4 ICAS.m ICAS系统的评价数据处理； 5 julia.m 朱莉娅集的绘制； 6 logistic.m 逻辑斯蒂克集的稳定点关于参数u的分布(1 chaos_draw_GCM.m drawn based on the maximum standard deviation of the big field coupling phase diagram (GCM) big field coupling state variable 2 chaos_GCM.m special parameter values ​ ​ in the time domain and frequency domain 3 chaos_simple.m Chaos sensitive to initial conditions experimental evaluation data processing 4 ICAS.m ICAS system draw 5 julia.m Julia sets stable point 6 logistic.m logic Si Dike set of parameter distributions u)

FastICA 快速独立成分分析 源码、实例(IndependentComponentAnalysis )

matlab依据椭球的高斯投影公式，将某一个点的经纬度坐标转化为横纵坐标的计算公式的m文件。输入形式为n*2的矩阵即可。(matlab based on the Gaussian ellipsoid projection formula, the latitude and longitude coordinates of a point into a vertical and horizontal coordinates of the formula m-file.)

说明：  该函数用来计算时间序列的最大Lyapunov 指数--Wolf 方法(The function used to calculate the time series of the largest Lyapunov index- Wolf method)

不同蜂窝系统，不同移动台速率的情况下 信道保持时间，驻留时间，切换概率仿真计算(The simulation for multi size cell and multi speed MS s Channel hold time and stay time and the probability of handover)

奇异值分解及欧式距离计算，两组数据之间的计算(singular and calculate distense)

说明：  详细给出floyd、dijkstra算法，并给出具体例子以及如何看运行结果。所有程序均通过真实测试。(Details are given floyd, dijkstra algorithm, and gives specific examples and how to look at the results. Through all the procedures are the real test.)