In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used t...In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.展开更多
针对现有二维波达方向(direction of arrival,DOA)估计方法对阵列接收信息利用不充分导致估计性能下降的问题,提出了一种平行互质阵列下对虚拟阵列插值的二维DOA估计方法。该方法通过对平行互质阵列扩展后的虚拟阵列进行插值,利用内插...针对现有二维波达方向(direction of arrival,DOA)估计方法对阵列接收信息利用不充分导致估计性能下降的问题,提出了一种平行互质阵列下对虚拟阵列插值的二维DOA估计方法。该方法通过对平行互质阵列扩展后的虚拟阵列进行插值,利用内插虚拟阵列的协方差矩阵与虚拟测量值之间的关系,提出一个关于等效虚拟测量向量的最小化问题,通过凸优化工具箱重构插值后的虚拟阵列协方差矩阵,结合酉变换和总体最小二乘方法进行DOA估计。仿真结果和湖上试验表明,该方法充分利用了非匀虚拟阵列中的所有虚拟阵元,提高了自由度和估计精度,具有有效性。展开更多
文摘In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.
文摘针对现有二维波达方向(direction of arrival,DOA)估计方法对阵列接收信息利用不充分导致估计性能下降的问题,提出了一种平行互质阵列下对虚拟阵列插值的二维DOA估计方法。该方法通过对平行互质阵列扩展后的虚拟阵列进行插值,利用内插虚拟阵列的协方差矩阵与虚拟测量值之间的关系,提出一个关于等效虚拟测量向量的最小化问题,通过凸优化工具箱重构插值后的虚拟阵列协方差矩阵,结合酉变换和总体最小二乘方法进行DOA估计。仿真结果和湖上试验表明,该方法充分利用了非匀虚拟阵列中的所有虚拟阵元,提高了自由度和估计精度,具有有效性。
