| Course Code | COMP3431 |
| Course Title | Robot Software Architectures |
| Units of Credit | 6 |
| Course Website | http://cse.unsw.edu.au/~cs3431 |
| Handbook Entry | http://www.handbook.unsw.edu.au/undergraduate/courses/current/COMP3431.html |
This course gives both a theoretical and a practical introduction to the control of robotic systems. The course is in two parts:
An overview of robot software architectures :
This part of the course gives students an introduction to the structure of robot software, including the theory of decision making: How can an agent build up knowledge of its world? Having done that, how can an agent choose its actions? A variety of different decision making and planning architectures are covered; including classical planning, reinforcement learning and cognitive architectures. In labs, students will get hands on experience with some of these planning systems.
Practical Robotics
This part of the course gives students a practical introduction to some specific robot architectures; the main system architecture will be the Robot Operating System, ROS . We will be using TurtleBot Robots, or other robots as available.
At the end of this course, students should have:
The official course timetable is available here . In practice, we will use the 12pm-2pm Monday slot for lectures and the labs will be conducted in two shifts, one on Monday afternoon 2pm-3pm and the other on Wednesday morning 10am - 12pm. Lectures will be held in Civil G26 and the labs will be in the Robotics Laboratory, Ainsworth level 5.
This course gives both a theoretical and a practical introduction to the control of robotic systems. The course is in two parts:
An overview of robot software architectures :
This part of the course gives students an introduction to the structure of robot software, including the theory of decision making: How can an agent build up knowledge of its world? Having done that, how can an agent choose its actions? A variety of different decision making and planning architectures are covered; including classical planning, reinforcement learning and cognitive architectures. In labs, students will get hands on experience with some of these planning systems.
Practical Robotics
This part of the course gives students a practical introduction to some specific robot architectures; the main system architecture will be the Robot Operating System, ROS . We will be using TurtleBot Robots, or other robots as available.
At the end of this course, students should have:
This course contributes to the development of the following graduate capabilities:
| Graduate Capability | Acquired in |
| scholarship: understanding of their discipline in its interdisciplinary context | 1 - 12 |
| scholarship: capable of independent and collaborative enquiry |
1 - 12
|
| scholarship: rigorous in their analysis, critique, and reflection |
1 - 12
|
| scholarship: able to apply their knowledge and skills to solving problems |
1 - 12
|
| scholarship: ethical practitioners |
1 - 12
|
| scholarship: capable of effective communication |
1 - 12
|
| scholarship: information literate |
1 - 12
|
| scholarship: digitally literate |
1 - 12
|
| leadership: enterprising, innovative and creative |
1 - 12
|
| leadership: capable of initiating as well as embracing change |
1 - 12
|
| leadership: collaborative team workers |
1 - 12
|
| professionalism: capable of independent, self-directed practice |
1 - 12
|
| professionalism: capable of lifelong learning |
1 - 12
|
| professionalism: capable of operating within an agreed Code of Practice |
1 - 12
|
| global citizens: capable of applying their discipline in local, national and international contexts |
1 - 12
|
| global citizens: culturally aware and capable of respecting diversity and acting in socially just/responsible ways |
1 - 12
|
| global citizens: capable of environmental responsibility |
1 - 12
|
This course is for postgraduate students (COMP9431) and advanced undergraduates (COMP3431). It is a 3rd year course because it has few pre-requisites.
Students in this course are expected to be able to program in C++, Java or Python.
While not a formal pre-requisite or co-requisite, it is recommended that students take a machine learning course if they are interested in artificial intelligence, eg COMP9417 . That course does not need to be taken before this one. The artificial intelligence course, COMP3411 , is also recommended but it does not give the depth of Machine Learning knowledge that is useful for this course. While it isn't a formal pre-requisite, students who have already taken COMP3411 or an equivalent course often find this course easier.
Because there are only a small number of robots, this class is limited in size. A minimum WAM is required for the course. For people who have a WAM below the required WAM, there is a waiting list. That waiting list is used to fill up any positions remaining just before the start of the semester.
The class has traditionally been fairly small (20-30 students). There is no textbook that covers all the topics at the right level of detail for this course, so there is no set text, but there are recommended references below.
The assignments are all group-work. Furthermore, the assignments are graded is a style more like a design class than a computer science class: you demonstrate your robot doing what it does, and then the class discusses why it behaved that way and whether that is, on balance, a good thing. You will also write a final report to accompany your main project.
There are two large assignments worth 20% and 35%, and a final report worth 35%. You will also be given reading assignments in some weeks. to give you an incentive to actually read the papers, you will be asked to submit a one paragraph summary. Overall, these will be worth 10% of your marks.
Due dates are on the calendar section of the web page.
Lectures and Assignments are similar between COMP3431 and COMP9431 students.
Units of credit: This is a 6 UOC course
Plagiarism is defined as using the words or ideas of others and presenting them as your own . UNSW and CSE treat plagiarism as academic misconduct, which means that it carries penalties as severe as being excluded from further study at UNSW. There are several on-line sources to help you understand what plagiarism is and how it is dealt with at UNSW:
Make sure that you read and understand these. Ignorance is not accepted as an excuse for plagiarism.
There is no set text for this course. However, the following books are recommended:
Artificial Intelligence: A Modern Approach
; S. Russell and P. Norvig
This is a good overview textbook for artificial intelligence in general. If you were going to get one book on AI, this would be the one I'd choose.
Probabilistic Robotics ; S. Thrun, W. Burgard and D. Fox
This is a newer textbook covering "perception and control in the face of uncertainty". It covers those areas well, but doesn't have quite the breadth of this course.
Automated Planning: Theory and Practice
; M. Ghallab, D. Nau and P. Traverso
This book focuses on the planning and decision making areas of artificial intelligence. It goes goes into more detail in that one area. It provides a readable introduction to this area of artificial intelligence.
Reinforcement Learning: An Introduction
; R. Sutton and A. Barto
This is a good book on reinforcement learning and Markov Decision Processes, in the same way that "Automated Planning" is a good book on planning systems: it covers its section of AI well.
Machine Learning
; T. Mitchell
While machine learning is only touched on in this course, I consider it a very important part of AI and robotics, so I'm putting this book here anyway.
Markov Decision Processes: Discrete Stochastic Dynamic Programming; M. Puterman
This book focuses in great detail on the theory of Markov Decision Processes. It is almost 10 years old now, and so lacks some of the newer contributions to the field, but it is an excellent reference on the mathematical theory of stochastic decision making.
This course is evaluated each session using the CATEI system.
In the previous offering of this courses, students noted ...
Based on their comments, we have ...
Resource created Wednesday 19 July 2017, 03:55:25 PM, last modified Tuesday 25 July 2017, 01:28:04 PM.