Results 131 to 140 of about 38,162 (310)
Abstract Large swarms often adopt a hierarchical network structure that incorporates information aggregation. Although this approach offers significant advantages in terms of communication efficiency and computational complexity, it can also lead to degradation due to information constraints.
Kento Fujita, Daisuke Tsubakino
wiley +1 more source
Risk‐aware safe reinforcement learning for control of stochastic linear systems
Abstract This paper presents a risk‐aware safe reinforcement learning (RL) control design for stochastic discrete‐time linear systems. Rather than using a safety certifier to myopically intervene with the RL controller, a risk‐informed safe controller is also learned besides the RL controller, and the RL and safe controllers are combined together ...
Babak Esmaeili +2 more
wiley +1 more source
Abstract The linear‐quadratic regulator (LQR) problem of optimal control of an uncertain discrete‐time linear system (DTLS) is revisited in this paper from the perspective of Tikhonov regularization. We show that an optimally chosen regularization parameter reduces, compared to the classical LQR, the values of a scalar error function, as well as the ...
Fernando Pazos, Amit Bhaya
wiley +1 more source
Multiparameter Perturbation Solution of Algebraic Equations
The classical perturbation method—the expansion of a solution of an algebraic equation as a power series in a parameter—is extended to an expansion in several parameters. An example concerning the Timoshenko beam equation is used to illustrate the ideas.
W. F. Ames, J. F. Sontowski
core +1 more source
On structural controllability in complex networks with periodic switching topologies
Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source
Applications of the Discrete Adjoint Method in Computational Fluid Dynamics [PDF]
The discrete adjoint method allows efficient evaluation of the derivative of a function I(s) with respect to parameters s in situations where I depends on s indirectly, via an intermediate variable w(s), which is computationally expensive to evaluate. In
Schneider, Rene, René Schneider
core
Young people's occupational aspirations beyond the aspiration discourse: A sociocultural perspective
Abstract Young people's aspirations have been the focus of many educational, sociological and psychological studies. This paper argues, firstly, that the concept of aspirations holds greater generative potential than suggested by the policy‐oriented ‘aspiration discourse’.
Jelena Popov
wiley +1 more source
Abstract In the classroom, metabolism is often approached and received as a mundane exercise in memorization. Teaching metabolism also faces the challenge of negative perceptions that can impede learning. We sought to improve the learning experience in an undergraduate lecture course on microbial metabolism by implementing an illustrated story that ...
James B. McKinlay, Katherine Kearns
wiley +1 more source
A Numerical Algorithm to find Soft-Constrained Nash Equilibria in Scalar LQ-Games
In this paper we provide a numerical algorithm to calculate all soft-constrained Nash equilibria in a regular scalar indefinite linear-quadratic game.The algorithm is based on the calculation of the eigenstructure of a certain matrix.The analysis follows
Engwerda, J.C.
core
Algebraic solution of models with a quick thrust by means of a computer algebraic system [PDF]
Quick thrusts or pushes do appear in a number of engineering situations which are usually modeled by means of delta generalizad functions. Some of these may be properly manipulated with computer algebraic systems such as Mathematica.
Morales, I. +2 more
core

