基于协同多目标算法的多机器人路径规划

多机器人路径规划是群体机器人协同工作的前提,其特点是在防碰撞与避障的前提下追求多方面资源的最小消耗.针对这一特点,提出协同非支配排序遗传算法,解决具有多个优化目标的多机器人路径规划问题;运用改进的多目标优化算法,克服多目标优化取权值的不足,同时考虑机器人能源与时间两大资源,以多机器人的路径总长度、总平滑度、总耗时为规划目标.同时引入合作型协同算法框架,将难以求解的多变量问题分组求解.每个机器人的路径视为子种群,子种群通过带精英策略的非支配排序遗传算法,进化并筛选出子种群的部分进入协同进化,每次迭代更新外部的精英解集,最终生成一组非支配路径解.仿真结果表明,在栅格地图环境下,本文算法可有效实现多移动机器人的多优化目标路径规划.     

星地一体成像侦察任务规划组合求解方法

成像侦察任务流的航天资源任务规划问题是将有限的航天资源分配给需要侦察的不同目标,最大化满足任务需求.采取了星地一体任务规划思路进行问题建模与求解.提出星地一体虚拟资源聚合模型和算法,并在此基础上,给出了星地一体的虚拟资源冲突检测与消解方法,提出了星地一体任务规划模型的模型分解与组合求解方法,针对分解后的主问题模型给出了一种适应可变冲突约束的遗传算法;针对子问题模型给出了一种基于时间序列排序的任务调度方法,并对上述两种算法进行了设计与实现;最后,结合试验案例进行验证.     

基于改进PSRS的并行0-1规划算法

结合0-1整数规划的隐式枚举法对目标排序法进行分析.引入PSRS(并行正则采样排序)算法对目标排序法的核心运算进行并行化,并改进PSRS算法的数据收集策略以适应0-1整数规划的并行隐式枚举.最后给出了基于改进的PSRS的并行0-1整数规划的求解算法,并对算法的时间复杂度进行了分析.     

基于满意度的区间型多目标合作对策求解模型

针对效用函数可能具有嵌套、重叠和(或)包含关系的区间型多目标合作对策求解问题,提出两阶段非线性规划模型和方法.考虑实际决策问题中的多目标因素,定义基于满意度的区间数排序关系及区间型多目标合作对策的区间值核心解概念,进而构建多目标两阶段非线性规划求解模型,并给出二分法的求解步骤.最后,通过实例说明所提出模型和方法的可行性和适用性.     

混流装配线负荷平衡与投产排序的优化研究

介绍了混流装配线的最新进展情况 ,阐述了混流装配线负荷平衡和投产排序问题之间的关系 .说明了混流装配线负荷平衡的分类、目标函数及求解方法 ;建立了排序问题的模型 ,分析了三种常用的排序目标函数和各种求解算法 .本文指出了混流装配线应进一步研究的问题及未来的发展方向 .     

基于概率可信度的区间数排序方法

针对多属性决策理论的研究需要,提出一种基于概率可信度的区间数排序方法,给出了区间数排序问题的形式化描述.为明确排序规则,定义了区间数的二元序关系.采用概率密度函数表征区间数的特征信息,并构建出区间数序关系的概率可信度模型.通过建立互补判断矩阵,将区间数排序问题转换为矩阵运算过程,实现了不同类型区间数的比较.实验结果表明,所提出方法能够有效克服传统排序方法在适用范围方面的局限性,具有排序速度快、求解质量高等优点.     

AOV网中全拓扑排序算法的设计及应用

以顶点表示活动的网络(AOV网)可用来表示整个工程中各个子工程的先后次序制约关系,利用拓扑排序算法能求得子工程的线性序列--拓扑序列.按此序列安排各子工程,能保证整个工程的顺利完成.传统的拓扑排序算法基于栈结构实现,只能求得实际存在的多个拓扑序列中的一种,削弱了算法的实用价值.文中为了弥补这一缺陷,设计全拓扑排序算法求出了AOV网中实际存在的全部拓扑序列.给出了AOV网的定义及拓扑排序算法思想,分析了传统拓扑算法的不足,提出了一个全拓扑排序求解算法.并讨论了算法中用到的数据结构,以及算法的伪代码实现,通过一个应用实例验证了全拓扑排序算法的实用性和正确性.     

