基于优先策略的动态选星算法  

Dynamic-Object-Selection-Algorithm Based on Priority-Policy

作　　者：郝黎凯[1] 金革[1] 王坚[1] 任间[1] 李锋[1] 万长胜[1] 李昔华[1] 黄鲲[1] 

机构地区：[1]中国科学技术大学近代物理系,合肥230026

出　　处：《天文学报》2005年第2期225-236,共12页Acta Astronomica Sinica

摘　　要：论述了LAMOST巡天观测战略系统(SSS)中观测策略的实现方法-选星算法问题.以国外SDSS望远镜为例介绍了静态选星算法,分析了其不足之处,并结合LAMOST望远镜的特点,提出了一种新的选星算法- “动态选星”算法.动态选星算法基于优先策略原理,可以在满足覆盖完备性的基础上,优化观测效率,并能方便地兼顾观测条件的约束.给出了算法的原理和框架描述,并针对算法进行了模拟计算,证明了算法的有效性.另外需要指出的是动态选星算法不仅适用于LAMOST,它可以普遍地应用于多目标光纤望远镜的巡天选星.Object-Selection-Algorithm(OSA)is the implementation of observation policy which is a key point of LAMOST Sky-scan Strategy System(SSS). Tiling-Completion and Observation-Efficiency are two key point of OSA. The OSA used by SDSS is called static OSA which can't be applied for LAMOST for its shortage. A new OSA is brought forward is called dynamic OSA which is based on Priority-Policy and is not only suitable for LAMOST but Common multi-object fiber telescope.

关 键 词：LAMOST巡天观测战略系统 动态选星算法 望远镜 静态选星算法 优先策略原理 

分 类 号：P111.2[天文地球—天文学]