Multiobjective global surrogate modeling, dealing with the 5-percent problem

When dealing with computationally expensive simulation codes or process measurement data, surrogate modeling methods are firmly established as facilitators for design space exploration, sensitivity analysis, visualization, prototyping and optimization. Typically the model parameter (=hyperparameter) optimization problem as part of global surrogate modeling is formulated in a single objective way. Models are generated according to a single objective (accuracy). However, this requires an engineer to determine a single accuracy target and measure upfront, which is hard to do if the behavior of the response is unknown. Likewise, the different outputs of a multi-output system are typically modeled separately by independent models. Again, a multiobjective approach would benefit the domain expert by giving information about output correlation and enabling automatic model type selection for each output dynamically. With this paper the authors attempt to increase awareness of the subtleties involved and discuss a number of solutions and applications. In particular, we present a multiobjective framework for global surrogate model generation to help tackle both problems and that is applicable in both the static and sequential design (adaptive sampling) case

Methodology for Comparison of Algorithms for Real-World Multi-objective Optimization Problems: Space Surveillance Network Design

Space Situational Awareness (SSA) is an activity vital to protecting national and commercial satellites from damage or destruction due to collisions. Recent research has demonstrated a methodology using evolutionary algorithms (EAs) which is intended to develop near-optimal Space Surveillance Network (SSN) architectures in the sense of low cost, low latency, and high resolution. That research is extended here by (1) developing and applying a methodology to compare the performance of two or more algorithms against this problem, and (2) analyzing the effects of using reduced data sets in those searches. Computational experiments are presented in which the performance of five multi-objective search algorithms are compared to one another using four binary comparison methods, each quantifying the relationship between two solution sets in different ways. Relative rankings reveal strengths and weaknesses of evaluated algorithms empowering researchers to select the best algorithm for their specific needs. The use of reduced data sets is shown to be useful for producing relative rankings of algorithms that are representative of rankings produced using the full set

A PARETO-FRONTIER ANALYSIS OF PERFORMANCE TRENDS FOR SMALL REGIONAL COVERAGE LEO CONSTELLATION SYSTEMS

As satellites become smaller, cheaper, and quicker to manufacture, constellation systems will be an increasingly attractive means of meeting mission objectives. Optimizing satellite constellation geometries is therefore a topic of considerable interest. As constellation systems become more achievable, providing coverage to specific regions of the Earth will become more common place. Small countries or companies that are currently unable to afford large and expensive constellation systems will now, or in the near future, be able to afford their own constellation systems to meet their individual requirements for small coverage regions. The focus of this thesis was to optimize constellation geometries for small coverage regions with the constellation design limited between 1-6 satellites in a Walker-delta configuration, at an altitude of 200-1500km, and to provide remote sensing coverage with a minimum ground elevation angle of 60 degrees. Few Pareto-frontiers have been developed and analyzed to show the tradeoffs among various performance metrics, especially for this type of constellation system. The performance metrics focus on geometric coverage and include revisit time, daily visibility time, constellation altitude, ground elevation angle, and the number of satellites. The objective space containing these performance metrics were characterized for 5 different regions at latitudes of 0, 22.5, 45, 67.5, and 90 degrees. In addition, the effect of minimum ground elevation angle was studied on the achievable performance of this type of constellation system. Finally, the traditional Walker-delta pattern constraint was relaxed to allow for asymmetrical designs. These designs were compared to see how the Walker-delta pattern performs compared to a more relaxed design space. The goal of this thesis was to provide both a framework as well as obtain and analyze Pareto-frontiers for constellation performance relating to small regional coverage LEO constellation systems. This work provided an in-depth analysis of the trends in both the design and objective space of the obtained Pareto-frontiers. A variation on the εNSGA-II algorithm was utilized along with a MATLAB/STK interface to produce these Pareto-frontiers. The εNSGA-II algorithm is an evolutionary algorithm that was developed by Kalyanmoy Deb to solve complex multi-objective optimization problems. The algorithm used in this study proved to be very efficient at obtaining various Pareto-frontiers. This study was also successful in characterizing the design and solution space surrounding small LEO remote sensing constellation systems providing small regional coverage

