Minimalistic models of an energy-efficient vertical-hopping robot

The use of free vibration in elastic structure can lead to energy-efficient robot locomotion, since it significantly reduces the energy expenditure if properly designed and controlled. However, it is not well understood how to harness the dynamics of free vibration for the robot locomotion, because of the complex dynamics originated in discrete events and energy dissipation during locomotion. From this perspective, the goals of this paper are to propose a design strategy of hopping robot based on elastic curved beams and actuated rotating masses and to identify the minimalistic model that can characterize the basic principle of robot locomotion. Since the robot mainly exhibits vertical hopping, three 1-D models are examined that contain different configurations of simple spring-damper-mass components. The real-world and simulation experiments show that one of the models best characterizes the robot hopping, through analyzing the basic kinematics and negative works in actuation. Based on this model, the self-stability of hopping motion under disturbances is investigated, and design and control parameters are analyzed for the energy-efficient hopping. In addition, further analyses show that this robot can achieve the energy-efficient hopping with the variation in payload, and the source of energy dissipation of the robot hopping is investigated. © 1982-2012 IEEE.

Minimalistic models of an energy efficient vertical hopping robot

The use of free vibration in elastic structure can lead to energy efficient robot locomotion, since it significantly reduces the energy expenditure if properly designed and controlled. However, it is not well understood how to harness the dynamics of free vibration for the robot locomotion, because of the complex dynamics originated in discrete events and energy dissipation during locomotion. From this perspective, this paper explores three minimalistic models of free vibration that can characterize the basic principle of robot locomotion. Since the robot mainly exhibits vertical hopping, three one-dimensional models are examined that contain different configurations of simple spring-damper-mass components. The self-stability of these models are also investigated in simulation. The real-world and simulation experiments show that one of the models best characterizes the robot hopping, through analyzing the basic kinematics and negative works in actuation. Based on this model, the control parameters are analyzed for the energy efficient hopping. © 2013 IEEE.

Influence of a building's integrated-photovoltaics on heating and cooling loads

Building integrated photovoltaics (BIPV) has the potential to become a major source of renewable energy in the urban environment. BIPV has significant influence on the heat transfer through the building envelope because of the change of the thermal resistance by adding or replacing the building elements. Four different roofs are used to assess the impacts of BIPV on the building's heating-and-cooling loads; namely ventilated air-gap BIPV, non-ventilated (closed) air-gap BIPV, closeroof mounted BIPV, and the conventional roof with no PV and no air gap. One-dimensional transient models of four cases are derived to evaluate the PV performances and building cooling-and-heating loads across the different roofs in order to select the appropriate PV building integration method in Tianjin, China. The simulation results show that the PV roof with ventilated air-gap is suitable for the application in summer because this integration leads to the low cooling load and high PV conversion efficiency. The PV roof with ventilation air-gap has a high time lag and small decrement factor in comparison with other three roofs and has the same heat gain as the cool roof of absorptance 0.4. In winter, BIPV of non-ventilated air gap is more appropriate due to the combination of the low heating-load through the PV roof and high PV electrical output. © 2005 Elsevier Ltd. All rights reserved.

Exploiting Chinese character models to improve speech recognition performance

The Chinese language is based on characters which are syllabic in nature. Since languages have syllabotactic rules which govern the construction of syllables and their allowed sequences, Chinese character sequence models can be used as a first level approximation of allowed syllable sequences. N-gram character sequence models were trained on 4.3 billion characters. Characters are used as a first level recognition unit with multiple pronunciations per character. For comparison the CU-HTK Mandarin word based system was used to recognize words which were then converted to character sequences. The character only system error rates for one best recognition were slightly worse than word based character recognition. However combining the two systems using log-linear combination gives better results than either system separately. An equally weighted combination gave consistent CER gains of 0.1-0.2% absolute over the word based standard system. Copyright © 2009 ISCA.

Models for acoustic propagation through turbofan exhaust flows-lined ducts

