Finite-time adaptive fuzzy control for a class of output constrained nonlinear systems with dead-zone

The article investigates the finite-time adaptive fuzzy control for a class of nonlinear systems with output constraint and input dead-zone. First, by skillfully combining the barrier Lyapunov function, backstepping design method, and finite-time control theory, a novel adaptive state-feedback tracking controller is constructed, and the output constraint of the nonlinear system is not violated. Second, the fuzzy logic system is used to approximate unknown function in the nonlinear system. Third, the finite-time command filter is introduced to avoid the problem of “complexity explosion” caused by repeated differentiations of the virtual control signal in conventional backstepping control schemes. Meanwhile, a new saturation function is added in the compensating signal for filter error to improve control accuracy. Finally, based on Lyapunov stability analysis, all the signals of the closed-loop are proved to be semi-globally uniformly ultimately bounded, and the tracking error converges to a small neighborhood region of the origin in a finite time. A simulation example is presented to demonstrate the effectiveness for the proposed control scheme.     

Machine fault diagnosis with small sample based on variational information constrained generative adversarial network

In actual engineering scenarios, limited fault data leads to insufficient model training and over-fitting, which negatively affects the diagnostic performance of intelligent diagnostic models. To solve the problem, this paper proposes a variational information constrained generative adversarial network (VICGAN) for effective machine fault diagnosis. Firstly, by incorporating the encoder into the discriminator to map the deep features, an improved generative adversarial network with stronger data synthesis capability is established. Secondly, to promote the stable training of the model and guarantee better convergence, a variational information constraint technique is utilized, which constrains the input signals and deep features of the discriminator using the information bottleneck method. In addition, a representation matching module is added to impose restrictions on the generator, avoiding the mode collapse problem and boosting the sample diversity. Two rolling bearing datasets are utilized to verify the effectiveness and stability of the presented network, which demonstrates that the presented network has an admirable ability in processing fault diagnosis with few samples, and performs better than state-of-the-art approaches.     

Topology optimization of flexure hinges with a prescribed compliance matrix based on the adaptive spring model and stress constraint

This paper focuses on the configuration design of flexure hinges with a prescribed compliance matrix and preset rotational center position. A new method for the topology optimization of flexure hinges is proposed based on the adaptive spring model and stress constraint. The hinge optimization model is formulated by maximizing the bending displacement with a spring while optimizing the compliance matrix to a prescribed value. To avoid numerical instability, an artificial spring is used as an auxiliary calculation, and a new strategy is developed for adaptively adjusting the spring stiffness according to the prescribed compliance matrix. The maximum stress of flexure hinge is limited by using a normalized P-norm of the effective von Mises stress, and a position constraint of rotational center is proposed to predetermine the position of the rotational center. In addition, to reduce the error of the stress measurement, a simple but effective filtering method is presented to obtain a complete black-and-white design. Numerical examples are used to verify the proposed method. Topology results show that the obtained flexure hinges have the prescribed compliance matrix and preset rotational center position while also meeting the stress requirements.     

Exploring design trade-offs for achieving social inclusion in multi-tiered design problems

ABSTRACT

The digital age of the future is ‘not out there to be discovered’, but it needs to be ‘designed’. The design challenge has to address questions about how we want to live, work, and learn (as individuals and as communities) and what we value and appreciate, e.g.: reflecting on quality of life and creating inclusive societies. An overriding design trade-off for the digital age is whether new developments will increase the digital divide or will create more inclusive societies. Sustaining inclusive societies means allowing people of all ages and all abilities to exploit information technologies for personally meaningful activities. Meta-design fosters the design of socio-technical environments that end-user developers can modify and evolve at use time to improve their quality of life and favour their inclusion in the society. This paper describes three case studies in the domain of assistive technologies in which end users themselves cannot act as end-user developers, but someone else (e.g.: a caregiver or a clinician) must accept this role requiring multi-tiered architectures. The design trade-offs and requirements for meta-design identified in the context of the case studies and other researchers’ projects are described to inform the development of future socio-technical environments focused on social inclusion.     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.     

A new decomposition based evolutionary algorithm with uniform designs for many-objective optimization

For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence.     

On recommendation problems beyond points of interest

Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead.     

Event-triggered distributed receding horizon control for tracking and formation of homogeneous multi-agent systems

This paper proposes an event-triggered distributed receding horizon control (DRHC) approach for the formation and tracking problems of homogeneous multi-agent systems. For each agent, an event-triggering condition, based on assumed predictive information of the neighbours, is derived from stability analysis. Considering the uncertain deviation between the assumed and true predictive information, we design a time-varying compatibility constraint for the individual optimization problem. In the event-triggered DRHC algorithm, each agent solves the optimization problem and communicates with its neighbours only when the event-triggering condition is satisfied, so the communication and computation burden are reduced. Moreover, guarantees for the recursive feasibility and asymptotic stability of the overall system are proved. A simulation example is provided to illustrate effectiveness of the proposed approach.     

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.