双孔模型材挤压过程的有限元分析

本文采用大变形弹塑性有限元理论 ,对双孔模型材挤压成形过程进行了有限元分析。模拟了双孔模非对称角铝型材挤压变形过程 ,获得了挤压变形时网格畸变、流速、应力和应变分布 ,展示了型材挤压件变形不均匀细节。并与单孔模型材挤压过程进行了比较 ,发现双孔模[1] 挤压时 ,变形体内存在两个互为相反方向的涡流场 ,它们相互抵消 ,从而可以消除型材挤压过程中产生的扭拧、波浪、弯曲等缺陷。为提高挤压件质量 ,优化设计多孔型材挤压模以及制定合理的工艺 ,提供了理论依据     

一种基于条件证据网络的多源异类知识融合识别方法

针对融合识别领域中不同框架下多源异类传感器的不确定证据信息无法有效融合的问题, 提出一种基于条件证据网络的多源异类知识融合识别方法. 该方法将战场协同作战中不同框架下多源异类传感器的领域知识统一在证据网络的结构下, 形成多源异类知识融合识别模型, 对多源异类传感器的不确定性证据信息进行基于条件证据网络的融合推理, 得到识别结果. 仿真实例验证了所提出方法的优越性.

     

改进生成树算法的多机器人在线地图覆盖

研究在线多机器人地图覆盖。在单机器人生成树STC算法基础上做出改进,融入了市场拍卖算法,使机器人团体扩散地生成树,并沿各自生成树完成地图覆盖。通过两种不同环境地图覆盖仿真,结果验证改进后的IMPSTC算法,能够使机器人团队在更少的时间和重复覆盖区域情况下完成在线覆盖地图任务。     

多参数融合的飞行品质评估模型的建立

目前航空管理机构与航空公司进行飞行品质评估主要是依据经验与简单飞行参数统计数字,这样做难以得出科学、客观的评估结果。基于提升全行业安全保障能力和运行品质的需求,研究了利用计算机技术对飞行品质进行综合评估的方法。选取了理想值逼近法作为飞行品质综合评估的手段,结合波动通道模型作为飞行品质评估的理论基础,基于提出的飞行品质评估模型对飞行品质评估系统进行了设计。对真实的飞行参数数据建立综合评估模型,同时考察多次航班的多个飞行参数,给出综合的飞行品质评估结论,为飞行评估、训练提供理论基础和科学的评判方法。     

电力无线通信异构多网共存环境中的网络选择算法

综合考虑电力业务需求和无线专网性能因素,针对邻域网、LTE无线专网、WiMAX无线专网和230 MHz无线专网等构成的异构多网混合共存场景,提出一种网络选择算法。该算法以AHPTOPSIS算法为基础,首先构建能表征候选网络与决策属性之间关系的决策矩阵,归一化处理获得归一化决策矩阵;利用AHP算法,依据不同业务类型下决策属性与网络性能之间的相对关系定义权重,对归一化决策矩阵加权获得加权归一化决策矩阵;然后对TOPSIS算法进行改进,依据加权归一化决策矩阵确定正负理想值,利用正理想值与候选网络之间的最小距离以及负理想值与候选网络之间的最大距离确定理想网络,计算各候选网络与理想网络之间的有效距离;据此执行候选网络排序和最佳网络选择,以避免运行TOPSIS算法可能存在的排序异常。仿真结果表明,该算法能根据电力业务需求对候选网络进行正确排序和最优选择,且能在满足业务服务质量的同时,提高资源利用率。     

Adaptive fault tolerant control for a class of input and state constrained MIMO nonlinear systems

In this work, we present a novel adaptive fault tolerant control (FTC) scheme for a class of control input and system state constrained multi‐input multi‐output (MIMO) nonlinear systems with both multiplicative and additive actuator faults. The input constraints can be asymmetric, and the state constraints can be time‐varying. A novel tan‐type time‐varying Barrier Lyapunov Function (BLF) is proposed to deal with the state constraints, and an auxiliary system is designed to analyze the effect of the input constraints. We show that under the proposed adaptive FTC scheme, exponential convergence of the output tracking error into a small neighbourhood of zero is guaranteed, while the constraints on the system state will not be violated during operation. Estimation errors for actuator faults are bounded in the closed loop. An illustrative example on a two degree‐of‐freedom robotic manipulator is presented to demonstrate the effectiveness of the proposed FTC scheme. Copyright © 2015 John Wiley & Sons, Ltd.     

Semi‐global output consensus of a group of linear systems in the presence of external disturbances and actuator saturation: An output regulation approach

This paper studies the problem of semi‐global leader‐following output consensus of a multi‐agent system. The output of each follower agent in the system, described by a same general linear system subject to external disturbances and actuator saturation, is to track the output of the leader, described by a linear system, which also generates disturbances as the exosystem does in the classical output regulation problem. Conditions on the agent dynamics are identified, under which a low‐gain feedback‐based linear state‐control algorithm is constructed for each follower agent such that the output consensus is achieved when the communication topology among the agents is a digraph containing no loop, and the leader is reachable from any follower agent. We also extend the results to the non‐identical disturbance case. In this case, conditions based on both the agent dynamics and the communication topology are identified, under which a low‐gain feedback‐based linear state‐control algorithm is constructed for each follower agent such that the leader‐following output consensus is achieved when the communication topology among the follower agents is a strongly connected and detailed balanced digraph, and the leader is a neighbor of at least one follower. In addition, under some further conditions on the agent dynamics, the control algorithm is adapted so as to achieve semi‐global leader‐following output consensus for a jointly connected undirected graph and the leader reachable from at least one follower. Copyright © 2015 John Wiley & Sons, Ltd.     

Coordination arrival control for multi‐agent systems

The coordination arrival problems of first‐order multi‐agent systems with the arriving structure and the time structure requirements are considered for the cases with no obstacle and obstacle. To describe the distributed coordination arrival problems, we first introduce needed definitions, such as coordination arrival, threat point, and arrival structure. By selecting the estimated value of the arriving time of the agent as variable, we then develop a central estimating algorithm, which is used to construct the arriving protocols. Based on the estimating algorithm, we build and analyze coordination arriving protocols for the proposed coordination arrival problems. Several simulation examples are presented to validate the proposed algorithms. Copyright © 2015 John Wiley & Sons, Ltd.     

Distributed consensus tracking for multi‐agent systems under two types of attacks

This paper studies a distributed coordinated control problem for a class of linear multi‐agent systems subject to two types of attacks. The problem boils down to how to achieve secure consensus tracking for multi‐agent systems with connected and disconnected (paralyzed) directed switching topologies caused by two types of attacks. The attacks on the edges instead of nodes lead to the loss of security performance. Two cases are studied in this paper. First, under only a class of connectivity‐maintained attacks, sufficient conditions are derived to achieve secure consensus tracking in mean‐square. Second, when the multi‐agent systems are further subject to a class of connectivity‐broken attacks, novel sufficient conditions are further obtained to ensure secure consensus tracking with a specified convergence rate by virtue of the idea of average dwell time switching between some stable and unstable subsystems. Three numerical simulations are finally given to illustrate the theoretical analysis. Copyright © 2015 John Wiley & Sons, Ltd.