Embedded Motion Control 2016 Group 7: Difference between revisions

From Control Systems Technology Group
Jump to navigation Jump to search
mNo edit summary
No edit summary
Line 1: Line 1:
= '''Group Members''' =
= '''Group Members''' =
{| border="1" cellpadding="5" cellspacing="0" align="left"  
{| border="1" cellpadding="5" cellspacing="0" align="none"  
|-  
|-  
| '''ID-Number'''
| '''ID-Number'''
Line 33: Line 33:


The project is dived in two parts: the corridor challenge and the maze challenge.
The project is dived in two parts: the corridor challenge and the maze challenge.
For the corridor challenge the goal is to take the first exit.  For this corridor
challenge a number of requirements have to be met for an arbitrary corridor:


== '''Requirements''' ==
== '''Corridor challange'''==
For the corridor challenge the goal is to take the first exit.
 
=== '''Requirements''' ===
 
For this corridor challenge a number of requirements have to be met for an arbitrary corridor:


:*Reach exit as fast as possible.
:*Reach exit as fast as possible.
Line 45: Line 48:
:*Be able to recognize maze exit.
:*Be able to recognize maze exit.
:*Stop when exit is reached.
:*Stop when exit is reached.
=== '''Specifications''' ===


These requirements can be rewritten to specifications:
These requirements can be rewritten to specifications:
== '''Specifications''' ==


:*Reach end within 1 minute.
:*Reach end within 1 minute.
Line 59: Line 62:
:**Drive in direction of point (updated 30 times a second).
:**Drive in direction of point (updated 30 times a second).
:**Maximal 0.5 m/s during straight line.
:**Maximal 0.5 m/s during straight line.
:**Maximal 1.2 rad/s rotation.
:*Recognize exit and stop
:**Drive straight for 3 seconds after being 30 cm from intersection, then stop.
=== '''Functions''' ===
In  order  to  meet  these  specifications  the  system  is  decomposed  into  multiple
functions:
:*Intersection recognition:  identifying where the intersection is.
:*Path planning:  calculating the optimal path through the corridor.
:*Safety features:  Ensuring that PICO does not hit the walls.
== '''Maze challange''' ==
For the maze challenge the goal is to �nd the exit in a maze.  The location of
the exit is unknown, there might be loops and there is a door in the maze.
=== ''Ŕequirements''' ===
The requirements of the corridor challenge also hold for the maze challenge but are
elaborated with:
:*Be able to map the maze.
:*Be able to locate itself in map.
:*Be able to recognize maze components (doors and walls).
:*Be able to open a door.
:*Be able to detect the maze exit.
=== '''Specification''' ===
These additional requirements can be written to specifications:
:*Mapping
:** Update map 30 times per second.
:** Remember path.
:**On the driven path map walls, doors, crossings.
:*Be able to localize itself in map.
:**Localize position with precision of 5 cm.
:*Recognition possible doors.
:**Recognize dead end of at least 30 cm.
:*Open door.
:**Beep when in front of detected door.
:*Recognize maze exit.
:**Stop when no walls are detected in front.
=== '''Functions''' ===
The functions from the corridor challenge can then be completed to obtain the
functions required for the maze challenge:
:* Mapping: Save all intersections, doors, and connections.
:* Optimal control:  determine the best strategy for completing the maze
=== '''Ínterfaces''' ===
o keep track of the states in which the robot is, the states will be printed in
the screen.  Also is the idead to show the mapping for the maze challenge on
the screen for debugging.

Revision as of 17:05, 2 May 2016

Group Members

ID-Number Name E-mail
0816253 Emile van Halsema e dot v dot halsema at student dot tue dot nl
0805999 Nard Strijbosch n dot w dot a dot strijbosch at student dot tue dot nl
0816608 Raymond Kerstens r dot j dot c dot m dot kerstens at student dot tue dot nl
0814199 Frank Heck f dot j dot m dot heck at student dot tue dot nl
0816361 Ids van den Meijdenberg j dot w dot a dot v dot d dot meijdenberg at student do tue dot nl


Initial Design Embedded Motion Control Group 7

The project is dived in two parts: the corridor challenge and the maze challenge.

Corridor challange

For the corridor challenge the goal is to take the first exit.

Requirements

For this corridor challenge a number of requirements have to be met for an arbitrary corridor:

  • Reach exit as fast as possible.
  • Be able to recognize walls.
  • Don't hit the walls.
  • Be able to recognize and take the first intersection.
  • Be able to rotate and translate.
  • Be able to recognize maze exit.
  • Stop when exit is reached.

Specifications

These requirements can be rewritten to specifications:

  • Reach end within 1 minute.
  • Recognition walls and intersection.
    • Objects in straight line (with variation under 5 cm) are considered walls.
    • Opening of at least 0.5 m is an intersection.
  • Don not hit walls.
    • Distance to walls at least 10 cm.
  • Be able to drive.
    • Drive in direction of point (updated 30 times a second).
    • Maximal 0.5 m/s during straight line.
    • Maximal 1.2 rad/s rotation.
  • Recognize exit and stop
    • Drive straight for 3 seconds after being 30 cm from intersection, then stop.

Functions

In order to meet these specifications the system is decomposed into multiple functions:

  • Intersection recognition: identifying where the intersection is.
  • Path planning: calculating the optimal path through the corridor.
  • Safety features: Ensuring that PICO does not hit the walls.

Maze challange

For the maze challenge the goal is to �nd the exit in a maze. The location of the exit is unknown, there might be loops and there is a door in the maze.

Ŕequirements'

The requirements of the corridor challenge also hold for the maze challenge but are elaborated with:

  • Be able to map the maze.
  • Be able to locate itself in map.
  • Be able to recognize maze components (doors and walls).
  • Be able to open a door.
  • Be able to detect the maze exit.

Specification

These additional requirements can be written to specifications:

  • Mapping
    • Update map 30 times per second.
    • Remember path.
    • On the driven path map walls, doors, crossings.
  • Be able to localize itself in map.
    • Localize position with precision of 5 cm.
  • Recognition possible doors.
    • Recognize dead end of at least 30 cm.
  • Open door.
    • Beep when in front of detected door.
  • Recognize maze exit.
    • Stop when no walls are detected in front.

Functions

The functions from the corridor challenge can then be completed to obtain the functions required for the maze challenge:

  • Mapping: Save all intersections, doors, and connections.
  • Optimal control: determine the best strategy for completing the maze

Ínterfaces

o keep track of the states in which the robot is, the states will be printed in the screen. Also is the idead to show the mapping for the maze challenge on the screen for debugging.