61 
Vehicle Routing for Emergency EvacuationsPereira, Victor Caon 22 November 2013 (has links)
This dissertation introduces and analyzes the Bus Evacuation Problem (BEP), a unique Vehicle Routing Problem motivated both by its humanitarian significance and by the routing and scheduling challenges of planning transitbased, regional evacuations. First, a variant where evacuees arrive at constant, locationspecific rates is introduced. In this problem, a fleet of capacitated buses must transport all evacuees to a depot/shelter such that the last scheduled pickup and the end of the evacuee arrival process occurs at a locationspecific time. The problem seeks to minimize their accumulated waiting time, restricts the number of pickups on each location, and exploits efficiencies from service choice and from allowing buses to unload evacuees at the depot multiple times. It is shown that, depending on the problem instance, increasing the maximum number of pickups allowed may reduce both the fleet size requirement and the evacuee waiting time, and that, past a certain threshold, there exist a range of values that guarantees an efficient usage of the available fleet and equitable reductions in waiting time across pickup locations. Second, an extension of the Ritter (1967) Relaxation Algorithm, which explores the inherent structure of problems with complicating variables and constraints, such as the aforementioned BEP variant, is presented. The modified algorithm allows problems with linear, integer, or mixedinteger subproblems and with linear or quadratic objective functions to be solved to optimality. Empirical studies demonstrate the algorithm viability to solve large optimization problems. Finally, a twostage stochastic formulation for the BEP is presented. Such variant assumes that all evacuees are at the pickup locations at the onset of the evacuation, that the set of possible demands is provided, and, more importantly, that the actual demands become known once buses visit the pickup locations for the first time. The effect of exploratory visits (sampling) and symmetry is explored, and the resulting insights used to develop an improved formulation for the problem. An iterative (dynamic) solution algorithm is proposed. / Ph. D.

62 
Control Design for a Microgrid in Normal and Resiliency Modes of a Distribution SystemAlvarez, Genesis Barbie 17 October 2019 (has links)
As inverterbased distributed energy resources (DERs) such as photovoltaic (PV) and battery energy storage system (BESS) penetrate within the distribution system. New challenges regarding how to utilize these devices to improve power quality arises. Before, PV systems were required to disconnect from the grid during a large disturbance, but now smart inverters are required to have dynamically controlled functions that allows them to remain connected to the grid. Monitoring power flow at the point of common coupling is one of the many functions the controller should perform. Smart inverters can inject active power to pick up critical load or inject reactive power to regulate voltage within the electric grid. In this context, this thesis focuses on a high level and local control design that incorporates DERs. Different controllers are implemented to stabilize the microgrid in an Islanding and resiliency mode. The microgrid can be used as a resiliency source when the distribution is unavailable. An average model in the DQ frame is calculated to analyze the inherent dynamics of the current controller for the point of common coupling (PCC). The space vector approach is applied to design the voltage and frequency controller. Secondly, using inverters for Volt/VAR control (VVC) can provide a faster response for voltage regulation than traditional voltage regulation devices. Another objective of this research is to demonstrate how smart inverters and capacitor banks in the system can be used to eliminate the voltage deviation. A mixedinteger quadratic problem (MIQP) is formulated to determine the amount of reactive power that should be injected or absorbed at the appropriate nodes by inverter. The Big M method is used to address the nonconvex problem. This contribution can be used by distribution operators to minimize the voltage deviation in the system. / Master of Science / Reliable power supply from the electric grid is an essential part of modern life. This critical infrastructure can be vulnerable to cascading failures or natural disasters. A solution to improve power systems resilience can be through microgrids. A microgrid is a small network of interconnected loads and distributed energy resources (DERs) such as microturbines, wind power, solar power, or traditional internal combustion engines. A microgrid can operate being connected or disconnected from the grid. This research emphases on the potentially use of a Microgrid as a resiliency source during grid restoration to pick up critical load. In this research, controllers are designed to pick up critical loads (i.e hospitals, street lights and military bases) from the distribution system in case the electric grid is unavailable. This case study includes the design of a Microgrid and it is being tested for its feasibility in an actual integration with the electric grid. Once the grid is restored the synchronization between the microgrid and electric must be conducted. Synchronization is a crucial task. An abnormal synchronization can cause a disturbance in the system, damage equipment, and overall lead to additional system outages. This thesis develops various controllers to conduct proper synchronization. Interconnecting inverterbased distributed energy resources (DERs) such as photovoltaic and battery storage within the distribution system can use the electronic devices to improve power quality. This research focuses on using these devices to improve the voltage profile within the distribution system and the frequency within the Microgrid.

