检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:白剑[1] 高惠荔[1] 谷小松[1] 杨慧影[1]
机构地区:[1]西安卫星测控中心,西安710043
出 处:《飞行器测控学报》2017年第1期25-30,共6页Journal of Spacecraft TT&C Technology
摘 要:对于航天器测控资源分配这一类时间窗受限的约束满足问题,国内外已有许多应用遗传算法的研究并取得了较好的成果。目前的研究主要针对的是低轨道航天器这类可见弧段较短、全弧段跟踪的问题,对于地球同步以及高轨道航天器这一类长弧段可见、非全弧段跟踪的资源分配问题,相关的应用研究较少。针对高低轨航天器测控资源统一分配问题的特点,经过对标准遗传算法的扩展,设计了一种能够描述高、低轨道航天器资源分配问题的多维编码方法,定义了相应的交叉算子、变异算子等算法要素,从而建立了一种能够解决航天测控资源统一分配问题的多维遗传算法。仿真计算表明,该算法能够有效解决目前我国航天测控网面临的"一网多星"管理模式下,高低轨航天器统一管理、统一分配测控资源的问题。Alot of research at home and abroad used genetic algorithm on the problem of space Tracking , Telemetry and Command (TT&C) resource scheduling, which is a kind of time window limited constraint satisfaction problem, and good effects are acHeved. But most proiects focused on bw E虹th Orbit (LEO) spacecraft wMch has a short visible pass and the total pass is tracked usually, without considering High Earth Orbit (HEO), which has long visible pass and usually only part of it is tracked. Aiming at the characteristics of spacecraft TT&C resources unified allocation for HEO and LEO spacecraft, a multi-dimension genetic encoding method is promoted to describe this problem* The corresponding elements of the algorithm including crossover operator and mutation operator are defined as well so that a multi-dimension genetic al-gorithm is built to solve the resources allocation problem. Simulation results show that this algorithm effectively solves the problem of TT&C resources management and unified allocation for LEO and HEO spacecraft, as required by the current domestic managing mode of “one net for multi-spacecraft” ,
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147