Avancerad sökning

Visar resultat 1 - 5 av 9 uppsatser som matchar ovanstående sökkriterier.

  1. 1. On the strategic abilities gained by using knowledge-based strategies for multi-agent teams playing against nature

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

    Författare :Sam Maltin; Simon Rosén; [2023]
    Nyckelord :;

    Sammanfattning : Analogous to how the Knowledge-Based Subset Construct (KBSC) can transform games of imperfect information against nature into games of perfect information, making it easier to find winning strategies for objectives in these games, the multi-agent knowledge-based subset construct (MKBSC) can be used to find winning strategies in multi-agent games of imperfect information. The difference between the two algorithms is that the generalized version can be applied multiple times, which is interpreted as the agent’s considering not just their own knowledge of the game, but also their knowledge of the other agents, and the knowledge of the other agent’s knowledge about their own knowledge, etc. LÄS MER

  2. 2. Visual Scripting for AR Board Games in Thrymd

    Uppsats för yrkesexamina på grundnivå, Luleå tekniska universitet/Datavetenskap

    Författare :Fredrik Lind; [2021]
    Nyckelord :nodes; visual scripting; visual; graph; graph-based; VPL; visual programming language; ar; board games; noder; visuell skriptning; visuell; grafbaserad; VPL; visuellt programmeringsspråk; ar; brädspel;

    Sammanfattning : In recent years, the interest in Augmented Reality (AR) applications for entertainment and productivity has grown. One company exploring this technology is LAZER WOLF STUDIOS, the developers behind Thrymd: an AR-driven board games platform powered by the Unity engine. LÄS MER

  3. 3. A Method for Finding Strategies in Pursuit-Evasion Games

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

    Författare :Olaf Gren; Dennis Magnusson; [2020]
    Nyckelord :;

    Sammanfattning : Many real-world situations can be described as games over finite graphs, con- sisting of a set of agents performing joint actions affecting the state of the game. One class of games over finite graphs are the so called pursuit-evasion games, where a set of pursuers try to capture an evader on a finite map. LÄS MER

  4. 4. Identifiering och simulering av en låskistas profil

    Uppsats för yrkesexamina på grundnivå, Högskolan i Halmstad/Akademin för informationsteknologi

    Författare :Johan Hoff; Abdulahi Farah; [2020]
    Nyckelord :Lås; Phoniro; låskista; låslåda; testning;

    Sammanfattning : The fact that companies test their products is important for our society to function well. It is especially important when products will be used in the welfare, when human health is at stake. This thesis is about tests performed on Phoniro's lockbox. LÄS MER

  5. 5. Epistemic Structures for Strategic Reasoning in Multi-Player Games

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

    Författare :Erik Handberg; Lara Rostami; [2019]
    Nyckelord :;

    Sammanfattning : A game can be visualised with a directed graph, where each node is a game state and the edges are the players’ actions that lead to new game states. To obtain the winning condition of the game whilst avoiding the losing condition, the players must perform the correct actions in coalition. LÄS MER