Sökning: "MKBSC"

Visar resultat 1 - 5 av 16 uppsatser innehållade ordet MKBSC.

  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

  3. 2. A Formally Motivated Algorithm for Synthesis of Strategies in Multi-Agent Games of Imperfect Information Against Nature

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

    Författare :Jakob Alfredsson; Jakob Carlsson; [2023]
    Nyckelord :;

    Sammanfattning : In this project we study games where multiple agents cooperate to reach some common team objective. The agents do not have perfect information about the game state, and they cannot communicate during the course of the game. LÄS MER

  4. 3. Investigation on stability of Knowledge Based Subset Construction in Multi-Agent Games

    Kandidat-uppsats, KTH/Datavetenskap

    Författare :Gustaf Johansson; Gustaf Bergmark; [2022]
    Nyckelord :Multi-Agent games; Imperfect information; Strategy synthesis; Structural conditions; Fleragentsspel; Ofullständig information; Strategisyntes; Strukturella villkor;

    Sammanfattning : Many real life problems can be modelled using multi-agent games played on finite graphs. When an agent cannot differentiate between game states, for example when a robot operates with a broken sensor, the game is classified as a game of imperfect information. LÄS MER

  5. 4. An efficient algorithm for strategy synthesis in multi-agent games of imperfect information

    Kandidat-uppsats, KTH/Datavetenskap

    Författare :Alfred Andersson; [2022]
    Nyckelord :;

    Sammanfattning : This project studies games where a team of agents cooperate to achieve a given objective. The agents are assumed to have imperfect information about the game state and no means of communicating with each other. LÄS MER

  7. 5. Asynchronous Multi-Agent Games With Imperfect Information and Knowledge Based Strategies

    Kandidat-uppsats, KTH/Datavetenskap

    Författare :Daniel Hartler; Jakob Ewaldsson; [2022]
    Nyckelord :;

    Sammanfattning : This project investigates abstract games, which model real life tasks that are projected onto graphs. Strategic planning within these games provide a way of coordinating the participants in order for them to reach some desired objective. LÄS MER