Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Model Checked Reinforcement Learning For Multi-Agent Planning
Mälardalen University, School of Innovation, Design and Engineering.
2023 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Autonomous systems, or agents as they sometimes are called can be anything from drones, self-driving cars, or autonomous construction equipment. The systems are often given tasks of accomplishing missions in a group or more. This may require that they can work within the same area without colliding or disturbing other agents' tasks. There are several tools for planning and designing such systems, one of them being UPPAAL STRATEGO. Multi-agent planning (MAP) is about planning actions in optimal ways such that the agents can accomplish their mission efficiently. A method of doing this named MCRL, utilizes Q learning as the algorithm for  finding an optimal plan. These plans then need to be verified to ensure that they can accomplish what a user intended within the allowed time, something that UPPAAL STRATEGO can do. This is because a Q-learning algorithm does not have a correctness guarantee. Using this method alleviates the state-explosion problem that exists with an increasing number of agents. Using UPPAAL STRATEGO it is also possible to acquire the best and worst-case execution time (BCET and WCET) and their corresponding traces. This thesis aims to obtain the BCET and WCET and their corresponding traces in the model.

Place, publisher, year, edition, pages
2023. , p. 19
Keywords [en]
MALTA; UPPAAL, UPPAAL STRATEGO, TImed Games, Q-Learning, Timed Automata, Timed Games
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:mdh:diva-64359OAI: oai:DiVA.org:mdh-64359DiVA, id: diva2:1800423
Subject / course
Computer Science
Supervisors
Examiners
Available from: 2023-09-28 Created: 2023-09-26 Last updated: 2023-09-28Bibliographically approved

Open Access in DiVA

fulltext(541 kB)170 downloads
File information
File name FULLTEXT01.pdfFile size 541 kBChecksum SHA-512
64bf3d095a6d14b5c4f3e96c46696424e12f5a0734f91f2a99e625cee7014ceedaa50ed589f94e949a06cda0cb5080a6b9869701dc6dc6068545a5b1ed4e7a95
Type fulltextMimetype application/pdf

By organisation
School of Innovation, Design and Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 170 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 288 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf