Moduli as Inflatons in Heterotic M-theory

We consider different cosmological aspects of Heterotic M-theory. In particular we look at the dynamical behaviour of the two relevant moduli in the theory, namely the length of the eleventh segment (pi rho) and the volume of the internal six manifold (V) in models where supersymmetry is broken by multiple gaugino condensation. We look at different ways to stabilise these moduli, namely racetrack scenarios with or without non-perturbative corrections to the Kahler potential. The existence of different flat directions in the scalar potential, and the way in which they can be partially lifted, is discussed as well as their possible role in constructing a viable model of inflation. Some other implications such as the status of the moduli problem within these models are also studied.Comment: 16 pages, 8 Postscript figures. Final version to appear in JHE

Cosmological Aspects of Heterotic M-theory

In this talk we discuss a few relevant aspects of heterotic M-theory. These are the stabilization of the two relevant moduli (the length of the eleventh segment (pi rho) and the volume of the internal six manifold (V)) in models where supersymmetry is broken by multiple gaugino condensation and non-perturbative corrections to the Kahler potential; the existence of almost flat directions in the scalar potential; the possibility of lifting them, and their role in constructing a viable model of inflation. Finally, we review the status of the moduli problem within these models. TComment: LaTeX, 8 pages, 4 eps figures, uses ws-p8-50x6-00.cls; invited talk at the International Workshop on Particle Physics and the Early Universe (COSMO-99), Trieste, Italy, September 27 - October 2, 199

Stabilizing the Dilaton in Superstring Cosmology

We address the important issue of stabilizing the dilaton in the context of superstring cosmology. Scalar potentials which arise out of gaugino condensates in string models are generally exponential in nature. In a cosmological setting this allows for the existence of quasi scaling solutions, in which the energy density of the scalar field can, for a period, become a fixed fraction of the background density, due to the friction of the background expansion. Eventually the field can be trapped in the minimum of its potential as it leaves the scaling regime. We investigate this possibility in various gaugino condensation models and show that stable solutions for the dilaton are far more common than one would have naively thought.Comment: 13 pages, LaTex, uses psfig.sty with 3 figure

Moduli Evolution in Heterotic Scenarios

We discuss several aspects of the cosmological evolution of moduli fields in heterotic string/M-theory scenarios. In particular we study the equations of motion of both the dilaton and overall modulus of these theories in the presence of an expanding Universe and under different assumptions. First we analyse the impact of their couplings to matter fields, which turns out to be negligible in the string and M-theory scenarios. Then we examine in detail the possibility of scaling in M-theory, i.e. how the moduli would evolve naturally to their minima instead of rolling past them in the presence of a dominating background. In this case we find interesting and positive results, and we compare them to the analogous situation in the heterotic string.Comment: 12 pages, 4 postscript figure

Distributed MPC with time-varying communication network: A density-dependent population games approach

© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This work addresses distributed control design by using density-dependent population dynamics. Furthermore, stability of the equilibrium point under this proposed class of population dynamics is studied, and the relationship between the equilibrium point of density-dependent population games (DDPG) and the solution of constrained optimization problems is shown. Finally, a distributed predictive control is designed with the proposed density-dependent dynamics, and contemplating a time-varying communication network.Peer ReviewedPostprint (author's final draft

Constrained distributed optimization : A population dynamics approach

Large-scale network systems involve a large number of states, which makes the design of real-time controllers a challenging task. A distributed controller design allows to reduce computational requirements since tasks are divided into different systems, allowing real-time processing. This paper proposes a novel methodology for solving constrained optimization problems in a distributed way inspired by population dynamics. This methodology consists of an extension of a population dynamics equation and the introduction of a mass dynamics equation. The proposed methodology divides the problem into smaller sub-problems, whose feasible regions vary over time achieving an agreement to solve the global problem. The methodology also guarantees attraction to the feasible region and allows to have few changes in the decision-making design when a network suffers the addition/removal of nodes/edges. Then, distributed controllers are designed with the proposed methodology and applied to the large-scale Barcelona Drinking Water Network (BDWN). Some simulations are presented and discussed in order to illustrate the control performance.Peer ReviewedPostprint (author's final draft

Time-varying partitioning for predictive control design: density-games approach

The design of distributed optimization-based controllers for large-scale systems (LSSs) implies every time new challenges. The fact that LSSs are generally located throughout large geographical areas makes dicult the recollection of measurements and their transmission. In this regard, the communication network that is required for a centralized control approach might have high associated economic costs. Furthermore, the computation of a large amount of data implies a high computational burden to manage, process and use them in order to make decisions over the system operation. A plausible solution to mitigate the aforementioned issues associated with the control of LSSs consists in dividing this type of systems into smaller sub-systems able to be handled by independent local controllers. This paper studies two fundamental components of the design of distributed optimization-based controllers for LSSs, i.e., the system partitioning and distributed optimization algorithms. The design of distributed model predictive control (DMPC) strategies with a system partitioning and by using density-dependent population games (DDPG) is presented.Peer ReviewedPostprint (author's final draft

Non-centralized Control for Flow-based Distribution Networks: A Game-theoretical Insight

This paper solves a data-driven control problem for a flow-based distribution network with two objectives: a resource allocation and a fair distribution of costs. These objectives represent both cooperation and competition directions. It is proposed a solution that combines either a centralized or distributed cooperative game approach using the Shapley value to determine a proper partitioning of the system and a fair communication cost distribution. On the other hand, a decentralized noncooperative game approach computing the Nash equilibrium is used to achieve the control objective of the resource allocation under a non-complete information topology. Furthermore, an invariant-set property is presented and the closed-loop system stability is analyzed for the non cooperative game approach. Another contribution regarding the cooperative game approach is an alternative way to compute the Shapley value for the proposed specific characteristic function. Unlike the classical cooperative-games approach, which has a limited application due to the combinatorial explosion issues, the alternative method allows calculating the Shapley value in polynomial time and hence can be applied to large-scale problems.Generalitat de Catalunya FI 2014Ministerio de Ciencia y Educación DPI2016-76493-C3-3-RMinisterio de Ciencia y Educación DPI2008-05818Proyecto europeo FP7-ICT DYMASO