Filetype
Student–industry activities are often heralded as win–win–win activities in which students gain knowledge of their future professional fields, companies access student knowledge, and universities both offer students stimulating learning opportunities and strengthen ties with industry. Student–industry projects can be defined as an active learning methodology characterized by pedagogical values suc
Geometric reconstruction from image collections is a classical computer vision problem. The problem essentially consists of two steps; First, the identification of matches and assembling of point tracks, and second, multiple view geometry computations. In this paper we address the problem of constructing point tracks using graph theoretical algorithms. From standard descriptor matches between all
We propose a distributed learning algorithm for fair scheduling in common-pool games. Common-pool games are strategic-form games where multiple agents compete over utilizing a limited common resource. A characteristic example is the medium access control problem in wireless communications, where multiple users need to decide how to share a single communication channel so that there are no collisio
This note studies lumped-delay approximations of distributed-delay elements arising in various problems involving delay compensation or preview utilization. Several approaches to reduce implementation complexity, understood as the number of delays required to attain a required accuracy level, are put forward. First, we derive the H2-optimal coefficients for a given delay pattern. This can be seen
In a dispatchable wind power plant, turbines are free to continuously vary their power production as long as the sum of their productions meets the total power demand. Previous research has shown that this freedom can be used to reduce structural loads by allowing turbines in the plant to coordinate their power. This paper explains the mechanisms that make power coordination useful for reducing st
Abstract in UndeterminedFor assembly tasks, the knowledge of both trajectory and forces are usually required. Consequently, we may use kinesthetics or teleoperation for recording human demonstrations. In order to have a more natural interaction, the operator has to be provided with a sense of touch. We propose a bilateral teleoperation system which is customized for this purpose. We introduce diff
This paper describes how PID controllers can be designed by optimizing performance subject to robustness constraints. The optimization problem is solved using convex-concave programming. The method admits general process descriptions in terms of frequency response data and it can cope with many different constraints. Examples are presented and some pitfalls in optimization are discussed.
We investigate the out-of-sequence measurements particle filtering problem for a set of conditionally linear Gaussian state-space models, known as mixed linear/nonlinear state-space models. Two different algorithms are proposed, which both exploit the conditionally linear substructure. The first approach is based on storing only a subset of the particles and their weights, which implies low memory
This paper considers switching output feedback control of linear systems and variable structure systems. Theory for stability analysis and design for a class of observer-based feedback control systems is presented. A circle-criterion approach can be used to design an observer-based state feedback control which yields a closed-loop system with specified robustness characteristics. The approach is r
We are concerned with software that can self-adapt to satisfy certain reliability requirements, in spite of adverse changes affecting the environment in which it is embedded. Self-adapting software architectures are heavily based on dynamic binding. The bindings among components are dynamically set as the conditions that require a self-adaptation are discovered during the system's lifetime. By ado
The findings from a user study regarding particular ob- servable “interaction patterns” in the interaction during a “guided tour” are summarized in this paper.
The paper presents a CPS-oriented course that integrates control theory and embedded computing. The course combines concurrent real-time programming and analysis with discrete-time sampled control theory and real-time networking. The contents of course, including the course projects are described in the paper as well as the experiences with the course.
Machining processes in the industry of today are rarely performed using industrial robots. In the cases where robots are used, machining is often performed using position control with a conservative feed-rate, to avoid excessive process forces. There is a great benefit in controlling the process forces instead, so as to improve the time-efficiency by applying the maximum allowed force, and thus re
The problem of communicating one bit over a memoryless Gaussian channel with an energy constraint is discussed. It is assumed that the channel is allowed to be used only two times. An ideal feedback channel is also supposed available. The optimal feedback strategy and the bit-error probability are derived. It is shown that feedback gives a significant performance gain and that the optimal strategy
We investigate methods for detection of rapid workload increases (load spikes) for cloud workloads. Such rapid and unexpected workload spikes are a main cause for poor performance or even crashing applications as the allocated cloud resources become insufficient. To detect the spikes early is fundamental to perform corrective management actions, like allocating additional resources, before the spi
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to reduce the higher-order objective function to a quadratic pseudo-boolean function, and then use roof duality for obtaining a lower bound. Roof duality works by constructing the tightest possible lower-bounding submodular fun
Outliers pose a problem in all real structure from motion systems. Due to the use of automatic matching methods one has to expect that a (sometimes very large) portion of the detected correspondences can be incorrect. In this paper we propose a method that estimates the relative translation between two cameras and simultaneously maximizes the number of inlier correspondences. Traditionally, outlie