基于动态规划和流形排序的知识库问答未登录词处理

为解决知识库问答中较多实体未被纳入到词库中以及新词层出不穷旧词库无法及时更新的问题，提出一种基于动态规划和流形排序的知识库问答模型DPQA来为未登录词选择最优表征，缓解知识库未登录词描述信息不足的问题。该方法通过动态规划获取未登录词的子词序列；使用一种基于流形排序的子词排序方法得到最优子词；使用最优子词的向量表示未登录词。实验结果表明，基于动态规划的方法在多个数据集上的问答结果表现最佳。     

面向多搬运任务的柔性制造车间多载具AGV节能路径规划

自动导引搬运车（automated guided vehicle,AGV）能够灵活、准确、高效地进行物料搬运,被广泛应用于柔性制造车间。多载具AGV能同时搬运多个工件,具有较强的搬运灵活性,其路径规划问题的复杂性和多约束性更强,求解难度更大。针对柔性制造车间多载具AGV节能路径规划问题,首先建立了以能耗和搬运距离为优化目标的AGV节能路径规划模型;然后,提出了一种改进Dijkstra算法和非支配排序遗传算法（non-dominated sorting genetic algorithm-II,NSGA-II）集成的多载具AGV节能路径规划方法;最后通过案例验证了模型的节能效果和求解方法的有效性。     

最小化全局完成时间的成像卫星任务规划算法

成像侦察卫星任务规划问题是一类典型多约束组合优化问题.最小化全局完成时间是任务规划领域时效性要求较高情况下的一种优化目标.提出一种整合整数规划与约束规划方法,在最小化任务规划方案全局完成时间的目标下,求解成像侦察卫星任务规划问题的组合算法.该算法通过应用Benders分解将原约束整数规划模型划分为主问题与子问题两部分,采用软件MOSEK与GECODE对主、子问题分别求解.根据子问题求解结果生成剪枝约束,返回主问题迭代,直到获得优化解.算法有效性通过仿真实验进行了检验并取得预期效果.     

目标间顺序关系的提取及其抽象方法

规划问题是一类复杂的问题.由于规划问题中各个目标之间往往存在着实现上的顺序关系,发掘这种顺序关系并加以利用是提高规划算法效率的一种途径.由于判定目标间的顺序关系同样是PSPACE完全的,因而为利用目标间的顺序关系首先需要有效地提取目标间的顺序关系.给出了一种利用状态不变式来提取目标间顺序关系的GOWN(goalorderingwithinvariants)方法,并在比较目标间的顺序关系时,通过抽象和合一的手段,有效地控制了问题的增长规模,提高了处理效率.     

目标间顺序关系的提取及其抽象方法

规划问题是一类复杂的问题.由于规划问题中各个目标之间往往存在着实现上的顺序关系,发掘这种顺序关系并加以利用是提高规划算法效率的一种途径.由于判定目标间的顺序关系同样是PSPACE完全的,因而为利用目标间的顺序关系首先需要有效地提取目标间的顺序关系.给出了一种利用状态不变式来提取目标间顺序关系的GOWN(goal ordering with invariants)方法,并在比较目标间的顺序关系时,通过抽象和合一的手段,有效地控制了问题的增长规模,提高了处理效率.     

Integrating Standard Dependency Schemes in QCSP Solvers

Quantified constraint satisfaction problems (QCSPs) are an extension to constraint satisfaction problems (CSPs) with both universal quantifiers and existential quantifiers.In this paper we apply variab...     

IRP用户视图间依赖关系的度量