Multiobjective Design Optimization Of Gas Turbine Blade With Emphasis On Internal Cooling

In the design of mechanical components, numerical simulations and experimental methods are commonly used for design creation (or modification) and design optimization. However, a major challenge of using simulation and experimental methods is that they are timeconsuming and often cost-prohibitive for the designer. In addition, the simultaneous interactions between aerodynamic, thermodynamic and mechanical integrity objectives for a particular component or set of components are difficult to accurately characterize, even with the existing simulation tools and experimental methods. The current research and practice of using numerical simulations and experimental methods do little to address the simultaneous “satisficing” of multiple and often conflicting design objectives that influence the performance and geometry of a component. This is particularly the case for gas turbine systems that involve a large number of complex components with complicated geometries. Numerous experimental and numerical studies have demonstrated success in generating effective designs for mechanical components; however, their focus has been primarily on optimizing a single design objective based on a limited set of design variables and associated values. In this research, a multiobjective design optimization framework to solve a set of userspecified design objective functions for mechanical components is proposed. The framework integrates a numerical simulation and a nature-inspired optimization procedure that iteratively perturbs a set of design variables eventually converging to a set of tradeoff design solutions. In this research, a gas turbine engine system is used as the test application for the proposed framework. More specifically, the optimization of the gas turbine blade internal cooling channel configuration is performed. This test application is quite relevant as gas turbine engines serve a iv critical role in the design of the next-generation power generation facilities around the world. Furthermore, turbine blades require better cooling techniques to increase their cooling effectiveness to cope with the increase in engine operating temperatures extending the useful life of the blades. The performance of the proposed framework is evaluated via a computational study, where a set of common, real-world design objectives and a set of design variables that directly influence the set of objectives are considered. Specifically, three objectives are considered in this study: (1) cooling channel heat transfer coefficient, which measures the rate of heat transfer and the goal is to maximize this value; (2) cooling channel air pressure drop, where the goal is to minimize this value; and (3) cooling channel geometry, specifically the cooling channel cavity area, where the goal is to maximize this value. These objectives, which are conflicting, directly influence the cooling effectiveness of a gas turbine blade and the material usage in its design. The computational results show the proposed optimization framework is able to generate, evaluate and identify thousands of competitive tradeoff designs in a fraction of the time that it would take designers using the traditional simulation tools and experimental methods commonly used for mechanical component design generation. This is a significant step beyond the current research and applications of design optimization to gas turbine blades, specifically, and to mechanical components, in general

Adaptive algorithms for history matching and uncertainty quantification

Numerical reservoir simulation models are the basis for many decisions in regard to predicting, optimising, and improving production performance of oil and gas reservoirs. History matching is required to calibrate models to the dynamic behaviour of the reservoir, due to the existence of uncertainty in model parameters. Finally a set of history matched models are used for reservoir performance prediction and economic and risk assessment of different development scenarios. Various algorithms are employed to search and sample parameter space in history matching and uncertainty quantification problems. The algorithm choice and implementation, as done through a number of control parameters, have a significant impact on effectiveness and efficiency of the algorithm and thus, the quality of results and the speed of the process. This thesis is concerned with investigation, development, and implementation of improved and adaptive algorithms for reservoir history matching and uncertainty quantification problems. A set of evolutionary algorithms are considered and applied to history matching. The shared characteristic of applied algorithms is adaptation by balancing exploration and exploitation of the search space, which can lead to improved convergence and diversity. This includes the use of estimation of distribution algorithms, which implicitly adapt their search mechanism to the characteristics of the problem. Hybridising them with genetic algorithms, multiobjective sorting algorithms, and real-coded, multi-model and multivariate Gaussian-based models can help these algorithms to adapt even more and improve their performance. Finally diversity measures are used to develop an explicit, adaptive algorithm and control the algorithm’s performance, based on the structure of the problem. Uncertainty quantification in a Bayesian framework can be carried out by resampling of the search space using Markov chain Monte-Carlo sampling algorithms. Common critiques of these are low efficiency and their need for control parameter tuning. A Metropolis-Hastings sampling algorithm with an adaptive multivariate Gaussian proposal distribution and a K-nearest neighbour approximation has been developed and applied

