主旋翼升力和机身姿态受限的模型直升机非线性控制（英文）

A nonlinear control is proposed for trajectory tracking of a 6-DOF model-scaled helicopter with constraints on main rotor thrust and fuselage attitude. In the procedure of control design, the mathematical model of helicopter is simplified into three subsystems: altitude subsystem, longitudinal-lateral subsystem and attitude subsystem. The proposed control is developed by combining the sub-controls for the corresponding subsystems. The sub-controls for altitude subsystem and longitudinal-lateral subsystem are designed with hyperbolic tangent functions to satisfy the constraints; the sub-control for attitude subsystem is based on backstepping technique such that fuselage attitude tracks the virtual control for longitudinallateral subsystem. It is proved theoretically that tracking errors are ultimately bounded, and control constraints are satisfied.Performances of the proposed controller are demonstrated by simulation results.     

Interactive fuzzy stochastic multi-level 0–1 programming using tabu search and probability maximization

In this paper, we consider interactive fuzzy programming for multi-level 0–1 programming problems involving random variable coefficients both in objective functions and constraints. Following the probability maximization model together with the concept of chance constraints, the formulated stochastic multi-level 0–1 programming problems are transformed into deterministic ones. Taking into account vagueness of judgments of the decision makers, we present interactive fuzzy programming. In the proposed interactive method, after determining the fuzzy goals of the decision makers at all levels, a satisfactory solution is derived efficiently by updating satisfactory levels of the decision makers with considerations of overall satisfactory balance among all levels. For solving the transformed deterministic problems efficiently, we also introduce novel tabu search for general 0–1 programming problems. A numerical example for a three-level 0–1 programming problem is provided to illustrate the proposed method.     

A genetic tango attack against the David–Prasad RFID ultra‐lightweight authentication protocol

Radio frequency identification (RFID) is a powerful technology that enables wireless information storage and control in an economical way. These properties have generated a wide range of applications in different areas. Due to economic and technological constrains, RFID devices are seriously limited, having small or even tiny computational capabilities. This issue is particularly challenging from the security point of view. Security protocols in RFID environments have to deal with strong computational limitations, and classical protocols cannot be used in this context. There have been several attempts to overcome these limitations in the form of new lightweight security protocols designed to be used in very constrained (sometimes called ultra‐lightweight) RFID environments. One of these proposals is the David–Prasad ultra‐lightweight authentication protocol. This protocol was successfully attacked using a cryptanalysis technique named Tango attack. The capacity of the attack depends on a set of boolean approximations. In this paper, we present an enhanced version of the Tango attack, named Genetic Tango attack, that uses Genetic Programming to design those approximations, easing the generation of automatic cryptanalysis and improving its power compared to a manually designed attack. Experimental results are given to illustrate the effectiveness of this new attack.     

Modeling and global trajectory tracking control for an over-actuated MAV

This paper deals with an original micro aerial vehicle (MAV) design, the Omnicopter MAV. It has two central coaxial rotors with fixed-pitch propellers and three perimeter mounted ducted fans with servo motors performing thrust vectoring. Compared with traditional rotary wing MAVs that have inherent underactuation, the Omnicopter possesses some advantages in mobility, for example, lateral translation with zero attitude and hover with nonzero attitude. The trajectory tracking control design, global stability analysis, and control allocation are demonstrated through numerical simulation. The advantage of zero attitude translation is illustrated through experimental results.     

基于轨迹频率抑制的轨迹隐私保护方法

移动终端和定位技术的快速发展带来了轨迹大数据.研究者通过挖掘和分析发布的轨迹数据集,可获得一些有价值的信息.攻击者也可利用所掌握的知识对发布的轨迹数据集进行推理分析,以较高的概率推断出用户的隐私信息.轨迹抑制是一类实现隐私保护的重要方法,然而轨迹抑制的点数越多会造成数据效用越低.因此,在满足用户隐私需求的情况下,如何选择合理的抑制点来提高匿名处理后的数据效用是数据发布中要解决的重要问题.针对以上问题,文中提出两种基于轨迹频率的方案对轨迹数据进行匿名处理.第一种方案是根据情况抑制整条有问题的轨迹数据或向有问题的轨迹数据集中添加假数据;第二种方案是采用特定的轨迹局部抑制法对数据进行抑制处理.实验表明相对于已有方案,在满足同等隐私需求的情况下,文中方案处理后的数据效用提升了近30%.     

