布图规划和布局是集成电路片上系统物理设计的基本问题之一。总结了作者提出的几个新的布图规划和布局优化算法及其特点。基于随机优化算法 ,提出了角模块序列表示方法和基于这一表示方法的包含各种布图约束的布图规划和布局算法。提出的基于约束图的布图规划表示 ,为研究序列队 (SP)、变形网格 (BSG)、有序树 (O- tree)等表示之间的关系奠定了理论基础。基于“最小自由度优先原则”,提出了迄今最快的确定性布图规划与布局算法。提出了基于解空间平滑的布图规划和布局算法。该算法与基于模拟退火的算法相比性能更加健壮稳定。在解空间平滑中首次考虑了局部平滑效应 ,这是对解空间平滑方法从原理上的重要改进 Layout planning and layout is one of the basic issues in the design of system-on-chip systems for integrated circuits. The author summarizes several new layout planning and layout optimization algorithms and their features. Based on the stochastic optimization algorithm, the angular module sequence representation method and the layout planning and layout algorithm based on this representation method are proposed. The proposed layout plan based on the constraint graph provides a theoretical basis for the study of the relationship between SP, deformation grid (BSG) and ordered tree (O-tree). Based on the “principle of least degree of freedom priority”, the quickest deterministic layout and layout algorithm to date has been proposed. A layout plan and layout algorithm based on solution space smoothing is proposed. Compared with the algorithm based on simulated annealing, the performance of the algorithm is more robust and stable. For the first time, the local smoothing effect is considered in the solution space smoothing, which is an important improvement on the principle of the solution space smoothing method