Turbomachinery noise radiating into the rearward arc is an important problem. This noise is scattered by the trailing edges of the nacelle and the jet exhaust, and interacts with the shear layers between the external flow, bypass stream and jet, en route to the far field. In the past a range of relevant model problems involving semi-infinite cylinders have been solved. However, one limitation of these previous solutions is that they do not allow for the jet nozzle protruding a finite distance beyond the end of the nacelle (or in certain configurations being buried a finite distance upstream). With this in mind, we have used the matrix Wiener-Hopf technique to allow precisely this finite nacelle-jet nozzle separation to be included. We have previously reported results for the case of hard-walled ducts, which requires factorisation of a 2 × 2 matrix. In this paper we extend this work by allowing one of the duct walls, in this case the outer wall of the jet pipe, to be acoustically lined. This results in the need to factorise a 3 × 3 matrix, which is completed by use of a combination of pole-removal and Pad́e approximant techniques. Sample results are presented, investigating in particular the effects of exit plane stagger and liner impedance. Here we take the mean flow to be zero, but extension to nonzero Mach numbers in the core and bypass flow has also been completed. Copyright © 2009 by Nigel Peake & Ben Veitch.

Sequential decision making in general state space models

Many problems in control and signal processing can be formulated as sequential decision problems for general state space models. However, except for some simple models one cannot obtain analytical solutions and has to resort to approximation. In this thesis, we have investigated problems where Sequential Monte Carlo (SMC) methods can be combined with a gradient based search to provide solutions to online optimisation problems. We summarise the main contributions of the thesis as follows. Chapter 4 focuses on solving the sensor scheduling problem when cast as a controlled Hidden Markov Model. We consider the case in which the state, observation and action spaces are continuous. This general case is important as it is the natural framework for many applications. In sensor scheduling, our aim is to minimise the variance of the estimation error of the hidden state with respect to the action sequence. We present a novel SMC method that uses a stochastic gradient algorithm to find optimal actions. This is in contrast to existing works in the literature that only solve approximations to the original problem. In Chapter 5 we presented how an SMC can be used to solve a risk sensitive control problem. We adopt the use of the Feynman-Kac representation of a controlled Markov chain flow and exploit the properties of the logarithmic Lyapunov exponent, which lead to a policy gradient solution for the parameterised problem. The resulting SMC algorithm follows a similar structure with the Recursive Maximum Likelihood(RML) algorithm for online parameter estimation. In Chapters 6, 7 and 8, dynamic Graphical models were combined with with state space models for the purpose of online decentralised inference. We have concentrated more on the distributed parameter estimation problem using two Maximum Likelihood techniques, namely Recursive Maximum Likelihood (RML) and Expectation Maximization (EM). The resulting algorithms can be interpreted as an extension of the Belief Propagation (BP) algorithm to compute likelihood gradients. In order to design an SMC algorithm, in Chapter 8 uses a nonparametric approximations for Belief Propagation. The algorithms were successfully applied to solve the sensor localisation problem for sensor networks of small and medium size.

Sequential Monte Carlo computation of the score and observed information matrix in state-space models with application to parameter estimation

Sequential Monte Carlo (SMC) methods are popular computational tools for Bayesian inference in non-linear non-Gaussian state-space models. For this class of models, we propose SMC algorithms to compute the score vector and observed information matrix recursively in time. We propose two different SMC implementations, one with computational complexity $\mathcal{O}(N)$ and the other with complexity $\mathcal{O}(N^{2})$ where $N$ is the number of importance sampling draws. Although cheaper, the performance of the $\mathcal{O}(N)$ method degrades quickly in time as it inherently relies on the SMC approximation of a sequence of probability distributions whose dimension is increasing linearly with time. In particular, even under strong \textit{mixing} assumptions, the variance of the estimates computed with the $\mathcal{O}(N)$ method increases at least quadratically in time. The $\mathcal{O}(N^{2})$ is a non-standard SMC implementation that does not suffer from this rapid degrade. We then show how both methods can be used to perform batch and recursive parameter estimation.

Learning the Structure of Deep Sparse Graphical Models

Deep belief networks are a powerful way to model complex probability distributions. However, learning the structure of a belief network, particularly one with hidden units, is difficult. The Indian buffet process has been used as a nonparametric Bayesian prior on the directed structure of a belief network with a single infinitely wide hidden layer. In this paper, we introduce the cascading Indian buffet process (CIBP), which provides a nonparametric prior on the structure of a layered, directed belief network that is unbounded in both depth and width, yet allows tractable inference. We use the CIBP prior with the nonlinear Gaussian belief network so each unit can additionally vary its behavior between discrete and continuous representations. We provide Markov chain Monte Carlo algorithms for inference in these belief networks and explore the structures learned on several image data sets.

