Nonlinear state-observer techniques for sensorless control of automotive PMSM's, including load-torque estimation and saliency

The paper investigates various non-linear observer-based rotor position estimation schemes for sensorless control of permanent magnet synchronous motors (PMSMs). Attributes of particular importance to the application of brushless motors in the automotive sector, are considered e.g. implementation cost, accuracy of predictions during load transients, the impact of motor saliency and algorithm complexity. Emphasis is given to techniques based on model linearisation during each sampling period (EKF); feedback-linearisation followed by Luenberger observer design based on the resulting �linear� motor characteristics; and direct design of non-linear observers. Although the benefits of sensorless commutation of PMSMs have been well expounded in the literature, an integrated approach to their design for application to salient machines subject to load torque transients remains outstanding. Furthermore, this paper shows that the inherent characteristics of some non-linear observer structures are particularly attractive since they provide a phase-locked-loop (PLL)-type of configuration that can encourage stable rotor position estimation, thereby enhancing the overall sensorless scheme. Moreover, experimental results show how operation through, and from, zero speed, is readily obtainable. Experimental results are also employed to demonstrate the attributes of each methodology, and provide dynamic and computational performance comparisons

Dimensioning backbone networks for multi-site data centers: exploiting anycast routing for resilience

In the current era of big data, applications increasingly rely on powerful computing infrastructure residing in large data centers (DCs), often adopting cloud computing technology. Clearly, this necessitates efficient and resilient networking infrastructure to connect the users of these applications with the data centers hosting them. In this paper, we focus on backbone network infrastructure on large geographical scales (i.e., the so-called wide area networks), which typically adopts optical network technology. In particular, we study the problem of dimensioning such backbone networks: what bandwidth should each of the links provide for the traffic, originating at known sources, to reach the data centers? And possibly even: how many such DCs should we deploy, and at what locations? More concretely, we summarize our recent work that essentially addresses the following fundamental research questions: (1) Does the anycast routing strategy influence the amount of required network resources? (2) Can we exploit anycast routing for resilience purposes, i.e., relocate to a different DC under failure conditions, to reduce resource capacity requirements? (3) Is it advantageous to change anycast request destinations from one DC location to the other, from one time period to the next, if service requests vary over time

Bigerbes

The bigerbes introduced here give a refinement of the notion of 2-gerbes, representing degree four integral cohomology classes of a space. Defined in terms of bisimplicial line bundles, bigerbes have a symmetry with respect to which they form 'bundle 2-gerbes' in two ways; this structure replaces higher associativity conditions. We provide natural examples, including a Brylinski-McLaughlin bigerbe associated to a principal G-bundle for a simply connected simple Lie group. This represents the first Pontryagin class of the bundle, and is the obstruction to the lifting problem on the associated principal bundle over the loop space to the structure group consisting of a central extension of the loop group; in particular, trivializations of this bigerbe for a spin manifold are in bijection with string structures on the original manifold. Other natural examples represent 'decomposable' 4-classes arising as cup products, a universal bigerbe on K(Z,4) involving its based double loop space, and the representation of any 4-class on a space by a bigerbe involving its free double loop space. The generalization to 'multigerbes' of arbitrary degree is also described.Comment: 56 pages. Version 2 includes the free loop version of the Brylinski-McLaughlin bigerbe and its relation to string structures, as well as a discussion of multigerbes of arbitrary orde

GA-based tuning of nonlinear observers for sensorless control of IPMSMs

The paper considers two observer-based rotor position estimation schemes for sensorless control of interior permanent magnet synchronous machines (IPMSMs). Emphasis is given to techniques based on feedback linearisation followed by Luenberger observer design, and direct design of nonlinear observers. Genetic algorithms (GAs) based on the principles of evolution, natural selection and genetic mutation are employed to address difficulties in selecting correction gains for the observers, since no analytical tuning mechanisms yet exist, with results included to demonstrate the enhanced performance attributes offered by observers tuned in this way

Resilience options for provisioning anycast cloud services with virtual optical networks

Optical networks are crucial to support increasingly demanding cloud services. Delivering the requested quality of services (in particular latency) is key to successfully provisioning end-to-end services in clouds. Therefore, as for traditional optical network services, it is of utter importance to guarantee that clouds are resilient to any failure of either network infrastructure (links and/or nodes) or data centers. A crucial concept in establishing cloud services is that of network virtualization: the physical infrastructure is logically partitioned in separate virtual networks. To guarantee end-to-end resilience for cloud services in such a set-up, we need to simultaneously route the services and map the virtual network, in such a way that an alternate routing in case of physical resource failures is always available. Note that combined control of the network and data center resources is exploited, and the anycast routing concept applies: we can choose the data center to provide server resources requested by the customer to optimize resource usage and/or resiliency. This paper investigates the design of scalable optimization models to perform the virtual network mapping resiliently. We compare various resilience options, and analyze their compromise between bandwidth requirements and resiliency quality