Solving a multi-floor layout design model of a dynamic cellular manufacturing system by an efficient genetic algorithm

This paper presents a mixed-integer programming model for a multi-floor layout design of cellular manufacturing systems (CMSs) in a dynamic environment. A novel aspect of this model is to concurrently determine the cell formation (CF) and group layout (GL) as the interrelated decisions involved in the design of a CMS in order to achieve an optimal (or near-optimal) design solution for a multi-floor factory in a multi-period planning horizon. Other design aspects are to design a multi-floor layout to form cells in different floors, a multi-rows layout of equal area facilities in each cell, flexible reconfigurations of cells during successive periods, distance-based material handling cost, and machine depot keeping idle machines. This model incorporates with an extensive coverage of important manufacturing features used in the design of CMSs. The objective is to minimize the total costs of intra-cell, inter-cell, and inter-floor material handling, purchasing machines, machine processing, machine overhead, and machine relocation. Two numerical examples are solved by the CPLEX software to verify the performance of the presented model and illustrate the model features. Since this model belongs to NP-hard class, an efficient genetic algorithm (GA) with a matrix-based chromosome structure is proposed to derive near-optimal solutions. To verify its computational efficiency in comparison to the CPLEX software, several test problems with different sizes and settings are implemented. The efficiency of the proposed GA in terms of the objective function value and computational time is proved by the obtained results.     

Modeling and solving mixed-model assembly line balancing problem with setups. Part I: A mixed integer linear programming model

This paper is the first one of the two papers entitled “modeling and solving mixed-model assembly line balancing problem with setups”, which has the aim of developing the mathematical programming formulation of the problem and solving it with a hybrid meta-heuristic approach. In this current part, a mixed-integer linear mathematical programming (MILP) model for mixed-model assembly line balancing problem with setups is developed. The proposed MILP model considers some particular features of the real world problems such as parallel workstations, zoning constraints, and sequence dependent setup times between tasks, which is an actual framework in assembly line balancing problems. The main endeavor of Part-I is to formulate the sequence dependent setup times between tasks in type-I mixed-model assembly line balancing problem. The proposed model considers the setups between the tasks of the same model and the setups because of the model switches in any workstation. The capability of our MILP is tested through a set of computational experiments. Part-II tackles the problem with a multiple colony hybrid bees algorithm. A set of computational experiments is also carried out for the proposed approach in Part-II.     

Fast economic model predictive control based on NLP-sensitivities

This study adapts the advanced step NMPC framework to Economic NMPC. Here, sufficient conditions for nominal stability are derived for NMPC controllers that incorporate economic stage costs with appropriate regularization. To guarantee these conditions, we derive a constructive strategy to calculate the regularization term directly. Moreover, we extend the sensitivity components in the advanced step NMPC framework to consider a rigorous path-following algorithm. This approach accounts for active set changes and allows much weaker constraint qualifications. Moreover, using an ℓ₁ formulation of the NMPC problem satisfies these constraint qualifications and allows more reliable solution of the moving horizon optimization problem, even in the presence of noise. Finally, all of these concepts are demonstrated on a detailed case study with a continuously stirred tank reactor.     

A Dantzig–Wolfe decomposition algorithm for linear economic model predictive control of dynamically decoupled subsystems

This paper presents a warm-started Dantzig–Wolfe decomposition algorithm tailored to economic model predictive control of dynamically decoupled subsystems. We formulate the constrained optimal control problem solved at each sampling instant as a linear program with state space constraints, input limits, input rate limits, and soft output limits. The objective function of the linear program is related directly to the cost of operating the subsystems, and the cost of violating the soft output constraints. Simulations for large-scale economic power dispatch problems show that the proposed algorithm is significantly faster than both state-of-the-art linear programming solvers, and a structure exploiting implementation of the alternating direction method of multipliers. It is also demonstrated that the control strategy presented in this paper can be tuned using a weighted ℓ₁-regularization term. In the presence of process and measurement noise, such a regularization term is critical for achieving a well-behaved closed-loop performance.