63 
Preconditioning of KarushKuhnTucker Systems arising in Optimal Control ProblemsBattermann, Astrid 14 June 1996 (has links)
This work is concerned with the construction of preconditioners for indefinite linear systems. The systems under investigation arise in the numerical solution of quadratic programming problems, for example in the form of KarushKuhnTucker (KKT) optimality conditions or in interiorpoint methods. Therefore, the system matrix is referred to as a KKT matrix. It is not the purpose of this thesis to investigate systems arising from general quadratic programming problems, but to study systems arising in linear quadratic control problems governed by partial differential equations.
The KKT matrix is symmetric, nonsingular, and indefinite. For the solution of the linear systems generalizations of the conjugate gradient method, MINRES and SYMMLQ, are used. The performance of these iterative solution methods depends on the eigenvalue distribution of the matrix and of the cost of the multiplication of the system matrix with a vector. To increase the performance of these methods, one tries to transform the system to favorably change its eigenvalue distribution. This is called preconditioning and the nonsingular transformation matrices are called preconditioners. Since the overall performance of the iterative methods also depends on the cost of matrixvector multiplications, the preconditioner has to be constructed so that it can be applied efficiently.
The preconditioners designed in this thesis are positive definite and they maintain the symmetry of the system. For the construction of the preconditioners we strongly exploit the structure of the underlying system. The preconditioners are composed of preconditioners for the submatrices in the KKT system. Therefore, known efficient preconditioners can be readily adapted to this context. The derivation of the preconditioners is motivated by the properties of the KKT matrices arising in optimal control problems. An analysis of the preconditioners is given and various cases which are important for interior point methods are treated separately. The preconditioners are tested on a typical problem, a Neumann boundary control for an elliptic equation. In many important situations the preconditioners substantially reduce the number of iterations needed by the solvers. In some cases, it can even be shown that the number of iterations for the preconditioned system is independent of the refinement of the discretization of the partial differential equation. / Master of Science

64 
Application of Genetic Algorithm to a Forced Landing Manoeuvre on Transfer of Training AnalysisTong, Peter, mail@petertong.com January 2007 (has links)
This study raises some issues for training pilots to fly forced landings and examines the impact that these issues may have on the design of simulators for such training. It focuses on flight trajectories that a pilot of a singleengine general aviation aircraft should fly after engine failure and how pilots can be better simulator trained for this forced landing manoeuvre. A sensitivity study on the effects of errors and an investigation on the effect of tolerances in the aerodynamic parameters as prescribed in the Manual of Criteria for the Qualification of Flight Simulators have on the performance of flight simulators used for pilot training was carried out. It uses a simplified analytical model for the Beech Bonanza model E33A aircraft and a vertical atmospheric turbulence based on the MILF8785C specifications. It was found that the effect of the tolerances is highly sensitive on the nature of the manoeuvre flown and that in some cases, negative transfe r of training may be induced by the tolerances. A forced landing trajectory optimisation was carried out using Genetic Algorithm. The forced landing manoeuvre analyses with preselected touchdown locations and preselected final headings were carried out for an engine failure at 650 ft AGL for bank angles varying from banking left at 45° to banking right at 45°, and with an aircraft's speed varying from 75.6 mph to 208 mph, corresponding to 5% above airplane's stall speed and airplane's maximum speed respectively. The results show that certain preselected touchdown locations are more susceptible to horizontal wind. The results for the forced landing manoeuvre with a preselected location show minimal distance error while the quality of the results for the forced landing manoeuvre with a preselected location and a final heading show that the results depend on the end constraints. For certain preselected touchdown locations and final headings, the airplane may either touchdown very close to the preselected touchdown location but with greater final h eading error from the preselected final heading or touchdown with minimal final heading error from the preselected final heading but further away from the preselected touchdown location. Analyses for an obstacle avoidance forced landing manoeuvre were also carried out where an obstacle was intentionally placed in the flight path as found by the GA program developed for without obstacle. The methodology developed successfully found flight paths that will avoid the obstacle and touchdown near the preselected location. In some cases, there exist more than one ensemble grouping of flight paths. The distance error depends on both the preselected touchdown location and where the obstacle was placed. The distance error tends to increase with the addition of a specific final heading requirement for an obstacle avoidance forced landing manoeuvre. As with the case without specific final heading requirement, there is a trade off between touching down nearer to the preselected location and touching down with a smaller final heading error.

