Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 16
Encontrada(s) 1 página(s)

BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Multi-objective Optimization of Orbit Transfer Trajectory Using Imperialist Competitive Algorithm

  • Shirazi, A.
This paper proposes a systematic direct approach to carry out effective multi-objective optimization of space orbit transfer with high-level thrust acceleration. The objective is to provide a transfer trajectory with acceptable accuracy in all orbital parameters while minimizing spacecraft fuel consumption. With direct control parameterization, in which the steering angles of thrust vector are interpolated through a finite number of nodes, the optimal control problem is converted into the parameter optimization problem to be solved by nonlinear programming. Besides the thrust vector direction angles, the thrust magnitude is also considered as variable and unknown along with initial conditions. Since the deviation of thrust vector in spacecraft is limited in reality, mathematical modeling of thrust vector direction is carried out in order to satisfy constraints in maximum deviation of thrust vector direction angles. In this modeling, the polynomial function of each steering angle is defined by interpolation of a curve based on finite number of points in a specific range with a nominal center point with uniform distribution. This kind of definition involves additional parameters to the optimization problem which results the capability of search method in satisfying constraint on the variation of thrust direction angles. Thrust profile is also modeled based on polynomial functions of time with respect to solid and liquid propellant rockets. Imperialist competitive algorithm is used in order to find optimal coefficients of polynomial for thrust vector and the optimal initial states within the transfer. Results are mainly affected by the degree of polynomials involved in mathematical modeling of steering angles and thrust profile which results different optimal initial states where the transfer begins. It is shown that the proposed method is fairly beneficial in the viewpoint of optimality and convergence. The optimality of the technique is shown by comparing the finite thrust optimization with the impulsive analysis. Comparison shows that the accuracy is acceptable with respect to fair precision in orbital elements and minimum fuel mass. Also, the convergence of the optimization algorithm is investigated by comparing the solution of the problem with other optimization techniques such as Genetic Algorithm. Results confirms the practicality of Imperialist Competitive Algorithm in finding optimum variation of thrust vector which results best transfer accuracy along with minimizing fuel consumption.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

A novel adaptive density-based ACO algorithm with minimal encoding redundancy for clustering problems

  • Villar-Rodriguez, E.
  • Gonzalez-Pardo, A.
  • Del Ser, J.
  • Bilbao, M.N.
  • Salcedo-Sanz, S.
In the so-called Big Data paradigm descriptive analytics are widely conceived as techniques and models aimed at discovering knowledge within unlabeled datasets (e.g. patterns, similarities, etc) of utmost help for subsequent predictive and prescriptive methods. One of these techniques is clustering, which hinges on different multi-dimensional measures of similarity between unsupervised data instances so as to blindly collect them in groups of clusters. Among the myriad of clustering approaches reported in the literature this manuscript focuses on those relying on bio-inspired meta-heuristics, which have been lately shown to outperform traditional clustering schemes in terms of convergence, adaptability and parallelization. Specifically this work presents a new clustering approach based on the processing fundamentals of the Ant Colony Optimization (ACO) algorithm, i.e. stigmergy via pheromone trails and progressive construction of solutions through a graph. The novelty of the proposed scheme beyond previous research on ACO-based clustering lies on a significantly pruned graph that not only minimizes the representation redundancy of the problem at hand, but also allows for an embedded estimation of the number of clusters within the data. However, this approach imposes a modified ant behavior so as to account for the optimality of entire paths rather than that of single steps within the graph. Simulation results over conventional datasets will evince the promising performance of our approach and motivate further research aimed at its applicability to real scenarios.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Evolutionary algorithms to optimize low-thrust trajectory design in spacecraft orbital precession mission

  • Shirazi, A.
  • Ceberio, J.
  • Lozano, J.A.
In space environment, perturbations make the spacecraft lose its predefined orbit in space. One of these undesirable changes is the in-plane rotation of space orbit, denominated as orbital precession. To overcome this problem, one option is to correct the orbit direction by employing low-thrust trajectories. However, in addition to the orbital perturbation acting on the spacecraft, a number of parameters related to the spacecraft and its propulsion system must be optimized. This article lays out the trajectory optimization of orbital precession missions using Evolutionary Algorithms (EAs). In this research, the dynamics of spacecraft in the presence of orbital perturbation is modeled. The optimization approach is employed based on the parametrization of the problem according to the space mission. Numerous space mission cases have been studied in low and middle Earth orbits, where various types of orbital perturbations are acted on spacecraft. Consequently, several EAs are employed to solve the optimization problem. Results demonstrate the practicality of different EAs, along with comparing their convergence rates. With a unique trajectory model, EAs prove to be an efficient, reliable and versatile optimization solution, capable of being implemented in conceptual and preliminary design of spacecraft for orbital precession missions., IT-609-13 2013-2018, TIN2016-78365-R
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

