Engineering Commons^™

An Algorithm For Biobjective Mixed Integer Quadratic Programs, Pubudu Jayasekara Merenchige

All Dissertations

Multiobjective quadratic programs (MOQPs) are appealing since convex quadratic programs have elegant mathematical properties and model important applications. Adding mixed-integer variables extends their applicability while the resulting programs become global optimization problems. Thus, in this work, we develop a branch and bound (BB) algorithm for solving biobjective mixed-integer quadratic programs (BOMIQPs). An algorithm of this type does not exist in the literature.

The algorithm relies on five fundamental components of the BB scheme: calculating an initial set of efficient solutions with associated Pareto points, solving node problems, fathoming, branching, and set dominance. Considering the properties of the Pareto set of …

Development Of Novel Compound Controllers To Reduce Chattering Of Sliding Mode Control, Mehran Rahmani

Theses and Dissertations

The robotics and dynamic systems constantly encountered with disturbances such as micro electro mechanical systems (MEMS) gyroscope under disturbances result in mechanical coupling terms between two axes, friction forces in exoskeleton robot joints, and unmodelled dynamics of robot manipulator. Sliding mode control (SMC) is a robust controller. The main drawback of the sliding mode controller is that it produces high-frequency control signals, which leads to chattering. The research objective is to reduce chattering, improve robustness, and increase trajectory tracking of SMC. In this research, we developed controllers for three different dynamic systems: (i) MEMS, (ii) an Exoskeleton type robot, and …

Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo

Williams Honors College, Honors Research Projects

In order for an electrical network to be printed on a flat surface without changing the network’s input or output, it is important to consider if any wires will cross and if this problem can be avoided. If a circular network can be printed so that no wires cross, the network is said to be circular planar. In this paper, we identify a number of wiring patterns that make circular planarity impossible. We find exactly 3 wiring patterns using circular pairs with sets of two nodes, and we find exactly 78 wiring patterns using circular pairs with sets of three …