65 
MODELING, ESTIMATION AND BENCHMARKING OF LITHIUM ION ELECTRIC BICYCLE BATTERYWang, Weizhong January 2016 (has links)
As a conventional transportation modality, bicycles have been gradually electrified to meet the desire for convenient and green commuting patterns, especially in developed urban areas. The electric bicycle battery pack and its management system are core elements that determine key performance metrics such as electric range and output power. With respect to electric bicycle applications, focused research on the battery, its management system, and performance has received less attention compared to other energy storage applications.
In this thesis, a welldeveloped conversion kit produced by BionX is studied. A data collecting system is first installed to record both mechanical and electrical data, such as speed, power and voltage; this enables defining two standard riding cycles at different riding conditions. Two benchmarking tests are performed to investigate the battery life in pure electric mode and at different threshold levels of optimal assistance.
A novel quadratic programming based fitting algorithm is derived and applied in both time and frequency domain parameter identification tests. The proposed algorithm is able to fit single/multiple pulses by applying a masking vector. Sensitivity study and experimental results show the high robustness and fast computation time of the approach compared to existing and commonly used methods, such as fmincon. The comparison between hybrid power pulse characterization (HPPC) and electrochemical impedance spectrum (EIS) tests are performed in terms of extracted internal resistance.
A secondorder RC battery model is developed using parameters extracted from HPPC tests. The model is validated by experimental riding cycles and used to generate the reference SOC profiles that are employed in a SOC estimation study. Four estimation strategies, including extended Kalman Filter (EKF), Sigma point Kalman Filter (SPKF), Cubature Kalman Filter (CKF), and joint extended Kalman Filter (JEKF), are compared systematically in terms of accuracy, robustness and computation complexity. / Thesis / Master of Applied Science (MASc)

66 
Sheetstamping process simulation and optimizationTamasco, Cynthia M 06 August 2011 (has links)
This thesis presents the development and implementation of a generalized optimization framework for use in sheetstamping process simulation by finite element analysis. The generic framework consists of three main elements: a process simulation program, an optimization code, and a response filtering program. These elements can be filled by any combination of applicable software packages. Example sheetstamping process simulations are presented to demonstrate the usage of the framework in various forming scenarios. Each of the example simulations is presented with a sensitivity analysis. These examples include analysis of a 2dimensional singlestage forming, a 2dimensional multistage forming, and two different 3dimensional singlestage forming processes. A forming limit diagram is used to define failure in the 3dimensional process simulations. Optimization results are presented using damage minimization, thinning minimization, and springback minimization with aluminum alloy 6061T6 blanks.