The weighted independent domination problem: ILP model and algorithmic approaches

  • Davidson, P.P.
  • Blum, C.
  • Lozano, J.A.
This work deals with the so-called weighted independent domination problem, which is an N P -hard combinatorial optimization problem in graphs. In contrast to previous theoretical work from the liter- ature, this paper considers the problem from an algorithmic perspective. The first contribution consists in the development of an integer linear programming model and a heuristic that makes use of this model. Sec- ond, two greedy heuristics are proposed. Finally, the last contribution is a population-based iterated greedy algorithm that takes profit from the better one of the two developed greedy heuristics. The results of the compared algorithmic approaches show that small problem instances based on random graphs are best solved by an efficient integer linear programming solver such as CPLEX. Larger problem instances are best tackled by the population-based iterated greedy algorithm. The experimental evaluation considers random graphs of different sizes, densities, and ways of generating the node and edge weights.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Discretizations of the spectral fractional Laplacian on general domains with Dirichlet, Neumann, and Robin boundary conditions

  • Cusimano, N.
  • Del Teso, F.
  • Gerardo-Giorda, L.
  • Pagnini, G.
In this work, we propose novel discretisations of the spectral fractional Laplacian on bounded domains based on the integral formulation of the operator via the heat-semigroup formalism. Specifically, we combine suitable quadrature formulas of the integral with a finite element method for the approximation of the solution of the corresponding heat equation. We derive two families of discretisations with order of convergence depending on the regularity of the domain and the function on which the fractional Laplacian is acting. Unlike other existing approaches in literature, our method does not require the computation of the eigenpairs of the Laplacian on the considered domain, can be implemented on possibly irregular bounded domains, and can naturally handle different types of boundary constraints. Various numerical simulations are provided to illustrate performance of the proposed method and support our theoretical results., FdT acknowledges support of Toppforsk project Waves and Nonlinear Phenomena (WaNP), grant no. 250070 from the Research Council of Norway. ERCIM ``Alain Benoussan" Fellowship programme
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

ICCS 2017 Workshop on Agent-Based Simulations, Adaptive Algorithms and Solvers

  • Byrski, A.
  • Paszynski, M.
  • Schaefer, R.
  • Calo, V.M.
  • Pardo, D.
This workshop seeks to integrate results from different domains of computer science, computational science, and mathematics. We welcome simulation papers, either hard simulations using finite element or finite difference methods, or soft simulations by means of evolutionary computations, and related methods. The workshop focuses on simulations performed by using (a) agent-oriented systems; or (b) adaptive algorithms. Simulations performed by other kind of systems are also welcome. An agent-oriented system seems are attractive tools useful for numerous domains of applications. Adaptive algorithms significantly decrease on the computational cost by investing computational resources when needed by the problem.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Are the artificially generated instances uniform in terms of difficulty?

  • Pérez, A.
  • Ceberio, J.
  • Lozano, J.A.
In the field of evolutionary computation, it is usual to generate artificial benchmarks of instances that are used as a test-bed to determine the performance of the algorithms at hand. In this context, a recent work on permutation problems analyzed the implications of generating instances uniformly at random (u.a.r.) when building those benchmarks. Particularly, the authors analyzed instances as rankings of the solutions of the search space sorted according to their objective function value. Thus, two instances are considered equivalent when their objective functions induce the same ranking over the search space. Based on the analysis, they suggested that, when some restrictions hold, the probability to create easy rankings is higher than creating difficult ones. In this paper, we continue on that research line by adopting the framework of local search algorithms with the best improvement criterion. Particularly, we empirically analyze, in terms of difficulty, the instances (rankings) created u.a.r. of three popular problems: Linear Ordering Problem, Quadratic Assignment Problem and Flowshop Scheduling Problem. As the neighborhood system is critical for the performance of local search algorithms three different neighborhood systems have been considered: swap, interchange and insert. Conducted experiments reveal that (1) by sampling the parameters uniformly at random we obtain instances with a non-uniform distribution in terms of difficulty, (2) the distribution of the difficulty strongly depends on the pair problem-neighborhood considered, and (3) given a problem, the distribution of the difficulty seems to depend on the smoothness of the landscape induced by the neighborhood and on its size., Research Groups 2013-2018 (IT-609-13) TIN2016-78365-R(Spanish Ministry of Economy, Industry and Competitiveness)
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Bayesian inference for algorithm ranking analysis

  • Calvo, B.
  • Ceberio, J.
  • Lozano, J.A.
