检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科学技术大学信息系统与管理学院,湖南长沙410073
出 处:《系统工程学报》2009年第4期445-450,共6页Journal of Systems Engineering
基 金:国防科技大学武器装备预研基金项目(51421070304KG01)
摘 要:面向未来分布式卫星系统(DSS)自主协作运行模式,对DSS任务优化分配问题进行了分析和建模.在此基础上给出任务组的概念,并利用集覆盖理论将任务分配问题转化为集覆盖问题.从而引入MAS理论中的合同网协议,以系统完成任务目标的总耗能最少为原则,加入限定卫星可回应子任务数的约束后,提出了一种基于合同网的严格启发式的优化算法对分配模型进行求解.同时,证明了算法搜索结果的上确界;分析了算法的收敛性和时间复杂度.该算法具有分布性,搜索空间缩减快,适合于中小规模的任务分配.Considering the characteristics of autonomous cooperative operation for distributed satellites system (DSS) in future, a task optimal allocation model for DSS was put forward by analyzing the problem of task allocation for DSS. Based on it, the concept of task coalition was defined and the task allocation was described as a set-covering problem by using set-covering theory. Consequently, on the principle of lowest general energy-consumption for completing task, a strict heuristic algorithm for task allocation was proposed, which conformed to the contract net protocol and limited the number of bidding sub-tasks. At the same time, the convergence of the algorithm were proved, and the asymptotic time complexity was analyzed. At last, a simple example was give. With the property of the distributed calculation and quick reduction of the search space, the algorithm is suitable for task distributed problem solving for small and middle scale problem of task allocation.
分 类 号:TP399[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43