本文研究拓扑遍历映射。
Weakly ergodic is a new ergodic conception on compact system.弱遍历是在紧致系统上的一种新的遍历概念。
And at high SNR, the upper and lower bounds on the ergodic capacity are close to its true value.接收信噪比较大时，平均信道容量上下限基本接近其实际值。
Due to chaotic ergodicity, TSP can always achieve optimal path.由于混沌具有遍历性，TSP问题总是能够达到最优解。
Secondly, we give an ergodicity algorithm to unknown environment as tree structure.其次，本文提出了基于树结构的未知环境遍历算法。
Chaotic signal has the properties of ergodicity, nonperiodicity, continuous broadband power spectra, and noise like etc.混沌信号具有遍历性、非周期、连续宽带频谱、似噪声的特性。