The statistical assessment of the empirical comparison of algorithms is an essential step in heuristic optimization. Classically, researchers have relied on the use of statistical tests. However, recently, concerns about their use have arisen and, in many fields, other (Bayesian) alternatives are being considered. For a proper analysis, different aspects should be considered. In this work we focus on the question: what is the probability of a given algorithm being the best? To tackle this question, we propose a Bayesian analysis based on the Plackett-Luce model over rankings that allows several algorithms to be considered at the same time
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Distance-based exponential probability models on constrained combinatorial optimization problems

  • Ceberio, J.
  • Mendiburu, A.
  • Lozano, J.A.
Estimation of distribution algorithms have already demonstrated their utility when solving a broad range of combinatorial problems. However, there is still room for methodological improvements when approaching constrained type problems. The great majority of works in the literature implement external repairing or penalty schemes, or use ad-hoc sampling methods in order to avoid unfeasible solutions. In this work, we present a new way to develop EDAs for this type of problems by implementing distance-based exponential probability models defined exclusively on the set of feasible solutions. In order to illustrate this procedure, we take the 2-partition balanced Graph Partitioning Problem as a case of study, and design efficient learning and sampling methods in order to use these distance-based probability models in EDAs.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Is minimising the convergence rate the best choice for efficient Optimized Schwarz preconditioning in heterogeneous coupling? The Stokes-Darcy case

  • Discacciati, M.
  • Gerardo-Giorda, L.
Optimized Schwarz Methods (OSM) are domain decomposition techniques based on Robin-type interface condition that have became increasingly popular in the last two decades. Ensuring convergence also on non-overlapping decompositions, OSM are naturally advocated for the heterogeneous coupling of multi-physics problems. Classical approaches optimize the coefficients in the Robin condition by minimizing the effective convergence rate of the resulting iterative algorithm. However, when OSM are used as preconditioners for Krylov solvers of the resulting interface problem, such parameter optimization does not necessarily guarantee the fastest convergence. This drawback is already known for homogeneous decomposition, but in the case of heterogeneous decomposition, the poor performance of the classical optimization approach becomes utterly evident. In this paper, we highlight this drawback for the Stokes/Darcy problem and we propose a more effective alternative optimization procedure., European Union Seventh Framework Programme (FP7/2007-2013; grant 294229) to M. Discacciati
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Simulation of the HarshLab floating platform for offshore experimentation using FEniCS-HPC

  • Moragues, M.
  • Castanon, D.
  • Jansson, J.
  • Nava, V.
  • Krishnasamy, E.
  • Degirmenci, N.C.
  • Nguyen, V.D.
  • Garrido, C.
  • Sanchez, M.
  • Rodriguez-Arias, R.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Effect of Tissue Elasticity in Cardiac Radiofrequency Catheter Ablation Models

  • Petras, A.
  • Leoni, M.
  • Guerra Ramos, J.M.
  • Jansson, J.
  • Gerardo-Giorda, L.
Radiofrequency catheter ablation (RFCA) is an effective treatment for different types of cardiac arrhythmias. However, major complications can occur, including thrombus formation and steam pops. We present a full 3D mathematical model for the radiofrequency ablation process that uses an open-irrigated catheter and accounts for the tissue deformation, an aspect overlooked by the existing literature. An axisymmetric Boussinesq solution for spherical punch is used to model the deformation of the tissue due to the pressure of the catheter tip at the tissue-catheter contact point. We compare the effect of the tissue deformation in the RFCA model against the use of a standard sharp insertion of the catheter in the tissue that other state-of- the-art RFCA computational models use., La Caixa 2016 PhD grant to M.L.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Computational Model for Prediction of the Occurrence of Steam Pops during Irrigated Radiofrequency Catheter Ablation

  • González-Suárez, A.
  • Berjano, E.
  • Guerra Ramos, J.M.
  • Gerardo-Giorda, L.
