120 research outputs found

    Co-design of a controller and its digital implementation: the MOBY-DIC2 toolbox for embedded model predictive control

    Get PDF
    Several software tools are available in the literature for the design and embedded implementation of linear model predictive control (MPC), both in its implicit and explicit (either exact or approximate) forms. Most of them generate C code for easy implementation on a microcontroller, and the others can convert the C code into hardware description language code for implementation on a field programmable gate array (FPGA). However, a unified tool allowing one to generate efficient embedded MPC for an FPGA, starting from the definition of the plant and its constraints, was still missing. The MOBY-DIC2 toolbox described in this brief bridges this gap. To illustrate its functionalities, the tool is exploited to embed the controller and observer for a real buck power converter in an FPGA. This implementation achieves a latency of about 30 µs with the implicit controller and 240 μs with the approximate explicit controller

    Custom optimization algorithms for efficient hardware implementation

    No full text
    The focus is on real-time optimal decision making with application in advanced control systems. These computationally intensive schemes, which involve the repeated solution of (convex) optimization problems within a sampling interval, require more efficient computational methods than currently available for extending their application to highly dynamical systems and setups with resource-constrained embedded computing platforms. A range of techniques are proposed to exploit synergies between digital hardware, numerical analysis and algorithm design. These techniques build on top of parameterisable hardware code generation tools that generate VHDL code describing custom computing architectures for interior-point methods and a range of first-order constrained optimization methods. Since memory limitations are often important in embedded implementations we develop a custom storage scheme for KKT matrices arising in interior-point methods for control, which reduces memory requirements significantly and prevents I/O bandwidth limitations from affecting the performance in our implementations. To take advantage of the trend towards parallel computing architectures and to exploit the special characteristics of our custom architectures we propose several high-level parallel optimal control schemes that can reduce computation time. A novel optimization formulation was devised for reducing the computational effort in solving certain problems independent of the computing platform used. In order to be able to solve optimization problems in fixed-point arithmetic, which is significantly more resource-efficient than floating-point, tailored linear algebra algorithms were developed for solving the linear systems that form the computational bottleneck in many optimization methods. These methods come with guarantees for reliable operation. We also provide finite-precision error analysis for fixed-point implementations of first-order methods that can be used to minimize the use of resources while meeting accuracy specifications. The suggested techniques are demonstrated on several practical examples, including a hardware-in-the-loop setup for optimization-based control of a large airliner.Open Acces

    Improved Convergence Bounds For Operator Splitting Algorithms With Rare Extreme Errors

    Full text link
    In this paper, we improve upon our previous work[24,22] and establish convergence bounds on the objective function values of approximate proximal-gradient descent (AxPGD), approximate accelerated proximal-gradient descent (AxAPGD) and approximate proximal ADMM (AxWLM-ADMM) schemes. We consider approximation errors that manifest rare extreme events and we propagate their effects through iterations. We establish probabilistic asymptotic and non-asymptotic convergence bounds as functions of the range (upper/lower bounds) and variance of approximation errors. We use the derived bound to assess AxPGD in a sparse model predictive control of a spacecraft system and compare its accuracy with previously derived bounds

    Final Causality in the Thought of Thomas Aquinas

    Get PDF
    Throughout his corpus, Thomas Aquinas develops an account of final causality that is both philosophically nuanced and interesting. The aim of my dissertation is to provide a systematic reconstruction of this account of final causality, one that clarifies its motivation and appeal. The body of my dissertation consists of four chapters. In Chapter 1, I examine the metaphysical underpinnings of Aquinas’s account of final causality by focusing on how Aquinas understands the causality of the final cause. I argue that Aquinas holds that an end is a cause because it is the determinate effect toward which an agent’s action is directed. I proceed by first presenting the general framework of causality within which Aquinas understands final causality. I then consider how Aquinas justifies the reality of each of the four kinds of cause, placing special emphasis on the final cause. In Chapter 2, I consider final causality from the perspective of goodness and explore the reasons why Aquinas thinks that the end of an action is always good. For even if one was convinced that the end of an action is indeed a cause, one might still resist attributing any normative or evaluative properties to the end, much less a positively-valenced normative property like goodness. In this chapter, I show how, given Aquinas’s metaphysics of powers and his characterization of goodness as that which all desire, it follows that every action is for the sake of some good. In Chapter 3, I consider Aquinas’s account of the relation between final causality and cognition. In many passages throughout his corpus—most famously in the fifth of his Five Ways—Aquinas advances the claim that cognition plays an essential role in final causality. In this chapter, I explore Aquinas’s account of the relation between final causality and cognition by reconstructing his Fifth Way and investigating the metaphysical foundations on which it rests. While the first three chapters of my dissertation focus on Aquinas’s account of final causality from the perspective of the ends of individual agents, in Chapter 4 I broaden my focus to consider the way in which the account of final causality developed in these earlier chapters shapes Aquinas’s philosophical cosmology. I argue that, on Aquinas’s view, when an individual agent acts for an end, it is plays a role in a larger system, e.g. a polis, an ecosystem, or the universe itself

    Wireless Communications in the Era of Big Data

    Full text link
    The rapidly growing wave of wireless data service is pushing against the boundary of our communication network's processing power. The pervasive and exponentially increasing data traffic present imminent challenges to all the aspects of the wireless system design, such as spectrum efficiency, computing capabilities and fronthaul/backhaul link capacity. In this article, we discuss the challenges and opportunities in the design of scalable wireless systems to embrace such a "bigdata" era. On one hand, we review the state-of-the-art networking architectures and signal processing techniques adaptable for managing the bigdata traffic in wireless networks. On the other hand, instead of viewing mobile bigdata as a unwanted burden, we introduce methods to capitalize from the vast data traffic, for building a bigdata-aware wireless network with better wireless service quality and new mobile applications. We highlight several promising future research directions for wireless communications in the mobile bigdata era.Comment: This article is accepted and to appear in IEEE Communications Magazin

    LCCC Workshop on Process Control

    Get PDF
    • …
    corecore