Evolutionary learning and global search for multi-optimal PID tuning rules

With the advances in microprocessor technology, control systems are widely seen not only in industry but now also in household appliances and consumer electronics. Among all control schemes developed so far, Proportional plus Integral plus Derivative (PID) control is the most widely adopted in practice. Today, more than 90% of industrial controllers have a built-in PID function. Their wide applications have stimulated and sustained the research and development of PID tuning techniques, patents, software packages and hardware modules. Due to parameter interaction and format variation, tuning a PID controller is not as straightforward as one would have anticipated. Therefore, designing speedy tuning rules should greatly reduce the burden on new installation and ‘time-to-market’ and should also enhance the competitive advantages of the PID system under offer. A multi-objective evolutionary algorithm (MOEA) would be an ideal candidate to conduct the learning and search for multi-objective PID tuning rules. A simple to implement MOEA, termed s-MOEA, is devised and compared with MOEAs developed elsewhere. Extensive study and analysis are performed on metrics for evaluating MOEA performance, so as to help with this comparison and development. As a result, a novel visualisation technique, termed “Distance and Distribution” (DD)” chart, is developed to overcome some of the limitations of existing metrics and visualisation techniques. The DD chart allows a user to view the comparison of multiple sets of high order non-dominated solutions in a two-dimensional space. The capability of DD chart is shown in the comparison process and it is shown to be a useful tool for gathering more in-depth information of an MOEA which is not possible in existing empirical studies. Truly multi-objective global PID tuning rules are then evolved as a result of interfacing the s-MOEA with closed-loop simulations under practical constraints. It takes into account multiple, and often conflicting, objectives such as steady-state accuracy and transient responsiveness against stability and overshoots, as well as tracking performance against load disturbance rejection. These evolved rules are compared against other tuning rules both offline on a set of well-recognised PID benchmark test systems and online on three laboratory systems of different dynamics and transport delays. The results show that the rules significantly outperform all existing tuning rules, with multi-criterion optimality. This is made possible as the evolved rules can cover a delay to time constant ratio from zero to infinity based on first-order plus delay plant models. For second-order plus delay plant models, they can also cover all possible dynamics found in practice

Dynamic multi-objective optimisation using deep reinforcement learning::benchmark, algorithm and an application to identify vulnerable zones based on water quality

Dynamic multi-objective optimisation problem (DMOP) has brought a great challenge to the reinforcement learning (RL) research area due to its dynamic nature such as objective functions, constraints and problem parameters that may change over time. This study aims to identify the lacking in the existing benchmarks for multi-objective optimisation for the dynamic environment in the RL settings. Hence, a dynamic multi-objective testbed has been created which is a modified version of the conventional deep-sea treasure (DST) hunt testbed. This modified testbed fulfils the changing aspects of the dynamic environment in terms of the characteristics where the changes occur based on time. To the authors’ knowledge, this is the first dynamic multi-objective testbed for RL research, especially for deep reinforcement learning. In addition to that, a generic algorithm is proposed to solve the multi-objective optimisation problem in a dynamic constrained environment that maintains equilibrium by mapping different objectives simultaneously to provide the most compromised solution that closed to the true Pareto front (PF). As a proof of concept, the developed algorithm has been implemented to build an expert system for a real-world scenario using Markov decision process to identify the vulnerable zones based on water quality resilience in São Paulo, Brazil. The outcome of the implementation reveals that the proposed parity-Q deep Q network (PQDQN) algorithm is an efficient way to optimise the decision in a dynamic environment. Moreover, the result shows PQDQN algorithm performs better compared to the other state-of-the-art solutions both in the simulated and the real-world scenario