Radiofrequency catheter ablation (RFCA) is a curative treatment for cardiac arrhythmias. Although globally a pretty safe procedure, it may present some risk. Steam pop is a serious complication that can occur during RFCA with irrigated electrodes. Pops are caused by tissue overheating above 89oC, and may cause explosive rupture of myocardial wall. Today, it is still very complicated to predict the occurrence and location of steam pops into the tissue during RFCA. Our aim was to use a computational model to address these issues considering two irrigated catheter tip designs and different power settings. The model has been validated against existing experimental results. Computational results show no evidence of significant differences in the incidence of steam pops between the two catheter designs. Steam pops appears at powers higher than 30W at approximately 2 mm depth under the electrode tip. Overall, the computational findings were in close agreement with previous experimental results, which suggests that the proposed model could be useful to predict the occurrence of steam pops in different clinical situations., MINECO TEC2014–52383-C3-R to E.B. and Generalitat Valenciana APOSTD/2016/045 to A.G.S.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Finite Element Simulations of Two-phase Flow and Floating Bodies Using FEniCS-HPC

  • Moragues, M.
  • Castanon, D.
  • Degirmenci, N.C.
  • Jansson, J.
  • Nava, V.
  • Krishnasamy, E.
  • Hoffman, J.
We present a variational multiscale stabilized finite element method to solve the variable density incompressible Navier-Stokes equations for the simulation of two-phase flow. We introduce a level-set method based on the compression technique similar to [1]. For the simulation of floating devices we make use of a simplified rigid body motion scheme and a deforming mesh approach [2]. The mesh deforms elastically following the movement of the body. An implicit turbulence model is used where turbulence is modelled by the numerical stabilization. The described methods are implemented in the open source software framework FEniCS-HPC [3] provided with an automated methodology for discretization and error control. We are working in a project for marine energy generation together with Tecnalia R&I. In this context we simulate floating platforms that will be used for marine energy generation or device experimentation in the ocean. The aim is to study the dynamics of this kind of off-shore devices. Our simulation results are compared against the experimental data obtained by Tecnalia R&I company in the experimental tank of CEHIPAR in Spain. We also participate in the IEA-OES Task 10 project where different simulations of floating bodies are carried out. The results are compared against other groups simulations that use different methodologies.
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Centre-of-mass like superposition of Ornstein-Uhlenbeck processes: A pathway to non-autonomous stochastic differential equations and to fractional diffusion

  • D’Ovidio, M.
  • Vitali, S.
  • Sposini, V.
  • Sliusarenko, O.
  • Paradisi, P.
  • Castellani, G.
  • Pagnini, G.
We consider an ensemble of Ornstein–Uhlenbeck processes featuring a population of relaxation times and a population of noise amplitudes that characterize the heterogeneity of the ensemble. We show that the centre-of-mass like variable corresponding to this ensemble is statistically equivalent to a process driven by a non-autonomous stochastic differential equation with time-dependent drift and a white noise. In particular, the time scaling and the density function of such variable are driven by the population of timescales and of noise amplitudes, respectively. Moreover, we show that this variable is equivalent in distribution to a randomly-scaled Gaussian process, i.e., a process built by the product of a Gaussian process times a non-negative independent random variable. This last result establishes a connection with the so-called generalized grey Brownian motion and suggests application to model fractional anomalous diffusion in biological systems., ”Marco Polo Programme” (University of Bologna)
BIRD. BCAM's Institutional Repository Data
Publicación Contribución de congreso (ConferenceOutput)

Control of distributed parameter systems modelled by parabolic variational inequalities of the obstacle type

  • Kumar, R.
  • Glowinski, R.
  • Jansson, J.
We will investigate the numerical solution of the control problem modelled by parabolic variational inequalities. The general point of view adopted in this work has its roots in the work by R. Glowinski. The optimal control of parabolic variational inequalities is a hot topic in the control of distributed parameter system, since the classical optimality conditions such as KKT conditions do not apply and tools from non-smooth analysis have to be used. We demonstrate the simple approach to address optimal control of parabolic variational inequalities. First, we will introduce the model and describe the solution method. In Section 4 and 5, we will discuss the discretization of the model problem and then a conjugate gradient algorithm for solving the problem numerically. Finally we will present numerical results of optimal control problem related to variational inequality.