On the detection of nearly optimal solutions in the context of single-objective space mission design problems

When making decisions, having multiple options available for a possible realization of the same project can be advantageous. One way to increase the number of interesting choices is to consider, in addition to the optimal solution x*, also nearly optimal or approximate solutions; these alternative solutions differ from x* and can be in different regions – in the design space – but fulfil certain proximity to its function value f(x*). The scope of this article is the efficient computation and discretization of the set E of e–approximate solutions for scalar optimization problems. To accomplish this task, two strategies to archive and update the data of the search procedure will be suggested and investigated. To make emphasis on data storage efficiency, a way to manage significant and insignificant parameters is also presented. Further on, differential evolution will be used together with the new archivers for the computation of E. Finally, the behaviour of the archiver, as well as the efficiency of the resulting search procedure, will be demonstrated on some academic functions as well as on three models related to space mission design

Exponentially Accurate Semiclassical Tunneling Wave Functions in One Dimension

We study the time behavior of wave functions involved in tunneling through a smooth potential barrier in one dimension in the semiclassical limit. We determine the leading order component of the wave function that tunnels. It is exponentially small in $1/\hbar$. For a wide variety of incoming wave packets, the leading order tunneling component is Gaussian for sufficiently small $\hbar$. We prove this for both the large time asymptotics and for moderately large values of the time variable

Membrane resonance enables stable and robust gamma oscillations

Neuronal mechanisms underlying beta/gamma oscillations (20-80 Hz) are not completely understood. Here, we show that in vivo beta/gamma oscillations in the cat visual cortex sometimes exhibit remarkably stable frequency even when inputs fluctuate dramatically. Enhanced frequency stability is associated with stronger oscillations measured in individual units and larger power in the local field potential. Simulations of neuronal circuitry demonstrate that membrane properties of inhibitory interneurons strongly determine the characteristics of emergent oscillations. Exploration of networks containing either integrator or resonator inhibitory interneurons revealed that: (i) Resonance, as opposed to integration, promotes robust oscillations with large power and stable frequency via a mechanism called RING (Resonance INduced Gamma); resonance favors synchronization by reducing phase delays between interneurons and imposes bounds on oscillation cycle duration; (ii) Stability of frequency and robustness of the oscillation also depend on the relative timing of excitatory and inhibitory volleys within the oscillation cycle; (iii) RING can reproduce characteristics of both Pyramidal INterneuron Gamma (PING) and INterneuron Gamma (ING), transcending such classifications; (iv) In RING, robust gamma oscillations are promoted by slow but are impaired by fast inputs. Results suggest that interneuronal membrane resonance can be an important ingredient for generation of robust gamma oscillations having stable frequency

The linear quadratic regulator problem for a class of controlled systems modeled by singularly perturbed Ito differential equations

This paper discusses an infinite-horizon linear quadratic (LQ) optimal control problem involving state- and control-dependent noise in singularly perturbed stochastic systems. First, an asymptotic structure along with a stabilizing solution for the stochastic algebraic Riccati equation (ARE) are newly established. It is shown that the dominant part of this solution can be obtained by solving a parameter-independent system of coupled Riccati-type equations. Moreover, sufficient conditions for the existence of the stabilizing solution to the problem are given. A new sequential numerical algorithm for solving the reduced-order AREs is also described. Based on the asymptotic behavior of the ARE, a class of O(√ε) approximate controller that stabilizes the system is obtained. Unlike the existing results in singularly perturbed deterministic systems, it is noteworthy that the resulting controller achieves an O(ε) approximation to the optimal cost of the original LQ optimal control problem. As a result, the proposed control methodology can be applied to practical applications even if the value of the small parameter ε is not precisely known. © 2012 Society for Industrial and Applied Mathematics.Vasile Dragan, Hiroaki Mukaidani and Peng Sh

EEG processing with TESPAR for depth of anesthesia detection

Poster presentation: Introduction Adequate anesthesia is crucial to the success of surgical interventions and subsequent recovery. Neuroscientists, surgeons, and engineers have sought to understand the impact of anesthetics on the information processing in the brain and to properly assess the level of anesthesia in an non-invasive manner. Studies have indicated a more reliable depth of anesthesia (DOA) detection if multiple parameters are employed. Indeed, commercial DOA monitors (BIS, Narcotrend, M-Entropy and A-line ARX) use more than one feature extraction method. Here, we propose TESPAR (Time Encoded Signal Processing And Recognition) a time domain signal processing technique novel to EEG DOA assessment that could enhance existing monitoring devices. ..

Multi-agent collaborative search : an agent-based memetic multi-objective optimization algorithm applied to space trajectory design

This article presents an algorithm for multi-objective optimization that blends together a number of heuristics. A population of agents combines heuristics that aim at exploring the search space both globally and in a neighbourhood of each agent. These heuristics are complemented with a combination of a local and global archive. The novel agent-based algorithm is tested at first on a set of standard problems and then on three specific problems in space trajectory design. Its performance is compared against a number of state-of-the-art multi-objective optimization algorithms that use the Pareto dominance as selection criterion: non-dominated sorting genetic algorithm (NSGA-II), Pareto archived evolution strategy (PAES), multiple objective particle swarm optimization (MOPSO), and multiple trajectory search (MTS). The results demonstrate that the agent-based search can identify parts of the Pareto set that the other algorithms were not able to capture. Furthermore, convergence is statistically better although the variance of the results is in some cases higher

Computing the set of Epsilon-efficient solutions in multiobjective space mission design

In this work, we consider multiobjective space mission design problems. We will start from the need, from a practical point of view, to consider in addition to the (Pareto) optimal solutions also nearly optimal ones. In fact, extending the set of solutions for a given mission to those nearly optimal significantly increases the number of options for the decision maker and gives a measure of the size of the launch windows corresponding to each optimal solution, i.e., a measure of its robustness. Whereas the possible loss of such approximate solutions compared to optimal—and possibly even ‘better’—ones is dispensable. For this, we will examine several typical problems in space trajectory design—a biimpulsive transfer from the Earth to the asteroid Apophis and two low-thrust multigravity assist transfers—and demonstrate the possible benefit of the novel approach. Further, we will present a multiobjective evolutionary algorithm which is designed for this purpose