Return to search

Potential mapping strategies for multiple-agent pursuit evasion problems

This thesis presents distribution strategies for pursuit evasion games of networked multi-agent systems. The strategies are designed for both obstacle-free and obstacle-cluttered environments, leveraging potential maps as a method. The effectiveness of the proposed strategies was eval- uated through simulation and analysis, and the result is that combining a potential map and position extrapolation for obstacle avoidance was very successful at producing competent autonomous agents, and very com- patible when combined with specifically tailored pursuer algorithms for seeking and capture

Identiferoai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-348816
Date January 2024
CreatorsMarin, Viktor, Sandström Nordin, Simon
PublisherKTH, Skolan för teknikvetenskap (SCI)
Source SetsDiVA Archive at Upsalla University
LanguageEnglish
Detected LanguageEnglish
TypeStudent thesis, info:eu-repo/semantics/bachelorThesis, text
Formatapplication/pdf
Rightsinfo:eu-repo/semantics/openAccess
RelationTRITA-SCI-GRU ; 2024:264

Page generated in 0.0021 seconds