APPLICATION OF CENTRIFUGE MODELS IN THE STUDY OF AN INTERACTION PROBLEM.

Rigid retaining walls are considered. Both the backfill and the soil supporting the foundation of the model wall have been made of a single dry granular soil. Attention is limited to one grain.

Gaussian mixture modeling with Gaussian process latent variable models

Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristics of the data. Recently, the Gaussian Process Latent Variable Model (GPLVM) has successfully been used to find low dimensional manifolds in a variety of complex data. The GPLVM consists of a set of points in a low dimensional latent space, and a stochastic map to the observed space. We show how it can be interpreted as a density model in the observed space. However, the GPLVM is not trained as a density model and therefore yields bad density estimates. We propose a new training strategy and obtain improved generalisation performance and better density estimates in comparative evaluations on several benchmark data sets. © 2010 Springer-Verlag.

Cross-Lingual spoken language understanding from unaligned data using discriminative classification models and machine translation

This paper investigates several approaches to bootstrapping a new spoken language understanding (SLU) component in a target language given a large dataset of semantically-annotated utterances in some other source language. The aim is to reduce the cost associated with porting a spoken dialogue system from one language to another by minimising the amount of data required in the target language. Since word-level semantic annotations are costly, Semantic Tuple Classifiers (STCs) are used in conjunction with statistical machine translation models both of which are trained from unaligned data to further reduce development time. The paper presents experiments in which a French SLU component in the tourist information domain is bootstrapped from English data. Results show that training STCs on automatically translated data produced the best performance for predicting the utterance's dialogue act type, however individual slot/value pairs are best predicted by training STCs on the source language and using them to decode translated utterances. © 2010 ISCA.

An examination of strain space versus stress space for the formulation of elastoplastic constitutive models

Several elastoplastic soil models have been proposed over the years that are formulated in strain space rather than stress space due to certain analytical and computational advantages. One such model, BRICK (Simpson 1992), has been continuously utilized and developed for industrial applications within Arup Geotechnics for more than two decades. This paper aims to describe the advantages and difficulties associated with strain space modeling. In addition, it will show how recent advances in modeling the effects of stress history, stiffness anisotropy, strength anisotropy and time-dependence in conventional stress space models can be transferred to the BRICK model. © 2010 Taylor & Francis Group, London.

Global analysis of dynamical decision-making models through local computation around the hidden saddle

Bistable dynamical switches are frequently encountered in mathematical modeling of biological systems because binary decisions are at the core of many cellular processes. Bistable switches present two stable steady-states, each of them corresponding to a distinct decision. In response to a transient signal, the system can flip back and forth between these two stable steady-states, switching between both decisions. Understanding which parameters and states affect this switch between stable states may shed light on the mechanisms underlying the decision-making process. Yet, answering such a question involves analyzing the global dynamical (i.e., transient) behavior of a nonlinear, possibly high dimensional model. In this paper, we show how a local analysis at a particular equilibrium point of bistable systems is highly relevant to understand the global properties of the switching system. The local analysis is performed at the saddle point, an often disregarded equilibrium point of bistable models but which is shown to be a key ruler of the decision-making process. Results are illustrated on three previously published models of biological switches: two models of apoptosis, the programmed cell death and one model of long-term potentiation, a phenomenon underlying synaptic plasticity. © 2012 Trotta et al.

Delayed decision-making in bistable models

Switching between two modes of operation is a common property of biological systems. In continuous-time differential equation models, this is often realised by bistability, i.e. the existence of two asymptotically stable steadystates. Several biological models are shown to exhibit delayed switching, with a pronounced transient phase, in particular for near-threshold perturbations. This study shows that this delay in switching from one mode to the other in response to a transient input is reflected in local properties of an unstable saddle point, which has a one dimensional unstable manifold with a significantly slower eigenvalue than the stable ones. Thus, the trajectories first approximatively converge to the saddle point, then linger along the saddle's unstable manifold before quickly approaching one of the stable equilibria. ©2010 IEEE.