An efficient aerodynamic shape optimization of blended wing body UAV using multi-fidelity models

This paper presents a novel optimization technique for an efficient multi-fidelity model building approach to reduce computational costs for handling aerodynamic shape optimization based on high-fidelity simulation models. The wing aerodynamic shape optimization problem is solved by dividing optimization into three steps—modeling 3D(high-fidelity) and 2D(lowfidelity) models, building global meta-models from prominent instead of all variables, and determining robust optimizing shape associated with tuning local meta-models. The adaptive robust design optimization aims to modify the shape optimization process. The sufficient infilling strategy—known as adaptive uniform infilling strategy—determines search space dimensions based on the last optimization results or initial point. Following this, 3D model simulations are used to tune local meta-models. Finally, the global optimization gradient-based method—Adaptive Filter Sequential Quadratic Programing(AFSQP) is utilized to search the neighborhood for a probable optimum point. The effectiveness of the proposed method is investigated by applying it, along with conventional optimization approach-based meta-models, to a Blended Wing Body(BWB) Unmanned Aerial Vehicle(UAV). The drag coefficient is defined as the objective function, which is subjected to minimum lift coefficient bounds and stability constraints. The simulation results indicate improvement in meta-model accuracy and reduction in computational time of the method introduced in this paper.     

航空发动机ZP/LTR方法稳定性分析及改进

分析了零点配置/回路传函恢复(ZP/LTR)方法稳定性, 给出并证明了其稳定性条件.但该条件较为苛刻, 限制了ZP/LTR方法的应用.为了对ZP/LTR方法改进, 在设计过程中引入了Kal man滤波器, 通过选取特殊的参数, 使Kal man滤波器回路逼近并取代原目标回路, 从而在保留ZP/LTR方法性能的同时, 通过保证Kal man滤波器回路的稳定性保证了最后闭环系统的稳定性.给出并证明了改进后的ZP/LTR方法的稳定性条件, 指出改进后的ZP/LTR方法的稳定性条件较为宽松, 拓宽了原ZP/LTR方法的应用范围.      

具有锥结构的二人半无限零和对策与DEA模型C^2WY

文中主要讨论DEA模型与对策模型之间的等价关系。提出了具有锥结构形式的二人半无限零和对策模型,并利用具有锥结构形式的半无限规划理论,证明了DEA综合模型C~2WY与相应的具有锥结构形式的二人半无限零和对策模型之间(弱)等价性。     

一种多进程实时控制系统的软件设计

本文提出了一种时间片预分割方案,并将其用于多进程实时控制系统的软件设计,其特点是程序设计简单、维护方便,尤其是提高了系统运行的可靠性。     

LISP跳棋程序与启发式搜索

本文叙述了在IBM-PC个人计算机上,研制成功的LISP跳棋智能程序中,如何成功地使用启发式搜索进行设计的方法,特别对作者自行设计的顺序递归搜索算法进行了分析和评价。     

洗衣机用水量的优化设计

本文对洗衣机运转过程中的用水量建立优化模型，目标函数为在达到一定洗涤效果的前提下的最小用水量。我们将此归结为利用Ｌａｇｒａｎｇｅ函数求非线性规划的最优解问题，并且给出了相应的理论证明。此外，结合实际具体数据为洗衣机设计了一组运行程序。最后讨论了模型的改进与推广，并且对模型的优缺点作出了分析。     

二次通用旋转组合设计试验在造粒技术领域的应用研究

本文研究了利用二次通用旋转组合设计来进行多因素影响的振动流化床喷雾造粒试验,建立数学模型,得出了具有一定参数价值的最佳操作参数。     

Hybrid partition- and network-level scheduling design for distributed integrated modular avionics systems

Distributed Integrated Modular Avionics (DIMA) develops from Integrated Modular Avionics (IMA) and realizes distributed integration of multiple sub-function areas. Time-triggered network provides effective support for time synchronization and information coordination in DIMA systems. However, inconsistency between processing resources and communication network destroys the time determinism benefiting from partitions and time-triggered mechanism. To ensure such time determinism and achieve guaranteed real-time performance, system design should collectively provide a global communication scheme for messages in network domain and a corresponding execution scheme for partitions in processing domain. This paper firstly establishes a general DIMA model which coordinates partitioned processing and time-triggered communication, and then proposes a hybrid scheduling algorithm using Mixed Integer Programming to produce feasible system schemes. Furthermore, incrementally integrating new functions causes upgrades or reconfigurations of DIMA systems and will generate integration cost. To control such cost, this paper further develops an optimization algorithm based on Maximum Satisfiability Problem and guarantees that the scheduling design for upgraded DIMA systems inherit their original schemes as much as possible. Finally, two typical cases, including a simple fully connected DIMA system case and an industrial DIMA system case, are constructed to illustrate our DIMA model and validate the effectiveness of our hybrid scheduling algorithms.     

Obstacle avoidance handling and mixed integer predictive control for space robots

This paper presents a novel obstacle avoidance constraint and a mixed integer predictive control (MIPC) method for space robots avoiding obstacles and satisfying physical limits during performing tasks. Firstly, a novel kind of obstacle avoidance constraint of space robots, which needs the assumption that the manipulator links and the obstacles can be represented by convex bodies, is proposed by limiting the relative velocity between two closest points which are on the manipulator and the obstacle, respectively. Furthermore, the logical variables are introduced into the obstacle avoidance constraint, which have realized the constraint form is automatically changed to satisfy different obstacle avoidance requirements in different distance intervals between the space robot and the obstacle. Afterwards, the obstacle avoidance constraint and other system physical limits, such as joint angle ranges, the amplitude boundaries of joint velocities and joint torques, are described as inequality constraints of a quadratic programming (QP) problem by using the model predictive control (MPC) method. To guarantee the feasibility of the obtained multi-constraint QP problem, the constraints are treated as soft constraints and assigned levels of priority based on the propositional logic theory, which can realize that the constraints with lower priorities are always firstly violated to recover the feasibility of the QP problem. Since the logical variables have been introduced, the optimization problem including obstacle avoidance and system physical limits as prioritized inequality constraints is termed as MIPC method of space robots, and its computational complexity as well as possible strategies for reducing calculation amount are analyzed. Simulations of the space robot unfolding its manipulator and tracking the end-effector’s desired trajectories with the existence of obstacles and physical limits are presented to demonstrate the effectiveness of the proposed obstacle avoidance strategy and MIPC control method of space robots.     

Multiple-constraint cooperative guidance based on two-stage sequential convex programming

An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target. The problem with time-varying Proportional Navigation (PN) gain is first formulated as a nonlinear optimal control problem, which is difficult to solve due to the existence of nonlinear kinematics and nonconvex constraints. After convexification treatments and discretization, the solution to the original problem can be approximately obtained by solving a sequence of Second-Order Cone Programming (SOCP) problems, which can be readily solved by state-of-the-art Interior-Point Methods (IPMs). To mitigate the sensibility of the algorithm on the user-provided initial profile, a Two-Stage Sequential Convex Programming (TSSCP) method is presented in detail. Furthermore, numerical simulations under different mission scenarios are conducted to show the superiority of the proposed method in solving the cooperative guidance problem. The research indicated that the TSSCP method is more tractable and reliable than the traditional methods and has great potential for real-time processing and on-board implementation.