Essays about: "Simulated Annealing"

Showing result 6 - 10 of 86 essays containing the words Simulated Annealing.

  1. 6. Minimizing initial margin requirements using computational optimization

    University essay from Umeå universitet/Institutionen för datavetenskap

    Author : Jacob Ahlman Bohm; [2023]
    Keywords : optimization; initial margin; simulated annealing; particle swarm optimization; differential evolution;

    Abstract : Trading contracts with future commitments requires posting a collateral, called initial margin requirement, to cover associated risks. Differences in estimating those risks and varying risk appetites can however lead to identical contracts having different initial margin requirements at different market places. READ MORE

  3. 7. A GPU Implementation of Kinodynamic Path Planning in Large Continuous Costmap Environments : Using Dijkstra's Algorithm and Simulated Annealing

    University essay from Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)

    Author : Robin Larsson; [2023]
    Keywords : ;

    Abstract : Path planning that takes kinodynamic constraints into account is a crucial part of critical missions where autonomous vehicles must function independently without communication from an operator as this ensures that the vehicle will be able to follow the planned path. In this thesis, an algorithm is presented that can plan kinodynamically feasible paths through large scale continuous costmap environments for different constraints on the maximum allowed acceleration and jerk along the path. READ MORE

  4. 8. Coverage Motion Planning for Search and Rescue Missions : A Costmap Based Approach for fixed wing UAVs using Simulated Annealing &Cubic Splines

    University essay from Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)

    Author : Fredrik Rönnkvist; [2023]
    Keywords : Motion planning; Path planning; Cubic splines; Coverage path planning.;

    Abstract : The present study proposes a novel approach to Coverage Path Planning for unmanned aerial vehicle (UAV) inspired by the Orienteering Problem. The main goal is to develop an algorithm suitable for Search and Rescue Missions, which can produce a search pattern with dynamical constrains, that is not limited to the traditional back-and-forth motion or spiral patterns. READ MORE

  5. 9. Optimization and Bayesian Modeling of Road Distance for Inventory of Potholes in Gävle Municipality

    University essay from Stockholms universitet/Statistiska institutionen

    Author : Timothy Rafael Lindblom; Oskar Tollin; [2022]
    Keywords : Traveling salesman problem; Bayesian inference; Simulated annealing; Nearest neighbour algorithm; Markov Chain Monte Carlo; MCMC; Potholes; Haversine formula; Metropolis-Hastings; Posterior predictive distribution; Handelsresande problemet; bayesiansk inferens; simulerad anlöpning; nearest neighbour algorithm; Markov Chain Monte Carlo; MCMC; potthål; storcirkelavstånd; Metropolis-Hastings; posterior predictive distribution;

    Abstract : Time management and distance evaluation have long been a difficult task for workers and companies. This thesis studies 6712 pothole coordinates in Gävle municipality, and evaluates the minimal total road distance needed to visit each pothole once, and return to an initial pothole. READ MORE

  6. 10. Costly Black-Box Optimization with GTperform at Siemens Industrial Turbomachinery

    University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Author : André Malm; [2022]
    Keywords : Black-Box Optimization; GTperform; STG-800; Simulated Annealing; Gradient Descent;

    Abstract : The simulation program GTperform is used to estimate the machine settings from performance measurements for the gas turbine model STG-800 at Siemens Industrial Turbomachinery in Finspång, Sweden. By evaluating different settings within the program, the engineers try to estimate the one that generatesthe performance measurement. READ MORE