Jonas-Petersen commented 2 years ago

User story

As a SD
we need an algorithm to find the shortest route from point A to point B
So that the robot can find the shortest route to their destination

Acceptance criteria

Function should return a list of graph nodes an dedges that need to be traversed to get to the destination

Definition of done (DoD)

Linter & Checker were performed and passed
Code Review has been completed
Code was merged in sprint release candidate
Updates are written in issue comments
Feature builds and tests successfully
Acceptance by product owner
User Story & Acceptance Criteria fulfilled

DoD general criteria

Feature has been fully implemented
Feature has been merged into the mainline
All acceptance criteria were met
Product owner approved features
All tests are passing
Developers agreed to release

nmarkert commented 2 years ago

Implemented a graph search as an A* search in the graph_search.py file. After searching a shortest path from node A to node B this path gets stored in a dictionary, so that if a path for the same combination is searched again, it is already available.

For the A* search we used the python-astar library: https://github.com/jrialland/python-astar

UmangBR commented 2 years ago

35 describes the task to read in a file created from the SICK software and from this create a graph in our fms. This graph is stored in #37. The current issue uses the graph and finds the shortest path between two given points.

amosproj / amos2022ss03-turtlebot-fleet-management

[FMS] Graph route finding algorithm #59

User story

Acceptance criteria

Definition of done (DoD)

DoD general criteria

35 describes the task to read in a file created from the SICK software and from this create a graph in our fms. This graph is stored in #37. The current issue uses the graph and finds the shortest path between two given points.