67 
Distributed Feedback Control Algorithms for Cooperative Locomotion: From Bipedal to Quadrupedal RobotsKamidi, Vinaykarthik Reddy 25 March 2022 (has links)
This thesis synthesizes general and scalable distributed nonlinear control algorithms with application to legged robots. It explores both naturally decentralized problems in legged locomotion, such as the collaborative control of humanlower extremity prosthesis and the decomposition of highdimensional controllers of a naturally centralized problem into a net work of lowdimensional controllers while preserving equivalent performance. In doing so, strong nonlinear interaction forces arise, which this thesis considers and sufficiently addresses. It generalizes to both symmetric and asymmetric combinations of subsystems. Specifically, this thesis results in two distinct distributed control algorithms based on the decomposition approach.
Towards synthesizing the first algorithm, this thesis presents a formal foundation based on de composition, Hybrid Zero Dynamics (HZD), and scalable optimization to develop distributed controllers for hybrid models of collaborative humanrobot locomotion. This approach con siders a centralized controller and then decomposes the dynamics and parameterizes the feedback laws to synthesize local controllers. The Jacobian matrix of the Poincaré map with local controllers is studied and compared with the centralized ones. An optimization problem is then set up to tune the parameters of the local controllers for asymptotic stability. It is shown that the proposed approach can significantly reduce the number of controller parameters to be optimized for the synthesis of distributed controllers, deeming the method computationally tractable. To evaluate the analytical results, we consider a human amputee with the point of separation just above the knee and assume the average physical parameters of a human male. For the lowerextremity prosthesis, we consider the PRleg, a powered kneeankle prosthetic leg, and together, they form a 19 Degrees of Freedom (DoF) model. A multidomain hybrid locomotion model is then employed to rigorously assess the performance of the aforestated control algorithm via numerical simulations. Various simulations involving the application of unknown external forces and altering the physical parameters of the human model unbeknownst to the local controllers still result in stable amputee loco motion, demonstrating the inherent robustness of the proposed control algorithm.
In the later part of this thesis, we are interested in developing distributed algorithms for the realtime control of legged robots. Inspired by the increasing popularity of Quadratic programming (QP)based nonlinear controllers in the legged locomotion community due to their ability to encode control objectives subject to physical constraints, this thesis exploits the idea of distributed QPs. In particular, this thesis presents a formal foundation to systematically decompose QPbased centralized nonlinear controllers into a network of lowerdimensional local QPs. The proposed approach formulates a feedback structure be tween the local QPs and leverages a onestep communication delay protocol. The properties of local QPs are analyzed, wherein it is established that their steadystate solutions on periodic orbits (representing gaits) coincide with that of the centralized QP. The asymptotic convergence of local QPs' solutions to the steadystate solution is studied via Floquet theory. Subsequently, to evaluate the effectiveness of the analytical results, we consider an 18 DoF quadrupedal robot, A1, as a representative example. The network of distributed QPs mentioned earlier is condensed to two local QPs by considering a fronthind decomposition scheme. The robustness of the distributed QPbased controller is then established through rigorous numerical simulations that involve exerting unmodelled external forces and intro ducing unknown ground height variations. It is further shown that the proposed distributed QPs have reduced sensitivity to noise propagation when compared with the centralized QP.
Finally, to demonstrate that the resultant distributed QPbased nonlinear control algorithm translates equivalently well to hardware, an extensive set of blind locomotion experiments on the A1 robot are undertaken. Similar to numerical simulations, unknown external forces in the form of aggressive pulls and pushes were applied, and terrain uncertainties were introduced with the help of arbitrarily displaced wooden blocks and compliant surfaces. Additionally, outdoor experiments involving a wide range of terrains such as gravel, mulch, and grass at various speeds up to 1.0 (m/s) reiterate the robust locomotion observed in numerical simulations. These experiments also show that the computation time is significantly dropped when the distributed QPs are considered over the centralized QP. / Doctor of Philosophy / Inspiration from animals and human beings has long driven the research of legged loco motion and the subsequent design of the robotic counterparts: bipedal and quadrupedal robots. Legged robots have also been extended to assist human amputees with the help of powered prostheses and aiding people with paraplegia through the development of exoskeleton suits. However, in an effort to capture the same robustness and agility demonstrated by nature, our design abstractions have become increasingly complicated. As a result, the en suing control algorithms that drive and stabilize the robot are equivalently complicated and subjected to the curse of dimensionality. This complication is undesirable as failing to compute and prescribe a control action quickly destabilizes and renders the robot uncontrollable.
This thesis addresses this issue by seeking nature for inspiration through a different perspective. Specifically, through some earlier biological studies on cats, it was observed that some form of locality is implemented in the control of animals. This thesis extends this observation to the control of legged robots by advocating an unconventional solution. It proposes that a highdimensional, singlelegged agent be viewed as a virtual composition of multiple, lowdimensional subsystems. While this outlook is not new and forms precedent to the vast literature of distributed control, the focus has always been on largescale systems such as power networks or urban traffic networks that preserve sparsity, mathematically speaking. On the contrary, legged robots are underactuated systems with strong interaction forces acting amongst each subsystem and dense mathematical structures. This thesis considers this problem in great detail and proposes developments that provide theoretical stability guarantees for the distributed control of interconnected legged robots. As a result, two distinctly different distributed control algorithms are formulated.
We consider a naturally decentralized structure appearing in the form of a humanlower extremity prosthesis to synthesize distributed controllers using the first control algorithm.
Subsequently, the resultant local controllers are rigorously validated through extensive full order simulations. In order to validate the second algorithm, this thesis considers the problem of quadrupedal locomotion as a representative example. It assumes for the purposes of control synthesis that the quadruped is comprised of two subsystems separated at the geometric center, resulting in a front and hind subsystem. In addition to rigorous validation via numerical simulations, in the latter part of this thesis, to demonstrate that distributed controllers preserve practicality, rigorous and extensive experiments are undertaken in indoor and outdoor settings on a readily available quadrupedal robot A1.