用户视图间的依赖关系对于信息资源规划中的数据分析和数据建模有着重要的意义。该文对用户视图间的依赖关系进行了定义和说明，并细分其为数据依赖和操作依赖，在此基础上，对用户视图间的依赖关系进行了度量，提出了依赖度和被依赖度2种度量方法，为规范用户视图提供了依据。     

Analyzing and mining ordered information tables

Work in inductive learning has mostly been concentrated on classifying.However,there are many applications in which it is desirable to order rather than to classify instances.Formodelling ordering problems,we generalize the notion of information tables to ordered information tables by adding order relations in attribute values.Then we propose a data analysis model by analyzing the dependency of attributes to describe the properties of ordered information tables.The problem of mining ordering rules is formulated as finding association between orderings of attribute values and the overall ordering of objects.An ordering rules may state that “if the value of an object x on an attribute a is ordered ahead of the value of another object y on the same attribute,then x is ordered ahead of y“.For mining ordering rules,we first transform an ordered information table into a binary information table,and then apply any standard machine learning and data mining algorithms.As an illustration,we analyze in detail Maclean‘s universities ranking for the year 2000.     

Discovering process models from event multiset

The aim of process mining is to discover the process model from the event log which is recorded by the information system. Typical steps of process mining algorithm can be described as: (1) generating event traces from event log, (2) analyzing event traces and obtaining ordering relations of tasks, (3) generating process model with ordering relations of tasks. The first two steps could be very time consuming involving millions of events and thousands of event traces. This paper presents a novel algorithm (λ-algorithm) which almost eliminates these two steps in generating event traces from event log and analyzing event traces so as to reduce the performance of process mining algorithm. Firstly, we retrieve the event multiset (input data of algorithm marked as MS) which records the frequency of each event but ignores their orders when extracted from event logs. The event in event multiset contains the information of post-activities. Secondly, we obtain ordering relations from event multiset. The ordering relations contain causal dependency, potential parallelism and non-potential parallelism. Finally, we discover a process models with ordering relations. The complexity of λ-algorithm is only bound up with the event classes (the set of events in event logs) that has significantly improved the performance of existing process mining algorithms and is expected to be more practical in real-world process mining based on event logs, as well as being able to detect SWF-nets, short-loops and most of implicit dependency (generated by non-free choice constructions).     

PMS故障树分析中的变量排序策略库研究

研究阶段任务系统(PMS)故障树变量排序方法。构造一个包含10种不同排序策略的策略库,基于实例基准测试对策略库中的单个策略进行平均性能分析,并在此基础上对策略库本身进行互补性和完备性分析。实例分析表明,应用该策略库可以为各种结构特征的大规模PMS故障树快速有效地生成系统二进制决策图。     

An introduction to vague complemented ordered sets

The purpose of this paper is to introduce a theory of fuzzily defined complement operations on nonempty sets equipped with fuzzily defined ordering relations. Many-valued equivalence relation-based fuzzy ordering relations (also called vague ordering relations) provide a powerful and a comprehensive mathematical modelling of fuzzily defined partial ordering relations. For this reason, starting with a nonempty set X equipped with a many-valued equivalence relation and a vague ordering relation, a fuzzily defined complement operation (called a vague complement operation) on X will be formulated by means of the underling many-valued equivalence relation and vague ordering relation. Because of the fact that the practical implementations of vague complement operations basically depend on their representation properties, a considerable part of this paper is devoted to the representations of vague complement operations. In addition to this, the present paper provides various nontrivial examples for vague complements, and introduces a many-valued logical interpretation of quantum logic as a real application of vague complements.     

Simplification orderings: Putting them to the test

Various methods for proving the termination of term rewriting systems have been suggested. Most of them are based on the notion of a simplification ordering. In this paper, a collection of well-known simplification orderings will be briefly presented including path orderings and decomposition orderings. A satisfactory application to examples often found in practice is an essential requirement concerning such orderings. We describe a detailed empirical study of their time complexities with respect to comparable pairs of terms.This research was supported by the Deutsche Forschungsgemeinschaft, SFB 314 (D4-Projekt).