Sökning: "Heuristic Search Algorithms"

Visar resultat 1 - 5 av 31 uppsatser innehållade orden Heuristic Search Algorithms.

  1. 1. Compact Representations of State Sets in State Space Search

    Master-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Hugo Axandersson; [2023]
    Nyckelord :State Space Search; Planning; Closed list; Open list; Memory compact; Level-Ordered Edge Sequence LOES ;

    Sammanfattning : Modern day technological advancements are moving at a rapid pace. In the field of Artificial Intelligence, algorithms are becoming ever faster and process larger amounts of data. These fast algorithms call for data structures that can store this processed data compactly. This premise also holds true in the AI subfield of planning. LÄS MER

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

    Master-uppsats, Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)

    Författare :Fredrik Rönnkvist; [2023]
    Nyckelord :Motion planning; Path planning; Cubic splines; Coverage path planning.;

    Sammanfattning : 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. LÄS MER

  4. 3. Reinforcement learning for improved local search : Applied to the graph coloring problem

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Adrian Salamon; Klara Sandström; [2023]
    Nyckelord :;

    Sammanfattning : The graph coloring problem (GCP) is an important combinatorial optimization problem (COP) with various applications and a simple formulation: to assign colors to vertices in a graph such that no adjacent vertices share a color. The GCP is NP-hard, and in order to solve it within a reasonable time frame, heuristic local search (LS) based algorithms are commonly used. LÄS MER

  5. 4. Comprehensive Study of Meta-heuristic Algorithms for Optimal Sizing of BESS in Multi-energy syste

    Master-uppsats, KTH/Skolan för industriell teknik och management (ITM)

    Författare :Joakim Ginste; [2022]
    Nyckelord :BESS; Energy arbitrage; Firefly algorithm; Genetic algorithm; Peak shaving; BESS; energiarbitrage; Firefly algorithm; Genetic algorithm; spetslastutjämning;

    Sammanfattning : The question of finding the optimal size for battery energy storage systems (BESS) to be used for energy arbitrage and peak shaving has gained more and more interest in recent years. This is due to the increase in variability of electricity prices caused by the increase of renewable but also variable electricity production units in the electricity grid. LÄS MER

  7. 5. A Comparative Study on Optimization Algorithms and its efficiency

    Master-uppsats, Blekinge Tekniska Högskola/Institutionen för datavetenskap

    Författare :Kareem Ahmed Sheik; [2022]
    Nyckelord :Optimization; Heuristic Search Algorithms; Benchmark Optimization Problems; Systematic literature review; Benchmark functions; Genetic Algorithm; Plant intelligence based optimization algorithm;

    Sammanfattning : Background: In computer science, optimization can be defined as finding the most cost-effective or notable achievable performance under certain circumstances, maximizing desired factors, and minimizing undesirable results. Many problems in the real world are continuous, and it isn't easy to find global solutions. LÄS MER