by integrating deep learning, mechanistic model and field observations

학위논문(박사) -- 서울대학교대학원 : 농업생명과학대학 협동과정 농림기상학, 2022. 8. Youngryel Ryu.Rice (Oryza sativa) is a vital cereal crop that feeds more than 50% of the world population. However, the traditional anaerobic management leads rice production to consume ~40% of the irrigation water and emit ~10% of the global anthropogenic methane. A new paradigm for sustainable rice farming is urgently required amid challenges from increasing food demand, water scarcity, and reducing greenhouse gases emissions. Rice plants transpire considerable water overnight. Saving nighttime water loss is desirable but first need to understand the underlying mechanism of nocturnal stomatal opening. Apart from the night, optimizing daytime management is pivotal for designing an environmentally sustainable rice farming system. In a long-term strategy, detailed and reliable crop type map is compulsory to upscale new leaf level findings and site level methods to regional or global scale. Therefore, in this dissertation, we improved mechanistic understanding of nocturnal stomatal conductance in rice plants (Chapter II); provided an interdisciplinary and heuristic approach for designing an environmentally sustainable rice farming system with a case study in South Korea (Chapter III); and developed a new crop type referencing method by mining off-the-shelf Google Street View images to map crop types (Chapter IV). In chapter II, we proposed a “coordinated leaf trait” hypothesis to explain the ecological mechanism of nocturnal stomatal conductance (gsn) in rice. We conducted an open-field experiment by applying drought, nutrient deficiency, and the combined drought-nutrient deficiency stress. We found that gsn was neither strongly reduced by drought nor consistently increased by nutrient deficiency. With abiotic stress as a random effect, gsn was strongly positively correlated with nocturnal respiration (Rn). Notably, gsn primed early morning photosynthesis, as follows: Rn (↑) → gsn (↑) → gsd (daytime stomatal conductance) (↑) → A (assimilation) (↑). This photosynthesis priming effect diminished after mid-morning. Leaves were cooled by gsn as follows: gsn (↑) → E (transpiration) (↑) → Tleaf (leaf temperature) (↓). However, our results clearly suggest that evaporative cooling did not reduce Rn cost. Our results indicate that gsn is more closely related to carbon respiration and assimilation than water and nutrient availability, and that leaf trait coordination (Rn − gsn − gsd − A) is likely the primary mechanism controlling gsn. In chapter III, we aimed to increase current crop yield, reduce irrigation water consumption, and tackle the dilemma to simultaneously reducing CH4 and N2O emissions in a flooded rice production system. By proposing a heuristic and holistic method, we optimized farm management beyond previous most emphasized irrigation regimes while also exploring niches from other pivotal options regarding sowing window, fertilization rate, tillage depth, and their interactions. Specifically, we calibrated and validated the process-based DNDC model with five years of eddy covariance observations. The DNDC model later was integrated with the non-dominated sorting genetic algorithm (NSGA-III) to solve the multi-objective optimization problem. We found that the optimized management would maintain or even increase current crop yield to its potential (~10 t/ha) while reducing more than 50% irrigation demand and GHGs (CH4 & N2O) emissions. Our results indicate that earlier sowing window and improvements on irrigation practice together would be pivotal to maximizing crop yield while sustaining environmental benefits. We found that the optimal fraction of non-flooded days was around 54% of growing season length and its optimal temporal distributions were primarily in vegetative stages. Our study shows that the present farm yield (8.3-8.9 t/ha) in study site not only has not achieved its potential level but also comes at a great environmental cost to water resources (604-810 mm/yr) and GHGs emissions (CH4: 186-220 kg C/ha/yr; N2O: 0.3-1.6 kg C/ha/yr). Furthermore, this simple method could further be applied to evaluate the environmental sustainability of a farming system under various climate and local conditions and to guide policymakers and farming practices with comprehensive solutions. In chapter IV, we apply a convolutional neural network (CNN) model to explore the efficacy of automatic ground truthing via Google Street View (GSV) images in two distinct farming regions: Illinois and the Central Valley in California. Ground reference data are an essential prerequisite for supervised crop mapping. The lack of a low-cost and efficient ground referencing method results in pervasively limited reference data and hinders crop classification. In this study, we demonstrate the feasibility and reliability of our new ground referencing technique by performing pixel-based crop mapping at the state level using the cloud-based Google Earth Engine platform. The mapping results are evaluated using the United States Department of Agriculture (USDA) crop data layer (CDL) products. From ~130,000 GSV images, the CNN model identified ~9,400 target crop images. These images are well classified into crop types, including alfalfa, almond, corn, cotton, grape, rice, soybean, and pistachio. The overall GSV image classification accuracy is 92% for the Central Valley and 97% for Illinois. Subsequently, we shifted the image geographical coordinates 2–3 times in a certain direction to produce 31,829 crop reference points: 17,358 in Illinois, and 14,471 in the Central Valley. Evaluation of the mapping results with CDL products revealed satisfactory coherence. GSV-derived mapping results capture the general pattern of crop type distributions for 2011–2019. The overall agreement between CDL products and our mapping results is indicated by R2 values of 0.44–0.99 for the Central Valley and 0.81–0.98 for Illinois. To show the applicational value of the proposed method in other countries, we further mapped rice paddy (2014–2018) in South Korea which yielded fairly well outcomes (R2=0.91). These results indicate that GSV images used with a deep learning model offer an efficient and cost-effective alternative method for ground referencing, in many regions of the world.쌀(오리자 사티바)은 세계 인구의 50% 이상을 먹여 살리는 중요한 곡물 작물이다. 그러나 전통적인 혐기성 관리는 쌀 생산으로 관개수의 40%를 소비하고 전 세계 인공 메탄의 10%를 배출한다. 식량 수요 증가, 물 부족, 온실가스 배출 감소 등의 과제 속에서 지속 가능한 벼농사를 위한 새로운 패러다임이 시급하다. 벼는 하룻밤 사이에 상당한 양의 물을 내뿜는다. 야간 수분 손실을 줄이는 것은 바람직하지만, 먼저 야간 기공 개방의 기본 메커니즘을 이해할 필요가 있다. 야간과 별도로 주간 경영의 최적화는 환경적으로 지속 가능한 벼농사 시스템을 설계하는 데 매우 중요하다. 장기 전략에서, 새로운 잎 수준 발견과 현장 수준 방법을 지역적 또는 전역적 규모로 상향 조정하려면 상세하고 신뢰할 수 있는 작물 유형 맵이 필수적이다. 따라서, 본 논문에서 우리는 벼농사의 야간 기공 전도도에 대한 기계적 이해를 향상시켰다(제2장). 환경적으로 지속 가능한 벼농사 시스템을 설계하기 위한 학제 간 및 휴리스틱 접근법 제공(제3장). 그리고 새로운 작물 유형 참조 방법을 개발했다. 기성품인 Google Street View 이미지를 마이닝하여 자르기 유형을 매핑합니다. 2장에서 우리는 벼의 야행성 기공 전도도(gsn)의 생태학적 메커니즘을 설명하기 위해 "협동된 잎 형질" 가설을 제안했습니다. 가뭄, 영양 결핍 및 가뭄-영양소 결핍 복합 스트레스를 적용하여 노지 실험을 수행했습니다. 우리는 gsn이 가뭄에 의해 크게 감소하지도 않고 영양 결핍에 의해 지속적으로 증가하지도 않는다는 것을 발견했습니다. 무생물적 스트레스를 무작위 효과로 사용하여 gsn은 야간 호흡(Rn)과 강한 양의 상관관계를 보였습니다. 특히, gsn은 Rn(↑) → gsn(↑) → gsd(주간 기공 전도도)(↑) → A(동화)(↑)와 같이 이른 아침 광합성을 프라이밍했습니다. 이 광합성 프라이밍 효과는 오전 중반 이후에 감소했습니다. 잎은 gsn에 의해 다음과 같이 냉각되었습니다: gsn(↑) → E(증산)(↑) → Tleaf(잎 온도)(↓). 그러나 우리의 결과는 증발 냉각이 Rn 비용을 감소시키지 않았다는 것을 분명히 시사합니다. 우리의 결과는 gsn이 물 및 영양소 가용성보다 탄소 호흡 및 동화와 더 밀접하게 관련되어 있으며 잎 형질 조정(Rn - gsn - gsd - A)이 gsn을 제어하는 주요 메커니즘일 가능성이 있음을 나타냅니다. 제3장에서 우리는 현재의 작물 수확량을 늘리고 관개 용수 소비를 줄이며 침수된 쌀 생산 시스템에서 CH4와 N2O 배출량을 동시에 줄이는 딜레마를 해결하는 것을 목표로 했다. 휴리스틱하고 전체론적 방법을 제안함으로써, 우리는 이전에 가장 강조되었던 관개 체제를 넘어 농장 관리를 최적화함과 동시에 파종 창, 수정률, 경작 깊이 및 이들의 상호 작용과 관련된 다른 중추적 옵션의 틈새를 탐색했다. 구체적으로, 우리는 5년간의 와류 공분산 관찰로 프로세스 기반 DNDC 모델을 교정하고 검증했다. DNDC 모델은 나중에 다중 객관적 최적화 문제를 해결하기 위해 비지배적 정렬 유전 알고리듬(NSGA-III)과 통합되었다. 우리는 최적화된 관리를 통해 50% 이상의 관개 수요와 GHG(CH4 & N2O) 배출량을 줄이면서 현재 농작물 수확량을 잠재력(~10t/ha)까지 유지하거나 증가시킬 수 있다는 것을 발견했습니다. 우리의 결과는 더 이른 파종 기간과 관개 관개 관행의 개선이 환경적 이익을 유지하면서 농작물 수확량을 최대화하는 데 중추적일 것이라는 것을 보여준다. 우리는 홍수 없는 날의 최적 부분이 성장기 길이의 약 54%였고 최적의 시간 분포는 주로 식물 단계에 있다는 것을 발견했다. 우리의 연구는 연구 현장의 현재 농장 수확량(8.3-8.9 t/ha)이 잠재적 수준을 달성했을 뿐만 아니라 수자원(604-810 mm/yr)과 GHGs 배출(CH4: 186-220 kg C/ha/yr; N2O: 0.3-1.6 kg C/ha/yr)에 막대한 환경 비용을 초래한다는 것을 보여준다. 또한, 이 간단한 방법은 다양한 기후 및 지역 조건 하에서 농업 시스템의 환경 지속 가능성을 평가하고 정책 입안자와 농업 관행을 포괄적인 해결책으로 안내하는 데 추가로 적용될 수 있다. 제4장에서는 컨볼루션 신경망(CNN) 모델을 적용하여 두 개의 구별되는 농업 지역에서 구글 스트리트 뷰(GSV) 이미지를 통해 자동 지상 트러싱의 효과를 탐구한다. 일리노이와 캘리포니아의 센트럴 밸리. 지상 참조 데이터는 감독된 작물 매핑을 위한 필수 전제 조건이다. 저렴하고 효율적인 지상 참조 방법이 없기 때문에 참조 데이터가 광범위하게 제한되고 작물 분류를 방해한다. 본 연구에서는 클라우드 기반 Google 어스 엔진 플랫폼을 사용하여 상태 수준에서 픽셀 기반 크롭 매핑을 수행하여 새로운 지상 참조 기술의 실현 가능성과 신뢰성을 입증한다. 매핑 결과는 미국 농무부(USDA) 작물 데이터층(CDL) 제품을 사용하여 평가된다. 약 130,000개의 GSV 이미지에서 CNN 모델은 약 9,400개의 목표 크롭 이미지를 식별했다. 이 이미지들은 알팔파, 아몬드, 옥수수, 면화, 포도, 쌀, 콩, 피스타치오 등의 작물 유형으로 잘 분류된다. 전체 GSV 이미지 분류 정확도는 센트럴 밸리의 경우 92%, 일리노이 주의 경우 97%이다. 그 후 이미지 지리적 좌표를 특정 방향으로 2~3회 이동하여 31,829개의 크롭 기준점을 생성했다. 즉, 일리노이에서 17,358개, 센트럴 밸리에서 14,471개였다. CDL 제품으로 매핑 결과를 평가한 결과 만족스러운 일관성이 나타났다. GSV에서 파생된 매핑 결과는 2011-2019년 작물 유형 분포의 일반적인 패턴을 포착한다. CDL 제품과 우리의 매핑 결과 사이의 전체 합치는 센트럴 밸리의 경우 0.44–0.99의 R2 값과 일리노이 주의 경우 0.81–0.98의 R2 값으로 표시된다. 제안된 방법의 다른 국가에서 적용 가치를 보여주기 위해, 꽤 좋은 결과를 얻은 한국의 논(2014–2018)을 추가로 매핑했다(R2=0.91). 이러한 결과는 딥 러닝 모델과 함께 사용되는 GSV 이미지가 세계의 많은 지역에서 지상 참조를 위한 효율적이고 비용 효율적인 대체 방법을 제공한다는 것을 나타낸다.1. Abstract 3 LIST OF FIGURES 9 LIST OF TABLES 13 ACKNOWLEDGEMENTS 14 Chapter I. Introduction 15 1.1. Study Background 15 1.2. Purpose of Research 15 Chapter II. Nocturnal stomatal conductance in rice: a coordinating bridge between prior respiration and photosynthesis next dawn 17 Abstract 17 1. Introduction 18 2. Materials and Methods 22 2.1 Plants and growth conditions 22 2.2 Leaf physiological traits 22 2.3 Rapid A/Ci response curves 24 2.4 Stomatal anatomy measurements 24 2.5 Statistical analyses 24 3. Results 25 3.1 Effects of abiotic stress on leaf traits 25 3.2 Nighttime leaf physiological traits 26 3.3 Significant priming effects of gsn on early morning photosynthesis (~5:00 – 7:00) 27 3.4 Path analyses only support the leaf trait coordination 28 3.5 Impacts of gsn on gsd and Amax under light-saturated conditions 29 3.6 Photosynthesis priming effects not detected after mid-morning (9:00) 31 4. Discussion 32 4.1 Abiotic stress results: Implications for different hypotheses 33 4.2 Enhanced carbon assimilation through coordinated regulation by gsn 34 4.3 Evaporative cooling: Passive thermoregulation via leaf trait coordination 36 References 37 Chapter III. Multi-objective optimization of crop yield, water consumption, and greenhouse gases emissions for sustainable rice production 42 Abstract 42 1. Introduction 43 2. Materials and methods 46 2.1 Study site 46 2.2 DNDC model 46 2.3 In situ data 47 2.4 Multi-objective optimization (MOO) algorithm 48 2.5 DNDC-NSGA-III integration and optimization 48 3. Results 50 3.1 DNDC model validation 50 3.2 The gaps between the current farming outcomes and optimized objectives 53 3.3 Approaching Pareto fronts through the heuristic and holistic management 55 3.4 The gaps between current farming practices to potential crop yield with optimal holistic management 56 4. Discussion 58 4.1 Could heuristic and holistic management increase current rice yield with less irrigation water? 58 4.2 Could heuristic and holistic management simultaneously reduce CH4 and N2O emissions? 59 4.3 Limitations and uncertainties 60 Reference 61 Chapter IV. Exploring Google Street View with Deep Learning for Crop Type Mapping 70 Abstract 70 1. Introduction 71 2. Materials and Methods 74 2.1 Study area 74 2.2 General methodology 75 2.3 Google Street View image collection 76 2.4 CNN model training and validation 77 2.5 Producing ground reference data and quality control 79 2.6 Mapping crop types 80 2.7 Mapping results evaluation 81 2.8 Additional test case 82 3. Results 83 3.1 GSV image classification 83 3.2 Producing ground reference data from classified GSV images 84 3.3 Mapping using the GSV derived ground reference 86 4. Discussion 96 4.1 Can we use GSV images to efficiently produce low-cost, sufficient, and reliable crop type ground reference data covering large areas? 96 4.2 Can we use GSV-derived reference data as “ground truth” to map crop types for large areas spanning many years? 97 Appendix 99 References 105 Chapter V. Conclusions 123 Supplementary Information Chapter II 125 Supplementary Information Chapter III 131 Supplementary Information Chapter IV 135 5. Abstract in Korean 138박

