Embedded Motion Control 2015 Group 11: Difference between revisions

From Control Systems Technology Group
Jump to navigation Jump to search
Line 54: Line 54:
*Remember the path and and the door, grid the path and store it with 0 or 1, representing the pass available or not respectively.
*Remember the path and and the door, grid the path and store it with 0 or 1, representing the pass available or not respectively.
*Each step, select a direction where is available. If the current grid has not been recorded, record it and move on. If the current gird has been recorded as well as its surrounding grids, randomly choose a grid from recorded and move on. If all the maze has been searched, the robot must go out the maze.
*Each step, select a direction where is available. If the current grid has not been recorded, record it and move on. If the current gird has been recorded as well as its surrounding grids, randomly choose a grid from recorded and move on. If all the maze has been searched, the robot must go out the maze.
==Activity model==
[[File:port-based interaction.jpg]]


==Behavioural model==
==Behavioural model==

Revision as of 01:20, 13 May 2015

Group Members

Name Student nr Email
Changjie Guan 0927222 c.guan@student.tue.nl
Yang Xu 0918430 y.xu.1@student.tue.nl
Bolin Zhao 0925735 b.zhao@student.tue.nl
Zhe Zhao 0815651 z.zhao@student.tue.nl
Fei Chen 0923761 f.chen@student.tue.nl
Yizhou Ye 0925611 y.ye@student.tue.nl
Yiran Liu 0843177 y.liu.1@student.tue.nl

Introduction

Task and goal: Find way out of maze as fast as possible.

Requirement

The requirement analysis base on the problem statement and divide in different level of important as ‘must’,’should’,’could’ and ‘wont'

  • the robot must can get out of the maze
  • the robot must take action by itself
  • the robot should get out of the maze as soon as possible
  • the robot won’t hint the wall

Functions

Ensure all the requirements can be meeted.

  • Move forward and backward, turn around
  • Detect the doors
  • Detec the distance between the front wall and the robot
  • Remember the path and and the door, grid the path and store it with 0 or 1, representing the pass available or not respectively.
  • Each step, select a direction where is available. If the current grid has not been recorded, record it and move on. If the current gird has been recorded as well as its surrounding grids, randomly choose a grid from recorded and move on. If all the maze has been searched, the robot must go out the maze.

Activity model

Port-based interaction.jpg

Behavioural model

Task-Skill-Motion.jpg

Behavioural model:

  • Environment context
  • Task context
  • Skill context
  • Robot context

Structure model

Wikipedia encyclopedia

Schedule

May. 13: Corridor competition.
June. 17: Maze competition.

Corridor Competition

Algorithms

Moving forward or backward

Turning

Maze Competition