Embedded Motion Control 2019 Group 9: Difference between revisions
| Line 72: | Line 72: | ||
==== Global path planning ==== | ==== Global path planning ==== | ||
The hospital is divided in structs 'room'. This is done both for preserving semantics and for practical purposes: it reduces computation time for path planning and it makes it easy to call information about corners and cabinets in the proximity of Pico. A 'door' is a separate struct. The connections between all rooms and doors are stored in a graph. A simple decision tree is used to construct a global route from one node to another on this graph. This calculated route is not per definition the fastest route, but this is not needed to succeed in the challenge. < uitleg> Each cabinet and each door have a unique enter-gridpoint. These points are used for local path planning. If an obstacle/closed door obstructs a door-enterpoint, the corresponding connection in the graph will be removed. As the "large door" connecting the two parts of the hallway could be partly obstructed, three enterpoints are assigned to this door. If no obstruction is present, the middle node will be used. The enterpoints can be viewed as white circles in the image below. | The hospital is divided in structs 'room'. This is done both for preserving semantics and for practical purposes: it reduces computation time for path planning and it makes it easy to call information about corners and cabinets in the proximity of Pico. A 'door' is a separate struct. The connections between all rooms and doors are stored in a graph. A simple decision tree is used to construct a global route from one node to another on this graph. This calculated route is not per definition the fastest route, but this is not needed to succeed in the challenge. < uitleg> Each cabinet and each door have a unique enter-gridpoint. These points are used for local path planning. If an obstacle/closed door obstructs a door-enterpoint, the corresponding connection in the graph will be removed. As the "large door" connecting the two parts of the hallway could be partly obstructed, three enterpoints are assigned to this door. If no obstruction is present, the middle node will be used. The enterpoints can be viewed as white circles in the left image below. | ||
==== Local path planning ==== | ==== Local path planning ==== | ||
Revision as of 18:20, 16 June 2019
Group members
Nicole Huizing | 0859610
Janick Janssen | 0756364
Merijn Veerbeek | 0865670
Design Documents
The Initial Design document can be found here: File:Initial Design Group9.pdf
The powerpoint presentation about the design is in this file: File:Presentation initial design.pdf
The powerpoint presentation about the final design can be found here: File:Presentation final design group9.pdf
Logbook
The composition of group 9 has changed twice. At first, George Maleas decided to quit the course at the 13th of May, two days before the escape room competition. At second, Merijn Floren also quit the course on the 3rd of June. The motive for both students was that they lacked the c++ programming skills to meaningfully contribute to the project. Participating in the course would take a too large investment of their time. The code for the final challenge was written by Janick Janssen, Merijn Veerbeek and Nicole Huizing.
Initial design
<<Mostly based on hospital challenge. Some remarks for escape room challenge can be made.>>
Requirements
Janick
Functions
Janick
Components
Janick
Specifications
Janick
Interfaces
Merijn
Escape room challenge
Code architecture:
World Model
Nicole
Detection
Nicole
Controller
Nicole
State manager
Nicole
Wall follower
explanation & movie of simulation & movie of real challenge & discussion on approach - Nicole
Exitfinder
explanation & movie of simulation (do we have something useful?) & discussion on approach - Janick
Hospital challenge
World model
Merijn
Perception
Janicks
Also simulation movie of updating map possible?
Localization
Merijn
Path planning
Nicole
Global path planning
The hospital is divided in structs 'room'. This is done both for preserving semantics and for practical purposes: it reduces computation time for path planning and it makes it easy to call information about corners and cabinets in the proximity of Pico. A 'door' is a separate struct. The connections between all rooms and doors are stored in a graph. A simple decision tree is used to construct a global route from one node to another on this graph. This calculated route is not per definition the fastest route, but this is not needed to succeed in the challenge. < uitleg> Each cabinet and each door have a unique enter-gridpoint. These points are used for local path planning. If an obstacle/closed door obstructs a door-enterpoint, the corresponding connection in the graph will be removed. As the "large door" connecting the two parts of the hallway could be partly obstructed, three enterpoints are assigned to this door. If no obstruction is present, the middle node will be used. The enterpoints can be viewed as white circles in the left image below.
Local path planning
To plan Pico's path, use is made of an A* pathplanning algorithm. This method was chosen over Dijkstra's method because it is faster. We will choose a heuristic function that is admissible, so it will be guarenteed that A* will give the shortest path from start to end.
All grid points on the map come with a boolean "accessible". Points that are close to a wall or an object receive the value 'false'. Mapping new objects is also based on this principle: whenever a new static object is detected, the gridpoints it covers will become unaccessible.
After the A* function is called with a certain start-gridpoint and end-gridpoint, it first goes through some checks. These checks assess whether the startposition and endposition are accessible and whether the startposition is the destination itself. If the startposition is unaccessible, the gridpoint itself and the points directly around it are temporarily made accessible (this is needed when Pico accidentally got too close to a wall or object).
Next, the start-node is put in the open list. At every cycle of the loop, the node in open list with the smallest f-value is evaluated. The f-value of node n is the sum of the cost of the path from start to node n and the heuristic cost of that node. This current node is put in the closed list. Next, the eight nodes around it are evaluated. If one of the nodes is the destination, the path from start-node to destination-node is reconstructed. If not, the cost-functions of these nodes are updated and if they are not yet in the closed list, they will be added to the open list from which the node with the lowest f-value will be evaluated in the next loop.
Finite state machine
Merijn
Results
Nicole
Discussion
Janick