Area: |
Department of Electrical and Computer Engineering |
Credits: |
25.0 |
Contact Hours: |
4.0 |
** The tuition pattern below provides details of the types of classes and their duration. This is to be used as a guide only. For more precise information please check your unit outline. ** | |
Lecture: |
1 x 2 Hours Weekly |
Tutorial: |
1 x 0.5 Hours Weekly |
Laboratory: |
1 x 1.5 Hours Weekly |
Prerequisite(s): |
12855 (v.4) Embedded Systems Engineering 301 or any previous version |
Syllabus: |
Fundamental issues in intelligent systems - history of artificial intelligence, fundamental definitions, modelling the world, the role of heuristics. Search and constraint satisfaction - problem spaces, search techniques, constraint satisfaction. Knowledge representation and reasoning - review of proposition and predicate logic, resolution and theorem proving, probabilistic reasoning and Bayes theorem. Advanced search - genetic algorithms, simulated annealing, local search. Machine learning and neural networks - definition and examples of machine learning, supervised learning, learning decision trees, learning neural networks, learning theory, the problem of overfitting and unsupervised learning. Robotics - overview, state of the art, planning versus reactivecontrol, uncertainty in control, sensing, world models, configuration space, planning, sensing, robot programming, navigation and control. Data mining - the usefulness of data mining, associative and sequential patterns, data clustering, market basket analysis, data cleaning, data visualisation. |
** To ensure that the most up-to-date information about unit references, texts and outcomes appears, they will be provided in your unit outline prior to commencement. ** | |
Field of Education: | 031305 Computer Engineering |
Funding Cluster: | 08 - Engineering, Science, Surveying |
SOLT (Online) Definitions*: | Informational *Extent to which this unit or thesis utilises online information |
Result Type: | Grade/Mark |
Availability |
|
Availability Information has not been provided by the respective School or Area. Prospective students should contact the School or Area listed above for further information. |