983 resultados para Local Minima
Resumo:
This thesis gathers the work carried out by the author in the last three years of research and it concerns the study and implementation of algorithms to coordinate and control a swarm of mobile robots moving in unknown environments. In particular, the author's attention is focused on two different approaches in order to solve two different problems. The first algorithm considered in this work deals with the possibility of decomposing a main complex task in many simple subtasks by exploiting the decentralized implementation of the so called \emph{Null Space Behavioral} paradigm. This approach to the problem of merging different subtasks with assigned priority is slightly modified in order to handle critical situations that can be detected when robots are moving through an unknown environment. In fact, issues can occur when one or more robots got stuck in local minima: a smart strategy to avoid deadlock situations is provided by the author and the algorithm is validated by simulative analysis. The second problem deals with the use of concepts borrowed from \emph{graph theory} to control a group differential wheel robots by exploiting the Laplacian solution of the consensus problem. Constraints on the swarm communication topology have been introduced by the use of a range and bearing platform developed at the Distributed Intelligent Systems and Algorithms Laboratory (DISAL), EPFL (Lausanne, CH) where part of author's work has been carried out. The control algorithm is validated by demonstration and simulation analysis and, later, is performed by a team of four robots engaged in a formation mission. To conclude, the capabilities of the algorithm based on the local solution of the consensus problem for differential wheel robots are demonstrated with an application scenario, where nine robots are engaged in a hunting task.
Resumo:
One of the most important challenges in chemistry and material science is the connection between the contents of a compound and its chemical and physical properties. In solids, these are greatly influenced by the crystal structure.rnrnThe prediction of hitherto unknown crystal structures with regard to external conditions like pressure and temperature is therefore one of the most important goals to achieve in theoretical chemistry. The stable structure of a compound is the global minimum of the potential energy surface, which is the high dimensional representation of the enthalpy of the investigated system with respect to its structural parameters. The fact that the complexity of the problem grows exponentially with the system size is the reason why it can only be solved via heuristic strategies.rnrnImprovements to the artificial bee colony method, where the local exploration of the potential energy surface is done by a high number of independent walkers, are developed and implemented. This results in an improved communication scheme between these walkers. This directs the search towards the most promising areas of the potential energy surface.rnrnThe minima hopping method uses short molecular dynamics simulations at elevated temperatures to direct the structure search from one local minimum of the potential energy surface to the next. A modification, where the local information around each minimum is extracted and used in an optimization of the search direction, is developed and implemented. Our method uses this local information to increase the probability of finding new, lower local minima. This leads to an enhanced performance in the global optimization algorithm.rnrnHydrogen is a highly relevant system, due to the possibility of finding a metallic phase and even superconductor with a high critical temperature. An application of a structure prediction method on SiH12 finds stable crystal structures in this material. Additionally, it becomes metallic at relatively low pressures.
Resumo:
Non-linear image registration is an important tool in many areas of image analysis. For instance, in morphometric studies of a population of brains, free-form deformations between images are analyzed to describe the structural anatomical variability. Such a simple deformation model is justified by the absence of an easy expressible prior about the shape changes. Applying the same algorithms used in brain imaging to orthopedic images might not be optimal due to the difference in the underlying prior on the inter-subject deformations. In particular, using an un-informed deformation prior often leads to local minima far from the expected solution. To improve robustness and promote anatomically meaningful deformations, we propose a locally affine and geometry-aware registration algorithm that automatically adapts to the data. We build upon the log-domain demons algorithm and introduce a new type of OBBTree-based regularization in the registration with a natural multiscale structure. The regularization model is composed of a hierarchy of locally affine transformations via their logarithms. Experiments on mandibles show improved accuracy and robustness when used to initialize the demons, and even similar performance by direct comparison to the demons, with a significantly lower degree of freedom. This closes the gap between polyaffine and non-rigid registration and opens new ways to statistically analyze the registration results.
Resumo:
Iterative Closest Point (ICP) is a widely exploited method for point registration that is based on binary point-to-point assignments, whereas the Expectation Conditional Maximization (ECM) algorithm tries to solve the problem of point registration within the framework of maximum likelihood with point-to-cluster matching. In this paper, by fulfilling the implementation of both algorithms as well as conducting experiments in a scenario where dozens of model points must be registered with thousands of observation points on a pelvis model, we investigated and compared the performance (e.g. accuracy and robustness) of both ICP and ECM for point registration in cases without noise and with Gaussian white noise. The experiment results reveal that the ECM method is much less sensitive to initialization and is able to achieve more consistent estimations of the transformation parameters than the ICP algorithm, since the latter easily sinks into local minima and leads to quite different registration results with respect to different initializations. Both algorithms can reach the high registration accuracy at the same level, however, the ICP method usually requires an appropriate initialization to converge globally. In the presence of Gaussian white noise, it is observed in experiments that ECM is less efficient but more robust than ICP.
Resumo:
For (H2O)n where n = 1–10, we used a scheme combining molecular dynamics sampling with high level ab initio calculations to locate the global and many low lying local minima for each cluster. For each isomer, we extrapolated the RI-MP2 energies to their complete basis set limit, included a CCSD(T) correction using a smaller basis set and added finite temperature corrections within the rigid-rotor-harmonic-oscillator (RRHO) model using scaled and unscaled harmonic vibrational frequencies. The vibrational scaling factors were determined specifically for water clusters by comparing harmonic frequencies with VPT2 fundamental frequencies. We find the CCSD(T) correction to the RI-MP2 binding energy to be small (<1%) but still important in determining accurate conformational energies. Anharmonic corrections are found to be non-negligble; they do not alter the energetic ordering of isomers, but they do lower the free energies of formation of the water clusters by as much as 4 kcal/mol at 298.15 K.
Resumo:
The PM3 quantum-mechanical method is able to model the magic water clusters (H20),, and (H20)&+. Results indicate that the H30+ ion is tightly bound within the (H20),, cluster by multiple hydrogen bonds, causing deformation to the symmetric (HzO),, pentagonal dodecahedron structure. The structures, energetics, and hydrogen bond patterns of six local minima (H20)21H+ clusters are presented.
Resumo:
The role of the binary nucleation of sulfuric acid in aerosol formation and its implications for global warming is one of the fundamental unsettled questions in atmospheric chemistry. We have investigated the thermodynamics of sulfuric acid hydration using ab initio quantum mechanical methods. For H2SO4(H2O)n where n = 1–6, we used a scheme combining molecular dynamics configurational sampling with high-level ab initio calculations to locate the global and many low lying local minima for each cluster size. For each isomer, we extrapolated the Møller–Plesset perturbation theory (MP2) energies to their complete basis set (CBS) limit and added finite temperature corrections within the rigid-rotor-harmonic-oscillator (RRHO) model using scaled harmonic vibrational frequencies. We found that ionic pair (HSO4–·H3O+)(H2O)n−1 clusters are competitive with the neutral (H2SO4)(H2O)n clusters for n ≥ 3 and are more stable than neutral clusters for n ≥ 4 depending on the temperature. The Boltzmann averaged Gibbs free energies for the formation of H2SO4(H2O)n clusters are favorable in colder regions of the troposphere (T = 216.65–273.15 K) for n = 1–6, but the formation of clusters with n ≥ 5 is not favorable at higher (T > 273.15 K) temperatures. Our results suggest the critical cluster of a binary H2SO4–H2O system must contain more than one H2SO4 and are in concert with recent findings(1) that the role of binary nucleation is small at ambient conditions, but significant at colder regions of the troposphere. Overall, the results support the idea that binary nucleation of sulfuric acid and water cannot account for nucleation of sulfuric acid in the lower troposphere.
Resumo:
For (H2O)n where n = 1–10, we used a scheme combining molecular dynamics sampling with high level ab initio calculations to locate the global and many low lying local minima for each cluster. For each isomer, we extrapolated the RI-MP2 energies to their complete basis set limit, included a CCSD(T) correction using a smaller basis set and added finite temperature corrections within the rigid-rotor-harmonic-oscillator (RRHO) model using scaled and unscaled harmonic vibrational frequencies. The vibrational scaling factors were determined specifically for water clusters by comparing harmonic frequencies with VPT2 fundamental frequencies. We find the CCSD(T) correction to the RI-MP2 binding energy to be small (
Resumo:
The role of the binary nucleation of sulfuric acid in aerosol formation and its implications for global warming is one of the fundamental unsettled questions in atmospheric chemistry. We have investigated the thermodynamics of sulfuric acid hydration using ab initio quantum mechanical methods. For H2SO4(H2O)n where n = 1–6, we used a scheme combining molecular dynamics configurational sampling with high-level ab initio calculations to locate the global and many low lying local minima for each cluster size. For each isomer, we extrapolated the Møller–Plesset perturbation theory (MP2) energies to their complete basis set (CBS) limit and added finite temperature corrections within the rigid-rotor-harmonic-oscillator (RRHO) model using scaled harmonic vibrational frequencies. We found that ionic pair (HSO4–·H3O+)(H2O)n−1clusters are competitive with the neutral (H2SO4)(H2O)n clusters for n ≥ 3 and are more stable than neutral clusters for n ≥ 4 depending on the temperature. The Boltzmann averaged Gibbs free energies for the formation of H2SO4(H2O)n clusters are favorable in colder regions of the troposphere (T = 216.65–273.15 K) for n = 1–6, but the formation of clusters with n ≥ 5 is not favorable at higher (T > 273.15 K) temperatures. Our results suggest the critical cluster of a binary H2SO4–H2O system must contain more than one H2SO4 and are in concert with recent findings(1) that the role of binary nucleation is small at ambient conditions, but significant at colder regions of the troposphere. Overall, the results support the idea that binary nucleation of sulfuric acid and water cannot account for nucleation of sulfuric acid in the lower troposphere.
Resumo:
Locally affine (polyaffine) image registration methods capture intersubject non-linear deformations with a low number of parameters, while providing an intuitive interpretation for clinicians. Considering the mandible bone, anatomical shape differences can be found at different scales, e.g. left or right side, teeth, etc. Classically, sequential coarse to fine registration are used to handle multiscale deformations, instead we propose a simultaneous optimization of all scales. To avoid local minima we incorporate a prior on the polyaffine transformations. This kind of groupwise registration approach is natural in a polyaffine context, if we assume one configuration of regions that describes an entire group of images, with varying transformations for each region. In this paper, we reformulate polyaffine deformations in a generative statistical model, which enables us to incorporate deformation statistics as a prior in a Bayesian setting. We find optimal transformations by optimizing the maximum a posteriori probability. We assume that the polyaffine transformations follow a normal distribution with mean and concentration matrix. Parameters of the prior are estimated from an initial coarse to fine registration. Knowing the region structure, we develop a blockwise pseudoinverse to obtain the concentration matrix. To our knowledge, we are the first to introduce simultaneous multiscale optimization through groupwise polyaffine registration. We show results on 42 mandible CT images.
Resumo:
Aim: The landscape metaphor allows viewing corrective experiences (CE) as pathway to a state with relatively lower 'tension' (local minimum). However, such local minima are not easily accessible but obstructed by states with relatively high tension (local maxima) according to the landscape metaphor (Caspar & Berger, 2012). For example, an individual with spider phobia has to transiently tolerate high levels of tension during an exposure therapy to access the local minimum of habituation. To allow for more specific therapeutic guidelines and empirically testable hypotheses, we advance the landscape metaphor to a scientific model which bases on motivational processes. Specifically, we conceptualize CEs as available but unusual trajectories (=pathways) through a motivational space. The dimensions of the motivational state are set up by basic motives such as need for agency or attachment. Methods: Dynamic system theory is used to model motivational states and trajectories using mathematical equations. Fortunately, these equations have easy-to-comprehend and intuitive visual representations similar to the landscape metaphor. Thus, trajectories that represent CEs are informative and action guiding for both therapists and patients without knowledge on dynamic systems. However, the mathematical underpinnings of the model allow researchers to deduct hypotheses for empirical testing. Results: First, the results of simulations of CEs during exposure therapy in anxiety disorders are presented and compared to empirical findings. Second, hypothetical CEs in an autonomy-attachment conflict are reported from a simulation study. Discussion: Preliminary clinical implications for the evocation of CEs are drawn after a critical discussion of the proposed model.
Resumo:
In this work we devise two novel algorithms for blind deconvolution based on a family of logarithmic image priors. In contrast to recent approaches, we consider a minimalistic formulation of the blind deconvolution problem where there are only two energy terms: a least-squares term for the data fidelity and an image prior based on a lower-bounded logarithm of the norm of the image gradients. We show that this energy formulation is sufficient to achieve the state of the art in blind deconvolution with a good margin over previous methods. Much of the performance is due to the chosen prior. On the one hand, this prior is very effective in favoring sparsity of the image gradients. On the other hand, this prior is non convex. Therefore, solutions that can deal effectively with local minima of the energy become necessary. We devise two iterative minimization algorithms that at each iteration solve convex problems: one obtained via the primal-dual approach and one via majorization-minimization. While the former is computationally efficient, the latter achieves state-of-the-art performance on a public dataset.
Resumo:
SOMS is a general surrogate-based multistart algorithm, which is used in combination with any local optimizer to find global optima for computationally expensive functions with multiple local minima. SOMS differs from previous multistart methods in that a surrogate approximation is used by the multistart algorithm to help reduce the number of function evaluations necessary to identify the most promising points from which to start each nonlinear programming local search. SOMS’s numerical results are compared with four well-known methods, namely, Multi-Level Single Linkage (MLSL), MATLAB’s MultiStart, MATLAB’s GlobalSearch, and GLOBAL. In addition, we propose a class of wavy test functions that mimic the wavy nature of objective functions arising in many black-box simulations. Extensive comparisons of algorithms on the wavy testfunctions and on earlier standard global-optimization test functions are done for a total of 19 different test problems. The numerical results indicate that SOMS performs favorably in comparison to alternative methods and does especially well on wavy functions when the number of function evaluations allowed is limited.
Resumo:
The TEX86 paleotemperature proxy is based on archaeal glycerol dibiphytanyl glycerol tetraether (GDGT) lipids preserved in marine sediments, yet both the influence of different physiological factors on the structural distribution of GDGTs, and the mechanism(s) by which GDGTs are exported to marine sediments remain unclear. In particular, TEX86 temperatures derived directly from suspended particulate matter (SPM) in the water column can diverge strongly from corresponding in situ temperatures. Here we investigated the abundance and structural distribution of GDGTs in the South-west and Equatorial Atlantic Ocean by examining SPM collected from four surface 1000 m depth profiles spanning 48 degrees of latitude. The depth distribution of GDGTs was consistent with our current understanding of marine archaeal ecology, and specifically of ammonia-oxidizing Thaumarchaeota. Maximum GDGT concentrations occurred at the base of the primary NO2- maximum. Core GDGTs dominated the structural distribution in surface waters, while intact polar GDGTs - thought to potentially indicate live cells - were more abundant at all depths below the maximum NO2- concentration. When integrated through the upper 1000 m of the water column, > 98% of GDGTs were present in waters at and below the depth of the primary NO2- maximum. TEX86-calculated temperatures showed local minima at the depth of the NO2- maximum, while the ratio of GDGT 2:GDGT 3 [2/3] increased with depth throughout the upper water column. These results were used to model the depth of origin for GDGTs exported to sediments. By comparing our SPM data to published TEX86 values and [2/3] ratios from sediments near our study sites, we conclude that most GDGTs are exported from the depth of maximum GDGT concentrations, near the subsurface NO2- maximum (~80-250 m). This indicates that local ammonia oxidation dynamics are important regional controls on the GDGT ratios preserved in sediments. Predicting the extent to which subsurface variations in archaeal activity may influence the sedimentary TEX86 record will require a better understanding of how site-specific productivity and particle dynamics in the upper water column influence the depth of origin for exported organic matter.
Resumo:
El objetivo de esta tesis es el desarrollo de un sistema completo de navegación, aprendizaje y planificación para un robot móvil. Dentro de los innumerables problemas que este gran objetivo plantea, hemos dedicado especial atención al problema del conocimiento autónomo del mundo. Nuestra mayor preocupación ha sido la de establecer mecanismos que permitan, a partir de información sensorial cruda, el desarrollo incremental de un modelo topológico del entorno en el que se mueve el robot. Estos mecanismos se apoyan invariablemente en un nuevo concepto propuesto en esta tesis: el gradiente sensorial. El gradiente sensorial es un dispositivo matemático que funciona como un detector de sucesos interesantes para el sistema. Una vez detectado uno de estos sucesos, el robot puede identificar su situación en un mapa topológico y actuar en consecuencia. Hemos denominado a estas situaciones especiales lugares sensorialmente relevantes, ya que (a) captan la atención del sistema y (b) pueden ser identificadas utilizando la información sensorial. Para explotar convenientemente los modelos construidos, hemos desarrollado un algoritmo capaz de elaborar planes internalizados, estableciendo una red de sugerencias en los lugares sensorialmente relevantes, de modo que el robot encuentra en estos puntos una dirección recomendada de navegación. Finalmente, hemos implementado un sistema de navegación robusto con habilidades para interpretar y adecuar los planes internalizados a las circunstancias concretas del momento. Nuestro sistema de navegación está basado en la teoría de campos de potencial artificial, a la que hemos incorporado la posibilidad de añadir cargas ficticias como ayuda a la evitación de mínimos locales. Como aportación adicional de esta tesis al campo genérico de la ciencia cognitiva, todos estos elementos se integran en una arquitectura centrada en la memoria, lo que pretende resaltar la importancia de ésta en los procesos cognitivos de los seres vivos y aporta un giro conceptual al punto de vista tradicional, centrado en los procesos. The general objective of this thesis is the development of a global navigation system endowed with planning and learning features for a mobile robot. Within this general objective we have devoted a special effort to the autonomous learning problem. Our main concern has been to establish the necessary mechanisms for the incremental development of a topological model of the robot’s environment using the sensory information. These mechanisms are based on a new concept proposed in the thesis: the sensory gradient. The sensory gradient is a mathematical device which works like a detector of “interesting” environment’s events. Once a particular event has been detected the robot can identify its situation in the topological map and to react accordingly. We have called these special situations relevant sensory places because (a) they capture the system’s attention and (b) they can be identified using the sensory information. To conveniently exploit the built-in models we have developed an algorithm able to make internalized plans, establishing a suggestion network in the sensory relevant places in such way that the robot can find at those places a recommended navigation direction. It has been also developed a robust navigation system able to navigate by means of interpreting and adapting the internalized plans to the concrete circumstances at each instant, i.e. a reactive navigation system. This reactive system is based on the artificial potential field approach with the additional feature introduced in the thesis of what we call fictitious charges as an aid to avoid local minima. As a general contribution of the thesis to the cognitive science field all the above described elements are integrated in a memory-based architecture, emphasizing the important role played by the memory in the cognitive processes of living beings and giving a conceptual turn in the usual process-based approach.