267,546 research outputs found
Computing the minimum perimeter triangle enclosing a convex polygon: Theory and implementation.
Geometric optimization, an important field of computational geometry, finds the best possible solution to a computational problem that involves geometric objects. An attractive fundamental problem in this area is one of approximating a convex n-gon with a simpler convex k-gon, where k \u3c n, and the area or the perimeter of the approximate object is minimized. This problem arises in a wide range of applications, such as geographic information systems (GIS), spatial databases, pattern recognition, and computer graphics, to name but a few. The approximation of convex polygons with their respective enclosing triangles is a particularly interesting problem; however, finding an optimal linear time solution for computing the minimum perimeter triangle enclosing a convex polygon was a long-standing open problem, which turned out to be more difficult than determining an enclosing triangle of minimal area. In this thesis, we suggest some theoretical and practical justifications for the linear time complexity of a recently proposed optimal solution and provide an efficient and robust implementation of that solution. (Abstract shortened by UMI.) Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2003 .M43. Source: Masters Abstracts International, Volume: 42-02, page: 0618. Adviser: Asish Mukhopadhyay. Thesis (M.Sc.)--University of Windsor (Canada), 2003
Hybridization of multi-objective deterministic particle swarm with derivative-free local searches
The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems. The objective is to show how the hybridization of two multi-objective derivative-free global and local algorithms achieves better performance than the separate use of the two algorithms in solving specific SBDO problems for hull-form design. The proposed method belongs to the class of memetic algorithms, where the global exploration capability of multi-objective deterministic particle swarm optimization is enriched by exploiting the local search accuracy of a derivative-free multi-objective line-search method. To the authors best knowledge, studies are still limited on memetic, multi-objective, deterministic, derivative-free, and evolutionary algorithms for an effective and efficient solution of SBDO for hull-form design. The proposed formulation manages global and local searches based on the hypervolume metric. The hybridization scheme uses two parameters to control the local search activation and the number of function calls used by the local algorithm. The most promising values of these parameters were identified using forty analytical tests representative of the SBDO problem of interest. The resulting hybrid algorithm was finally applied to two SBDO problems for hull-form design. For both analytical tests and SBDO problems, the hybrid method achieves better performance than its global and local counterparts
On the Selection of Tuning Methodology of FOPID Controllers for the Control of Higher Order Processes
In this paper, a comparative study is done on the time and frequency domain
tuning strategies for fractional order (FO) PID controllers to handle higher
order processes. A new fractional order template for reduced parameter modeling
of stable minimum/non-minimum phase higher order processes is introduced and
its advantage in frequency domain tuning of FOPID controllers is also
presented. The time domain optimal tuning of FOPID controllers have also been
carried out to handle these higher order processes by performing optimization
with various integral performance indices. The paper highlights on the
practical control system implementation issues like flexibility of online
autotuning, reduced control signal and actuator size, capability of measurement
noise filtration, load disturbance suppression, robustness against parameter
uncertainties etc. in light of the above tuning methodologies.Comment: 27 pages, 10 figure
State of the Art in the Optimisation of Wind Turbine Performance Using CFD
Wind energy has received increasing attention in recent years due to its sustainability and geographically wide availability. The efficiency of wind energy utilisation highly depends on the performance of wind turbines, which convert the kinetic energy in wind into electrical energy. In order to optimise wind turbine performance and reduce the cost of next-generation wind turbines, it is crucial to have a view of the state of the art in the key aspects on the performance optimisation of wind turbines using Computational Fluid Dynamics (CFD), which has attracted enormous interest in the development of next-generation wind turbines in recent years. This paper presents a comprehensive review of the state-of-the-art progress on optimisation of wind turbine performance using CFD, reviewing the objective functions to judge the performance of wind turbine, CFD approaches applied in the simulation of wind turbines and optimisation algorithms for wind turbine performance. This paper has been written for both researchers new to this research area by summarising underlying theory whilst presenting a comprehensive review on the up-to-date studies, and experts in the field of study by collecting a comprehensive list of related references where the details of computational methods that have been employed lately can be obtained
Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization
In this paper, we propose a general framework for constructing IGA-suitable
planar B-spline parameterizations from given complex CAD boundaries consisting
of a set of B-spline curves. Instead of forming the computational domain by a
simple boundary, planar domains with high genus and more complex boundary
curves are considered. Firstly, some pre-processing operations including
B\'ezier extraction and subdivision are performed on each boundary curve in
order to generate a high-quality planar parameterization; then a robust planar
domain partition framework is proposed to construct high-quality patch-meshing
results with few singularities from the discrete boundary formed by connecting
the end points of the resulting boundary segments. After the topology
information generation of quadrilateral decomposition, the optimal placement of
interior B\'ezier curves corresponding to the interior edges of the
quadrangulation is constructed by a global optimization method to achieve a
patch-partition with high quality. Finally, after the imposition of
C1=G1-continuity constraints on the interface of neighboring B\'ezier patches
with respect to each quad in the quadrangulation, the high-quality B\'ezier
patch parameterization is obtained by a C1-constrained local optimization
method to achieve uniform and orthogonal iso-parametric structures while
keeping the continuity conditions between patches. The efficiency and
robustness of the proposed method are demonstrated by several examples which
are compared to results obtained by the skeleton-based parameterization
approach
- …