Novel Transcription Techniques for Multiple-Spacecraft, Multiple-Target Global Trajectory Optimization

With ever increasingly capable tools available to interplanetary mission designers, newer challenging classes of missions become accessible. Among these new classes of missions are Distributed Spacecraft Missions: designs where multiple spacecraft cooperate to achieve coordinated science objectives. Several applications being explored include, but are not limited to: coordinated launch, coordinated rendezvous, mega-constellation design, precision formation flying (PFF), very long baseline interferometry (VLBI), and distributed aperture space telescopes. These mission architectures promise to widen our gaze on the scientific phenomena in our solar system and beyond. However, current operational state-of-the art global trajectory optimization platforms lack the core capabilities to pose these complex new classes missions. These capabilities include: the ability to model multiple individual trajectory optimization problems as one single coupled trajectory optimization problem, the imposition of coordination constraints and cost functions, and the ability to traverse massive search spaces. In this dissertation, we present a fully automated multi-agent multi-objective technique for solving multi-spacecraft multi-target trajectory optimization problems using a hybrid optimal control approach. We apply this technique to two benchmark problems: an Ice Giants Dual Manifest mission design, and a variable fleet size Very Long Baseline Interferometry mission design. The techniques developed in this work create a general transcription for Multiple Traveling Salesmen Problems applied to global spacecraft trajectory optimization

