Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"Pareto optima"”.

  1. Lens design and optimization using multi-objective evolutionary algorithms

    … A set of trade-off solutions representing the optima, known as Pareto-Optima in multi-objective analysis, was obtained. A comparison of obtained optima to the known optima was done. Pareto-Optima in objective space for the selected Petzval lens design problem are shown to exhibit saddle points …

    must-thes Repository record for Lens design and optimization using multi-objective evolutionary algorithms (opens in a new tab)

  2. Pareto Optimization in Robotics With Acceleration Constraints

    Earlier work demonstrated a finite number of Pareto-optimal classes of motion plans when the robots are subjected to velocity bounds but no acceleration bounds. We prove that, when velocity and acceleration are bounded, the finiteness result still holds for systems involving only two robots. In …

    uiuc Repository record for Pareto Optimization in Robotics With Acceleration Constraints (opens in a new tab)

  3. Novel Semi-Active Suspension with Tunable Stiffness and Damping Characteristics

    … optimization strength of genetic algorithms, a Pareto optima set can be generated to determine the compromises between objective functions that have been normalized. Using a trade-off study, the stiffness and damping properties can be selected from the Pareto optima set for suitability within an …

    waterloo Repository record for Novel Semi-Active Suspension with Tunable Stiffness and Damping Characteristics (opens in a new tab)

  4. Artificial neural network-assisted repair technique for handling constraints in structural optimization

    … algorithms which can find the global optimum or Pareto optima. Constraints create complex hyperspaces that are difficult to navigate, and traditional constraint handling techniques (CHTs) might not be capable of steering the search. Repair techniques are one type of CHTs that can be very …

    ubc Repository record for Artificial neural network-assisted repair technique for handling constraints in structural optimization (opens in a new tab) Download PDF for Artificial neural network-assisted repair technique for handling constraints in structural optimization (opens in a new tab)

  5. Topics in multiple criteria optimization

    … are investigated. Second, we study the set of Pareto optimal and weakly Pareto optimal solutions to a vector maximization problem defined by continuous vector valued quasiconcave criterion functions and a closed convex set of decisions, S. If S is compact, it is shown that the set of weakly …

    ubc Repository record for Topics in multiple criteria optimization (opens in a new tab) Download PDF for Topics in multiple criteria optimization (opens in a new tab)

  6. A Posteriori And Interactive Approaches For Decision-making With Multiple Stochastic Objectives

    … have been proposed, many of which use the Pareto-based approaches that generate a finite set of compromise, or tradeoff, solutions. Nevertheless, identification of the most preferred solution can be a daunting task to the decisionmaker and is an order of magnitude harder in the presence of …

    ucf Repository record for A Posteriori And Interactive Approaches For Decision-making With Multiple Stochastic Objectives (opens in a new tab)

  7. Dynamics of market making algorithms in dealer markets

    … whereas collusion is described in terms of Pareto optima. This analytical exploration is further enriched by employing the decentralized multi-agent deep reinforcement learning algorithm, which unveils the latent pathways through which learning by market making algorithms can inadvertently …

    oxford Repository record for Dynamics of market making algorithms in dealer markets (opens in a new tab)

  8. Real-time path planning for a swarm of autonomous systems

    … optimization is developed to find out an optimal cost path by avoiding static and dynamic obstacles. The proposed algorithm reduces the computational time of path planning by applying simultaneous replanning strategy. The SRVPSO algorithm is also able to work under some vehicle …

    unsw Repository record for Real-time path planning for a swarm of autonomous systems (opens in a new tab)