Multi-objective foundation optimization and its application to pile reuse

Pile reuse has become an increasingly popular option in foundation design, mainly due to its potential cost and environmental benefits and the problem of underground congestion in urban areas. However, key geotechnical concerns remain regarding the behavior of reused piles and the modeling of foundation systems involving old and new piles to support building loads of the new structure. In this paper, a design and analysis tool for pile reuse projects will be introduced. The tool allows coupling of superstructure stiffness with the foundation model, and includes an optimization algorithm to obtain the best configuration of new piles to work alongside reused piles. Under the concept of Pareto Optimality, multi-objective optimization analyses can also reveal the relationship between material usage and the corresponding foundation performance, providing a series of reuse options at various foundation costs. The components of this analysis tool will be discussed and illustrated through a case history in London, where 110 existing piles are reused at a site to support the proposed new development. The case history reveals the difficulties faced by foundation reuse in urban areas and demonstrates the application of the design tool to tackle these challenges. © ASCE 2011.

Multi-fidelity simulation modelling in optimization of a hybrid submarine propulsion system

Multi-objective Genetic Algorithms have become a popular choice to aid in optimising the size of the whole hybrid power train. Within these optimisation processes, other optimisation techniques for the control strategy are implemented. This optimisation within an optimisation requires many simulations to be run, so reducing the computational cost is highly desired. This paper presents an optimisation framework consisting of a series hybrid optimisation algorithm, in which a global search optimizes a submarine propulsion system using low-fidelity models and, in order to refine the results, a local search is used with high-fidelity models. The effectiveness of the Hybrid optimisation algorithm is demonstrated with the optimisation of a submarine propulsion system. © 2011 EPE Association - European Power Electr.

Optimization of thermal material in a flux pump system with high temperature superconductor

Superconductors are known for the ability to trap magnetic field. A thermally actuated magnetization (TAM) flux pump is a system that utilizes the thermal material to generate multiple small magnetic pulses resulting in a high magnetization accumulated in the superconductor. Ferrites are a good thermal material candidate for the future TAM flux pumps because the relative permeability of ferrite changes significantly with temperature, particularly around the Curie temperature. Several soft ferrites have been specially synthesized to reduce the cost and improve the efficiency of the TAM flux pump. Various ferrite compositions have been tested under a temperature variation ranging from 77K to 300K. The experimental results of the synthesized soft ferrites-Cu 0.3 Zn 0.7Ti 0.04Fe 1.96O 4, including the Curie temperature, magnetic relative permeability and the volume magnetization (emu/cm3), are presented in this paper. The results are compared with original thermal material, gadolinium, used in the TAM flux pump system.-Cu 0.3 Zn 0.7Ti 0.04 Fe 1.96O 4 holds superior characteristics and is believed to be a suitable material for next generation TAM flux pump. © 2011 IEEE.

Sparsity-Inducing Optimization Algorithm for the Extraction of Planar Structures in Noisy Point-Cloud Data

Most of the manual labor needed to create the geometric building information model (BIM) of an existing facility is spent converting raw point cloud data (PCD) to a BIM description. Automating this process would drastically reduce the modeling cost. Surface extraction from PCD is a fundamental step in this process. Compact modeling of redundant points in PCD as a set of planes leads to smaller file size and fast interactive visualization on cheap hardware. Traditional approaches for smooth surface reconstruction do not explicitly model the sparse scene structure or significantly exploit the redundancy. This paper proposes a method based on sparsity-inducing optimization to address the planar surface extraction problem. Through sparse optimization, points in PCD are segmented according to their embedded linear subspaces. Within each segmented part, plane models can be estimated. Experimental results on a typical noisy PCD demonstrate the effectiveness of the algorithm.

Consensus optimization on manifolds

The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost function. This leads to efficient gradient algorithms to synchronize (i.e., maximizing the consensus) or balance (i.e., minimizing the consensus) the agents; a convenient adaptation of the gradient algorithms is used when the communication graph is directed and time-varying. The cost function is linked to a specific centroid definition on manifolds, introduced here as the induced arithmetic mean, that is easily computable in closed form and may be of independent interest for a number of manifolds. The special orthogonal group SO (n) and the Grassmann manifold Grass (p, n) are treated as original examples. A link is also drawn with the many existing results on the circle. © 2009 Society for Industrial and Applied Mathematics.

Collective optimization over average quantities

This paper addresses the design of algorithms for the collective optimization of a cost function defined over average quantities in the presence of limited communication. We argue that several meaningful collective optimization problems can be formulated in this way. As an application of the proposed approach, we propose a novel algorithm that achieves synchronization or balancing in phase models of coupled oscillators under mild connectedness assumptions on the (possibly time-varying and unidirectional) communication graphs. © 2006 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.

Minimum maneuver time calculation using convex optimization

The problem of calculating the minimum lap or maneuver time of a nonlinear vehicle, which is linearized at each time step, is formulated as a convex optimization problem. The formulation provides an alternative to previously used quasi-steady-state analysis or nonlinear optimization. Key steps are: the use of model predictive control; expressing the minimum time problem as one of maximizing distance traveled along the track centerline; and linearizing the track and vehicle trajectories by expressing them as small displacements from a fixed reference. A consequence of linearizing the vehicle dynamics is that nonoptimal steering control action can be generated, but attention to the constraints and the cost function minimizes the effect. Optimal control actions and vehicle responses for a 90 deg bend are presented and compared to the nonconvex nonlinear programming solution. Copyright © 2013 by ASME.

Multispacecraft refueling optimization considering the J2 perturbation and window constraints

The optimization of a near-circular low-Earth-orbit multispacecraft refueling problem is studied. The refueling sequence, service time, and orbital transfer time are used as design variables, whereas the mean mission completion time and mean propellant consumed by orbital maneuvers are used as design objectives. The J2 term of the Earth's nonspherical gravity perturbation and the constraints of rendezvous time windows are taken into account. A hybridencoding genetic algorithm, which uses normal fitness assignment to find the minimum mean propellant-cost solution and fitness assignment based on the concept of Pareto-optimality to find multi-objective optimal solutions, is presented. The proposed approach is demonstrated for a typical multispacecraft refueling problem. The results show that the proposed approach is effective, and that the J2 perturbation and the time-window constraints have considerable influences on the optimization results. For the problems in which the J2 perturbation is not accounted for, the optimal refueling order can be simply determined as a sequential order or as the order only based on orbitalplane differences. In contrast, for the problems that do consider the J2 perturbation, the optimal solutions obtained have a variety of refueling orders and use the drift of nodes effectively to reduce the propellant cost for eliminating orbital-plane differences. © 2013 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.

Fixed-rank matrix factorizations and Riemannian low-rank optimization

Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fixed-rank symmetric positive semidefinite matrices, apply to a broad range of applications, scale to high-dimensional problems, and confer a geometric basis to recent contributions on the learning of fixed-rank non-symmetric matrices. We make connections with existing algorithms in the context of low-rank matrix completion and discuss the usefulness of the proposed framework. Numerical experiments suggest that the proposed algorithms compete with state-of-the-art algorithms and that manifold optimization offers an effective and versatile framework for the design of machine learning algorithms that learn a fixed-rank matrix. © 2013 Springer-Verlag Berlin Heidelberg.