Sökning: "finite-state strategy"

Visar resultat 1 - 5 av 6 uppsatser innehållade orden finite-state strategy.

1. 1. Practical Verification of Stateful Embedded C Code using Finite State Machines and VCC

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

   Författare :Mathias Lindgren; [2020]
   Nyckelord :;

   Sammanfattning : Vehicles in the 21st-century are becoming more and more dependent on embedded software systems for navigation, system control, monitoring, and entertainment. Manufacturers of cars have also over the years been put under more and more safety regulations and as such, some of these systems are of a safety critical nature and undergo rigorous reliability testing. LÄS MER

3. 2. Assessing the Economic Value of Implied Volatility Estimates

   D-uppsats, Handelshögskolan i Stockholm/Institutionen för finansiell ekonomi

   Författare :Johannes Ackermann; [2018]
   Nyckelord :implied volatility; option pricing; modern portfolio theory; GARCH; Markov switching models;

   Sammanfattning : This thesis studies the value of implied volatility estimates for portfolio allocation under the modern portfolio theory (MPT) framework introduced by Markowitz and compares the pricing performances of several common option pricing models. The thesis consists of two parts. LÄS MER

4. 3. Collaboration in Multi-agent Games : Synthesis of Finite-state Strategies in Games of Imperfect Information

   Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

   Författare :Edvin Lundberg; [2017]
   Nyckelord :Multi-agent games; multiagent games; multi-agent system; imperfect information; imperfect recall; collaboration; imperfect communication; finite-state strategy; concurrent games; concurrent system; strategy synthesis; strategy construction; automated programming; automated problem solving; automated collaboration; verification; knowledge-based subset construction; knowledge tracking;

   Sammanfattning : We study games where a team of agents needs to collaborate against an adversary to achieve a common goal. The agents make their moves simultaneously, and they have different perceptions about the system state after each move, due to different sensing capabilities. LÄS MER

5. 4. Dynamic Strategy in Real-Time Strategy Games : with the use of finite-state machines

   Kandidat-uppsats, Linnéuniversitetet/Institutionen för datavetenskap (DV)

   Författare :Marcus Svensson; [2015]
   Nyckelord :real-time strategy; game AI; finite-state machine; Starcraft;

   Sammanfattning : Developing real-time strategy game AI is a challenging task due to that an AI-player has to deal with many different decisions and actions in an ever changing complex game world. Humans have little problem when it comes to dealing with the complexity of the game genre while it is a difficult obstacle to overcome for the computer. LÄS MER

7. 5. Adaptive goal oriented action planning for RTS games

   Kandidat-uppsats, Blekinge Tekniska Högskola/Sektionen för datavetenskap och kommunikation

   Författare :Matteus Magnusson; Tobias Hall; [2010]
   Nyckelord :ai; game; spel; goal; goal oriented; action planning; adaptive; rts; spring; evolution rts;

   Sammanfattning : This thesis describes the architecture of an adaptive goal-oriented AI system that can be used for Real-Time Strategy games. The system is at the end tested against a single opponent on three different maps with different sizes to test the ability of the AI opposed to the 'standard' Finite State Machines and the likes in Real-Time Strategy games. LÄS MER