Discrete element calculations of the impact of a sand column against rigid structures

Discrete particle simulations of column of an aggregate of identical particles impacting a rigid, fixed target and a rigid, movable target are presented with the aim to understand the interaction of an aggregate of particles upon a structure. In most cases the column of particles is constrained against lateral expansion. The pressure exerted by the particles upon the fixed target (and the momentum transferred) is independent of the co-efficient of restitution and friction co-efficient between the particles but are strongly dependent upon the relative density of the particles in the column. There is a mild dependence on the contact stiffness between the particles which controls the elastic deformation of the densified aggregate of particles. In contrast, the momentum transfer to a movable target is strongly sensitive to the mass ratio of column to target. The impact event can be viewed as an inelastic collision between the sand column and the target with an effective co-efficient of restitution between 0 and 0.35 depending upon the relative density of the column. We present a foam analogy where impact of the aggregate of particles can be modelled by the impact of an equivalent foam projectile. The calculations on the equivalent projectile are significantly less intensive computationally and yet give predictions to within 5% of the full discrete particle calculations. They also suggest that "model" materials can be used to simulate the loading by an aggregate of particles within a laboratory setting. © 2012 Elsevier Ltd. All rights reserved.

Stress-strain response of hydrate-bearing sands: Numerical study using discrete element method simulations

Gas hydrate is a crystalline solid found within marine and subpermafrost sediments. While the presence of hydrates can have a profound effect on sediment properties, the stress-strain behavior of hydrate-bearing sediments is poorly understood due to inherent limitations in laboratory testing. In this study, we use numerical simulations to improve our understanding of the mechanical behavior of hydrate-bearing sands. The hydrate mass is simulated as either small randomly distributed bonded grains or as "ripened hydrate" forming patchy saturation, whereby sediment clusters with 100% pore-filled hydrate saturation are distributed within a hydrate-free sediment. Simulation results reveal that reduced sand porosity and higher hydrate saturation cause an increase in stiffness, strength, and dilative tendency, and the critical state line shifts toward higher void ratio and higher shear strength. In particular, the critical state friction angle increases in sands with patchy saturation, while the apparent cohesion is affected the most when the hydrate mass is distributed in pores. Sediments with patchy hydrate distribution exhibit a slightly lower strength than sediments with randomly distributed hydrate. Finally, hydrate dissociation under drained conditions leads to volume contraction and/or stress relaxation, and pronounced shear strains can develop if the hydrate-bearing sand is subjected to deviatoric loading during dissociation.

Centrifuge and discrete element modelling of tunnelling effects on pipelines

The paper presents centrifuge test data of the problem of tunnelling effects on buried pipelines and compares them to predictions made using DEM simulations. The paper focuses on the examination of pipeline bending moments, their distribution along the pipe, and their development with tunnel volume loss. Centrifuge results are obtained by PIV analysis and compared to results obtained using the DEM model. The DEM model was built to replicate the centrifuge model as closely as possible and included numerical features formulated specially for this task, such as structural elements to replicate the tunnel and pipeline. Results are extremely encouraging, with deviations between DEM and centrifuge test bending moment results being very small. © 2010 Taylor & Francis Group, London.

The Gaussian mixture MCMC particle algorithm for dynamic cluster tracking

We present a novel filtering algorithm for tracking multiple clusters of coordinated objects. Based on a Markov chain Monte Carlo (MCMC) mechanism, the new algorithm propagates a discrete approximation of the underlying filtering density. A dynamic Gaussian mixture model is utilized for representing the time-varying clustering structure. This involves point process formulations of typical behavioral moves such as birth and death of clusters as well as merging and splitting. For handling complex, possibly large scale scenarios, the sampling efficiency of the basic MCMC scheme is enhanced via the use of a Metropolis within Gibbs particle refinement step. As the proposed methodology essentially involves random set representations, a new type of estimator, termed the probability hypothesis density surface (PHDS), is derived for computing point estimates. It is further proved that this estimator is optimal in the sense of the mean relative entropy. Finally, the algorithm's performance is assessed and demonstrated in both synthetic and realistic tracking scenarios. © 2012 Elsevier Ltd. All rights reserved.

Representations and algorithms for finite-state bisimulations of linear discrete-time control systems

While a large amount of research over the past two decades has focused on discrete abstractions of infinite-state dynamical systems, many structural and algorithmic details of these abstractions remain unknown. To clarify the computational resources needed to perform discrete abstractions, this paper examines the algorithmic properties of an existing method for deriving finite-state systems that are bisimilar to linear discrete-time control systems. We explicitly find the structure of the finite-state system, show that it can be enormous compared to the original linear system, and give conditions to guarantee that the finite-state system is reasonably sized and efficiently computable. Though constructing the finite-state system is generally impractical, we see that special cases could be amenable to satisfiability based verification techniques. ©2009 IEEE.

