针对只有硬模块的布图规划问题,通常将其构建成组合优化模型,但求解过程时间成本高。为提高求解效率,提出了一种基于非光滑解析数学规划的布图规划算法。基于布图中器件的坐标表示,构建了一个泛化的非光滑解析数学规划模型,将不同场景...针对只有硬模块的布图规划问题,通常将其构建成组合优化模型,但求解过程时间成本高。为提高求解效率,提出了一种基于非光滑解析数学规划的布图规划算法。基于布图中器件的坐标表示,构建了一个泛化的非光滑解析数学规划模型,将不同场景下的布图规划问题的不同优化阶段处理为该泛化模型的特例,并利用共轭次梯度算法(conjugate sub-gradient algorithm,CSA)对其进行求解。针对固定轮廓布图规划问题,通过统一框架下的全局布图规划、合法化、局部优化三个阶段,实现了在固定轮廓约束下的线长优化。针对无固定轮廓约束问题,提出了带黄金分割策略的共轭次梯度算法(conjugate sub-gradient algorithm with golden section strategy,CSA_GSS),利用黄金分割策略缩小固定轮廓的面积,达到面积和线长双优化的效果。实验在GSRC测试电路上与基于B*-树表示的布图规划算法进行比较,该算法对于大规模电路在线长和时间方面均占据优势。实验结果表明,该算法能以更低的时间复杂度获得更优的线长。展开更多
Control allocation considers the problem of controlling instruction distribution for control systems with multiple and redundant actuators. This paper focuses on the direct allocation method, making the time requireme...Control allocation considers the problem of controlling instruction distribution for control systems with multiple and redundant actuators. This paper focuses on the direct allocation method, making the time requirement of the algorithm analogous compared with modified pseudoinverse redistribution methods, linear programming methods solved by simplex method, and sub-gradient optimization method. To reduce off-line computations of constructing the attainable moment set of actuators, a new approach based on the null space of the control effectiveness matrix is proposed, which is superior when the number of actuators is less than 10 compared with traditional method. To decrease on-line computations, an improvement method of searching the facet that is aligned with the desired moment is presented, shortening the search time by checking only the facets that lie around the desired moment. To find such facets, the vertices of the attainable moment set are normalized and saved during off-line computations. Simulation results show that at least 32.22% of off-line computation time would be saved using null space-based construction when the number of actuators is less than 10. In on-line computations, the modified method performs superiorly compared with the three aforementioned methods. Furthermore, it may solve the problem of control allocation efficiently when a remarkable large number of redundant actuators are configured.展开更多
针对无线多跳网络承载多媒体服务所面临的可扩展性、能量有效性和服务质量保证的挑战,研究了多个可伸缩编码(scalable video coding,SVC)视频流在无线多跳网络中传输的分布式跨层优化问题.在分析网络资源分配约束和SVC视频内容自适应模...针对无线多跳网络承载多媒体服务所面临的可扩展性、能量有效性和服务质量保证的挑战,研究了多个可伸缩编码(scalable video coding,SVC)视频流在无线多跳网络中传输的分布式跨层优化问题.在分析网络资源分配约束和SVC视频内容自适应模型的基础上,把SVC视频的传输问题表达为一个视频质量和网络功率消耗的跨层权衡优化问题.基于对偶问题的可分解性和次梯度求解方法,提出了一个可分布式实现的SVC视频优化传输算法.该分布式算法避免了控制开销的全网传播,通过节点的局部信息交换和独立解决相应子问题,达到底层资源分配和上层SVC视频传输内容选择的最优匹配.仿真结果表明该算法可以快速收敛到最优解,并能实现SVC视频的平均传输质量和网络总功率消耗的最优权衡.展开更多
文摘针对只有硬模块的布图规划问题,通常将其构建成组合优化模型,但求解过程时间成本高。为提高求解效率,提出了一种基于非光滑解析数学规划的布图规划算法。基于布图中器件的坐标表示,构建了一个泛化的非光滑解析数学规划模型,将不同场景下的布图规划问题的不同优化阶段处理为该泛化模型的特例,并利用共轭次梯度算法(conjugate sub-gradient algorithm,CSA)对其进行求解。针对固定轮廓布图规划问题,通过统一框架下的全局布图规划、合法化、局部优化三个阶段,实现了在固定轮廓约束下的线长优化。针对无固定轮廓约束问题,提出了带黄金分割策略的共轭次梯度算法(conjugate sub-gradient algorithm with golden section strategy,CSA_GSS),利用黄金分割策略缩小固定轮廓的面积,达到面积和线长双优化的效果。实验在GSRC测试电路上与基于B*-树表示的布图规划算法进行比较,该算法对于大规模电路在线长和时间方面均占据优势。实验结果表明,该算法能以更低的时间复杂度获得更优的线长。
基金National Natural Science Foundation of China （NSFC60704020） Changjiang Scholars and Innovative Research Team of China （PCSIRT0520） Research Fund for the Doctoral Program of Higher Education of China （20070213068）
文摘Control allocation considers the problem of controlling instruction distribution for control systems with multiple and redundant actuators. This paper focuses on the direct allocation method, making the time requirement of the algorithm analogous compared with modified pseudoinverse redistribution methods, linear programming methods solved by simplex method, and sub-gradient optimization method. To reduce off-line computations of constructing the attainable moment set of actuators, a new approach based on the null space of the control effectiveness matrix is proposed, which is superior when the number of actuators is less than 10 compared with traditional method. To decrease on-line computations, an improvement method of searching the facet that is aligned with the desired moment is presented, shortening the search time by checking only the facets that lie around the desired moment. To find such facets, the vertices of the attainable moment set are normalized and saved during off-line computations. Simulation results show that at least 32.22% of off-line computation time would be saved using null space-based construction when the number of actuators is less than 10. In on-line computations, the modified method performs superiorly compared with the three aforementioned methods. Furthermore, it may solve the problem of control allocation efficiently when a remarkable large number of redundant actuators are configured.
文摘针对无线多跳网络承载多媒体服务所面临的可扩展性、能量有效性和服务质量保证的挑战,研究了多个可伸缩编码(scalable video coding,SVC)视频流在无线多跳网络中传输的分布式跨层优化问题.在分析网络资源分配约束和SVC视频内容自适应模型的基础上,把SVC视频的传输问题表达为一个视频质量和网络功率消耗的跨层权衡优化问题.基于对偶问题的可分解性和次梯度求解方法,提出了一个可分布式实现的SVC视频优化传输算法.该分布式算法避免了控制开销的全网传播,通过节点的局部信息交换和独立解决相应子问题,达到底层资源分配和上层SVC视频传输内容选择的最优匹配.仿真结果表明该算法可以快速收敛到最优解,并能实现SVC视频的平均传输质量和网络总功率消耗的最优权衡.
