Sökning: "Greedy Search"
Visar resultat 1 - 5 av 30 uppsatser innehållade orden Greedy Search.
1. AI and real-time Strategy Games
Master-uppsats, Stockholms universitet/Institutionen för data- och systemvetenskapSammanfattning : As artificial intelligence continues to progress, applications hope to have AI perform tasks as good, if not better, than a human. A good way to test theoretical applications is through games, simple to complex. LÄS MER
2. Implementation of an Irregular Packaging Algorithm for Multi-Container
Master-uppsats, Uppsala universitet/Industriell teknikSammanfattning : This study introduces an innovative approach to address a complex, real-world packing problem experienced at Emerson Rosemount Tank Radar. The objectives of the study are manifold: primarily, the optimization of packing efficiency within specified geometric and box constraints, and secondarily, the fulfillment of specific packing objectives. LÄS MER
3. Modelling Cyber Security of Networks as a Reinforcement Learning Problem using Graphs : An Application of Reinforcement Learning to the Meta Attack Language
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : ICT systems are part of the vital infrastructure in today’s society. These systems are under constant threat and efforts are continually being put forth by cyber security experts to protect them. By applying modern AI methods, can these efforts both be improved and alleviated of the cost of expert work. LÄS MER
4. Using Symmetry for Realistic Virtual Living Room Generation : Generating virtual layouts
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Procedurell generering är en teknik som används inom dataspel och annan programvara för att generera innehåll algoritmiskt snarare än manuellt. I detta projekt utökas metoden av Kán och Kaufmann (2018) för att procedurellt generera trovärdiga, virtuella scenlayouter till att använda reflekterande symmetri för syntes [14]. LÄS MER
5. Optimal Path Planning for Aerial Swarm in Area Exploration
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : This thesis presents an approach to solve an optimal path planning problem for a swarm of drones. We optimize and improve information retrieval in area exploration within applications such a ‘Search and Rescue’-missions or reconnaissance missions. For this, dynamic programming has been used as a solving approach for a optimization problem. LÄS MER