Modeling fatigue crack growth in crystalline solids with discrete dislocation plasticity

Analyses of crack growth under cyclic loading conditions are discussed where plastic flow arises from the motion of large numbers of discrete dislocations and the fracture properties are embedded in a cohesive surface constitutive relation. The formulation is the same as used to analyse crack growth under monotonic loading conditions, differing only in the remote loading being a cyclic function of time. Fatigue, i.e. crack growth in cyclic loading at a driving force for which the crack would have arrested under monotonic loading, emerges in the simulations as a consequence of the evolution of internal stresses associated with the irreversibility of the dislocation motion. A fatigue threshold, Paris law behaviour, striations, the accelerated growth of short cracks and the scaling with material properties are outcomes of the calculations. Results for single crystals and polycrystals will be discussed.

Gaussian Approximation Potential: an interatomic potential derived from first principles Quantum Mechanics

Simulation of materials at the atomistic level is an important tool in studying microscopic structure and processes. The atomic interactions necessary for the simulation are correctly described by Quantum Mechanics. However, the computational resources required to solve the quantum mechanical equations limits the use of Quantum Mechanics at most to a few hundreds of atoms and only to a small fraction of the available configurational space. This thesis presents the results of my research on the development of a new interatomic potential generation scheme, which we refer to as Gaussian Approximation Potentials. In our framework, the quantum mechanical potential energy surface is interpolated between a set of predetermined values at different points in atomic configurational space by a non-linear, non-parametric regression method, the Gaussian Process. To perform the fitting, we represent the atomic environments by the bispectrum, which is invariant to permutations of the atoms in the neighbourhood and to global rotations. The result is a general scheme, that allows one to generate interatomic potentials based on arbitrary quantum mechanical data. We built a series of Gaussian Approximation Potentials using data obtained from Density Functional Theory and tested the capabilities of the method. We showed that our models reproduce the quantum mechanical potential energy surface remarkably well for the group IV semiconductors, iron and gallium nitride. Our potentials, while maintaining quantum mechanical accuracy, are several orders of magnitude faster than Quantum Mechanical methods.

Optimal constraint tightening policies for robust variable horizon model predictive control

This paper develops a technique for improving the region of attraction of a robust variable horizon model predictive controller. It considers a constrained discrete-time linear system acted upon by a bounded, but unknown time-varying state disturbance. Using constraint tightening for robustness, it is shown how the tightening policy, parameterised as direct feedback on the disturbance, can be optimised to increase the volume of an inner approximation to the controller's true region of attraction. Numerical examples demonstrate the benefits of the policy in increasing region of attraction volume and decreasing the maximum prediction horizon length. © 2012 IEEE.

Balanced realisations of all-pass systems using exact arithmetic with application to the approximation of delay systems

Numerically well-conditioned state-space realisations for all-pass systems, such as Padé approximations to exp(-s), are derived that can be computed using exact integer arithmetic. This is then applied to the a series of functions of exp(-s). It is also shown that the H-infinity norm of the transfer function from the input to the state of a balanced realisation of the Padé approximation of exp(-s) is unity. © 2012 IEEE.

A PDE viewpoint on basic properties of coordination algorithms with symmetries

Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with respect to a uniform translation of all subsystem values. The present paper shows that in presence of such symmetry, fundamental properties can be highlighted by viewing the distributed system as the discrete approximation of a partial differential equation. An important fact is that the symmetry on the state space differs from the popular spatial invariance property, which is not necessary for the present results. The relevance of the viewpoint is illustrated on two examples: (i) ill-conditioning of interaction matrices in coordination/consensus problems and (ii) the string instability issue. ©2009 IEEE.

Continuous dynamical systems that realize discrete optimization on the hypercube

We study the problem of finding a local minimum of a multilinear function E over the discrete set {0,1}n. The search is achieved by a gradient-like system in [0,1]n with cost function E. Under mild restrictions on the metric, the stable attractors of the gradient-like system are shown to produce solutions of the problem, even when they are not in the vicinity of the discrete set {0,1}n. Moreover, the gradient-like system connects with interior point methods for linear programming and with the analog neural network studied by Vidyasagar (IEEE Trans. Automat. Control 40 (8) (1995) 1359), in the same context. © 2004 Elsevier B.V. All rights reserved.