Electromagnetic MEMS microspeaker for portable electronic devices

This work presents the conception, the microfabrication, and the electroacoustic characterization of a new electromagnetic microspeaker based on silicon. The objectives are to get improved sound quality compared to that of conventional microspeakers, while keeping the electroacoustic efficiency as high as possible. An optimized stiffening silicon microstructure let the sound radiator be extremely light and rigid. The mobile part is suspended to the fixed part by silicon suspension springs, which enable large out-of-plane displacement. The acoustic radiator is actuated by an electromagnetic motor, composed of a fixed permanent magnet and a planar coil located on top of the silicon radiator. The piston-like motion of the radiator favored by this structure is very beneficial for the sound quality. Electro–mechano–acoustic characterization of the microfabricated microspeaker showed that the radiator surface could run out-of-plane with displacements higher than ±400 μm, with no mechanical and electrical failure. For an electrical power of 0.5 W, the microspeaker was capable to generate a sound pressure level of 80 dB at 10 cm, from 330 Hz up to 20 kHz frequency. The efficiency reaches 3 × 10^?5, that is to say three times more than typical efficiency of conventional microspeakers. Moreover, as characterization results showed, the existence of very few structural modes and the low electroacoustic distortions evidence the high sound quality of the microspeaker.     

Scatter search technique for exam timetabling

At universities where students enjoy flexibility in selecting courses, the Registrar’s office aims to generate an appropriate exam timetable for numerous courses and large number of students. An appropriate, real-world exam timetable should show fairness towards all students, respecting the following constraints: (a) eliminating or minimizing the number of simultaneous exams; (b) minimizing the number of consecutive exams; (c) minimizing the number of students with two or three exams per day (d) eliminating the possibility of more than three exams per day (e) exams should fit in rooms with predefined capacity; and (f) the number of exam periods is limited. These constraints are conflicting, which makes exam timetabling intractable. Hence, solving this problem in realistic time requires the use of heuristic approaches. In this work, we develop an evolutionary heuristic technique based on the scatter search approach for finding good suboptimal solutions for exam timetabling. This approach is based on maintaining and evolving a population of solutions. We evaluate our suggested technique on real-world university data and compare our results with the registrar’s manual timetable in addition to the timetables of other heuristic optimization algorithms. The experimental results show that our adapted scatter search technique generates better timetables than those produced by the registrar, manually, and by other meta-heuristics.     

Safe Autonomous Agent Formation Operations Via Obstacle Collision Avoidance

In this paper, we consider the problem of flocking and shape‐orientation control of multi‐agent systems with inter‐agent and obstacle collision avoidance. We first consider the problem of forcing a set of autonomous agents to form a desired formation shape and orientation while avoiding inter‐agent collision and collision with convex obstacles, and following a trajectory known to only one of the agents, namely the leader of the formation. Then we build upon the solution given to this problem and solve the problem of guaranteeing obstacle collision avoidance by changing the size and the orientation of the formation. Changing the size and the orientation of the formation is helpful when the agents want to go through a narrow passage while the existing size or orientation of the formation does not allow this. We also propose collision avoidance algorithms that temporarily change the shape of the formation to avoid collision with stationary or moving nonconvex obstacles. Simulation results are presented to show the performance of the proposed control laws.     

Short‐Time Linear Quadratic Form Technique for Estimating Fast‐Varying Parameters in Feedback Loops

The precision of a closed‐loop controller system designed for an uncertain plant depends strongly upon the maximum extent to which it is possible to track the trend of time‐varying parameters of the plant. The aim of this study is to describe a new parameter estimation algorithm that is able to follow fast‐varying parameters in closed‐loop systems. The short‐time linear quadratic form (STLQF) estimation algorithm introduced in this paper is a technique for tracking time‐varying parameters based on short‐time analysis of the regressing variables in order to minimize locally a linear quadratic form cost function. The established cost function produces a linear combination of errors with several delays. To meet this objective, mathematical development of the STLQF estimation algorithm is described. To implement the STLQF algorithm, the algorithm is applied to a planar mobile robot with fast‐varying parameters of inertia and viscous and coulomb frictions. Next, performance of the proposed algorithm is assessed against noise effects and variation in the type of parameters.     

An optimal scheme for fast rate fault detection based on multirate sampled data

Multirate systems are abundant in industry. In this paper, the problem studied is designing a residual generator for fault detection based on multirate sampled data. The key new feature of such a residual generator is that it operates at a fast rate for prompt fault detection. The design is based on optimizing a performance index to obtain an optimal parity space based residual generator. The lifting technique is used to convert the time-varying multirate design problem into a time-invariant one with a causality constraint for implementability. A procedure for computing an explicit optimal, causal solution is proposed. The advantages of this design are shown through an example.     

Distributed Adaptive Dynamic Surface Control for Synchronization of Uncertain Nonlinear Multi-agent Systems

In this paper a distributed adaptive dynamic surface controller is proposed for multi-agent systems under fixed directed graph topologies. The agents have uncertain nonlinear dynamics and are influenced by bounded unknown disturbances. The controller should synchronize the states of all agents with the corresponding states of the nonautonomous leader. It is proved that, with the proposed controller, the synchronization error remains bounded; and the bounds can be arbitrarily decreased by increasing the controller gains. The control rules are designed such that each agent only requires the state information of its neighbors, rendering a distributed control. The effectiveness of the proposed method is demonstrated through two simulation examples.     

A protection strategy for inverter-interfaced islanded microgrids with looped configuration

Electrical Engineering - Development of an efficient protection strategy is one of the main barriers in paving the way for the implementation of inverter-based microgrids. The limited fault current...