检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学技术大学精密机械与精密仪器系,安徽合肥230027
出 处:《计算机仿真》2008年第12期220-223,共4页Computer Simulation
基 金:LAMOST项目(大天区面积多目标光纤光谱望远镜)国家九五大科学工程资助项目(98BJG001)
摘 要:在大天区多目标光纤光谱天文望远镜LAMOST系统中,为了快速获得高效率的观测规划,根据天文统计数据和工程设计状况,利用网络优化的最大流算法,构造了固有观测范围内多轮任务分配的数学模型,基于VC实现和优化了该算法模型,并对观测完备率、光纤利用率、时间复杂性、计算资源需求等方面进行全面分析。实验结果表明,算法模型,符合LAM-OST的基本观测要求,能够高速有效地实现一个焦面板上4000个观测单元对相应星象数目的观测分配。问题的解决,同时对未来解决大天区观测范围内复杂条件下的超大规模观测任务分配问题提供了重大参考。In LAMOST project, in order to achieve an efficient observation plan in a short time, taking advantage of Max Flow Algorithm, one of the Network Optimization Algorithms, a mathematical model of multi - turn detection task assignment in a certain observation range is estabhshed, according to astronomic statistic and current engineering design data. By VC programming, the paper realizes and optimizes the model, and gains a complete analysis of the observation completion rate, the fibre - utilization rate, the time complexity and resource requirement of the algorithm. The outcome of experiment shows that, the method for task planning can achieve a highly - efficient plan for a single focal plate with 4000 observing units and 16000 target stars timely and meet the basic requirements of the project. The in - depth research of this method is also of great help to the future research of seeking a solution for detection task assignment in complex and huge observation range.
分 类 号:TN955[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145