Preference focussed many-objective evolutionary computation

Solving complex real-world problems often involves the simultaneous optimisation of multiple con icting performance criteria, these real-world problems occur in the elds of engineering, economics, chemistry, manufacturing, physics and many more. The optimisation process usually involves some design challenges in the form of the optimisation of a number of objectives and constraints. There exist many traditional optimisation methods (calculus based, random search, enumerative, etc...), however, these only o er a single solution in either adequate performance in a narrow problem domain or inadequate performance across a broad problem domain. Evolutionary Multi-objective Optimisation (EMO) algorithms are robust optimisers which are suitable for solving complex real-world multi-objective optimisation problems, as they are able to address each of the con icting objectives simultaneously. Typically, these EMO algorithms are run non-interactively with a Decision Maker (DM) setting the initial parameters of the algorithm and then analysing the results at the end of the optimisation process. When EMO is applied to real-world optimisation problems there is often a DM who is only interested in a portion of the Pareto-optimal front, however, incorporation of DM preferences is often neglected in the EMO literature. In this thesis, the incorporation of DM preferences into EMO search methods has been explored. This has been achieved through the review of EMO literature to identify a powerful method of variation, Covariance Matrix Adaptation (CMA), and its computationally infeasible EMO implementation, MO-CMA-ES. A CMA driven EMO algorithm, CMA-PAES, capable of optimisation in the presence of many objectives has been developed, benchmarked, and statistically veri ed to outperform MO-CMA-ES and MOEA/D-DRA on selected test suites. CMA-PAES and MOEA/D-DRA with the incorporation of the novel Weighted Z-score (WZ) preference articulation operator (supporting a priori, a posteriori or progressive incorporation) are then benchmarked on a range of synthetic and real-world problems. WZ-CMA-PAES is then successfully applied to a real-world problem regarding the optimisation of a classi er for concealed weapon detection, outperforming previously published classi er implementations