68 
Alternative Methods for Operational Optimization of Hydro Power Plants / Alternativa Metoder för Driftoptimering av VattenkraftverkAlmgrund, Jonas January 2019 (has links)
The aim of this thesis is to optimize hydro power plants with data generated from observations and field tests at the plants. The output is optimal production tables and curves in order to operate and plan hydro power plants in an optimized way concerning power output, efficiency and distribution of water. The thesis is performed in collaboration with Vattenfall AB, which currently use an internal optimization program called SEVAP. Two alternative methods have been selected, employed and compared with the current optimization program, these are InteriorPoint Method and Sequential Quadratic Programming. Three startpoint strategies are created to increase the probability of finding a global optima. A heuristic rule is used for selection of strategy in order to prevent rapid changes in load distribution for small variations in dispatched water. The optimization is performed at three plants in Sweden with different size and setup. The results of this evaluation showed marginally better results for the employed methods in comparison to the currently used optimization. Further, the developed program is more flexible and compatible to integrate with future digitalization projects. / Syftet med detta examensarbete är att optimera vattenkraftverk med data som genererats från indextester vid kraftverken. Resultatet är optimala produktionstabeller och kurvor för drift och planering av vattenkraftverk. Dessa är baserade på att optimalt fördela vattnet mellan aggregaten för att maximera uteffekt och verkningsgrad. Detta arbete har utförts i samarbete med Vattenfall AB, som för närvarande använder ett internt optimeringsprogram som heter SEVAP. Två optimeringsmetoder har valts, implementerats och jämförts med det nuvarande optimeringsprogrammet. Dessa metoder är inrepunktsmetoden (IPM) och sekventiell kvadratiskt programmering (SQP). Tre startpunktsstrategier har används för att öka sannolikheten att hitta ett globalt optima. För att förhindra hastiga förändringar i lastfördelning för små variationer av avsänt vatten har en heuristisk regel används. Optimeringen har utförts på tre stationer med olika uppsättning och storlek. Resultatet av detta examensarbete visar marginellt bättre resultat för de använda metoderna i jämförelse med den nuvarande optimeringen. Det utvecklade programmet är flexibelt och kompatibelt att integrera med framtida digitaliseringsprojekt.

69 
A nonlinear optimization approach for UPFC power flow control and voltage securityKalyani, Radha Padma, January 2007 (has links) (PDF)
Thesis (Ph. D.)University of MissouriRolla, 2007. / Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed November 29, 2007) Includes bibliographical references.

70 
Performance optimization of engineering systems with particular reference to drycooled power plants /Conradie, Antonie Eduard. January 1995 (has links)
Dissertation (PhD)University of Stellenbosch, 1995. / Bibliography. Also available via the Internet.

Page generated in 0.2664 seconds