Sökning: "dijkstra maps"

Hittade 3 uppsatser innehållade orden dijkstra maps.

1. 1. A Scalability and Performance Evaluation of Precomputed Flow FieldMaps for Multi-Agent Pathfinding

   Kandidat-uppsats, Blekinge Tekniska Högskola/Institutionen för datavetenskap

   Författare :Jonathan Helsing; Alexander Bruce; [2022]
   Nyckelord :pathfinding; flow field; multi-agent; precomputed; dijkstra maps;

   Sammanfattning : Background. The A* algorithm is a well-established pathfinding technique frequently used in video game development. However, a disadvantage of the A* algorithm is that it becomes computationally inefficient and impractical to utilize whenthousands of agents demand an optimal path. LÄS MER

3. 2. Comparing technologies and algorithms behind mapping and routing APIs for Electric Vehicles

   M1-uppsats, Jönköping University/JTH, Datateknik och informatik

   Författare :Erik Andreasson; Amanda Axelsson; [2020]
   Nyckelord :Charging station; Electric vehicles; Routing API; Navigation API; Routing Algorithm; Pathfinding algorithm; Map visualization;

   Sammanfattning : The fast-developing industry of electric vehicles is growing, and so is the driver community, which puts pressure on the electric charging grid. The purpose of this thesis is to simplify for the drivers of electric cars to charge their cars during trips. LÄS MER

4. 3. Exploration Strategies for Robotic Vacuum Cleaners

   Master-uppsats, KTH/Mekatronik

   Författare :Sofia Navarro Heredia; [2018]
   Nyckelord :grid maps; frontier-based exploration strategies; NBV; node graph; path planning algorithm; Rutnätskartor; front-baserade strategier för utforskning; nästa bästa utsiktspunkt; nod-graf; algoritm för banplanering;

   Sammanfattning : In this thesis, an exploration mode for the PUREi9 robotic vacuum cleaner is implemented. This exploration would provide information for optimizing the cleaning path beforehand, and would allow the robot to relocalize itself or the charger more easily in case it gets lost. LÄS MER