Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning

In many real-time systems, relative timing constraints are imposed on a set of tasks. Generating a correct ordering for the tasks and deriving their proper start-time assignments is a Nondeterministic Polynomial Problem (NP) hard problem; it subsumes the Non-preemptive Scheduling Problem. Real-time...

Full description

Saved in:
Bibliographic Details
Main Author: Mohammed Hasan, Ammar Abdo
Format: Thesis
Language:en
Published: 2006
Subjects:
Online Access:http://eprints.utm.my/4060/9/AmmarAbdoMohammedHasanMCD2006.pdf
http://eprints.utm.my/4060/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1845471027962839040
author Mohammed Hasan, Ammar Abdo
author_facet Mohammed Hasan, Ammar Abdo
author_sort Mohammed Hasan, Ammar Abdo
building UTM Library
collection Institutional Repository
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
continent Asia
country Malaysia
description In many real-time systems, relative timing constraints are imposed on a set of tasks. Generating a correct ordering for the tasks and deriving their proper start-time assignments is a Nondeterministic Polynomial Problem (NP) hard problem; it subsumes the Non-preemptive Scheduling Problem. Real-time systems are characterized by the presence of timing constraints on the computations carried out by the system. Examples are found in domains such as avionics, process control and robotics, where a computer is used to control and manipulate a physical system. Real-time systems are characterized by computational activities with timing constraints and classified into two categories, hard real-time system and soft realtime system. In hard real-time system, deadline missing can be catastrophic. However, in the case of soft real-time systems, slight violation of deadlines is not so critical. Autonomous mobile robot system is one of typical task scheduling of soft real-time system. In this study we addressed the problem of real-time scheduling in autonomous robot and in particular we compared two different scheduling approaches, hybrid GA and Pre-emptive Rate Monotonic. The results have shown that in this case a hybrid GA approach is preferable because it is more efficient and moreover the disadvantages of such a choice have shown not to be relevant to the overall functioning of a typical autonomous robot application. In fact, the greater efficiency could be exploited to minimize the overall deadline missing among the tasks and therefore robot can work smoothly.
format Thesis
id my.utm.eprints-4060
institution Universiti Teknologi Malaysia
language en
publishDate 2006
record_format eprints
spelling my.utm.eprints-40602017-10-12T04:45:20Z http://eprints.utm.my/4060/ Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning Mohammed Hasan, Ammar Abdo QA75 Electronic computers. Computer science In many real-time systems, relative timing constraints are imposed on a set of tasks. Generating a correct ordering for the tasks and deriving their proper start-time assignments is a Nondeterministic Polynomial Problem (NP) hard problem; it subsumes the Non-preemptive Scheduling Problem. Real-time systems are characterized by the presence of timing constraints on the computations carried out by the system. Examples are found in domains such as avionics, process control and robotics, where a computer is used to control and manipulate a physical system. Real-time systems are characterized by computational activities with timing constraints and classified into two categories, hard real-time system and soft realtime system. In hard real-time system, deadline missing can be catastrophic. However, in the case of soft real-time systems, slight violation of deadlines is not so critical. Autonomous mobile robot system is one of typical task scheduling of soft real-time system. In this study we addressed the problem of real-time scheduling in autonomous robot and in particular we compared two different scheduling approaches, hybrid GA and Pre-emptive Rate Monotonic. The results have shown that in this case a hybrid GA approach is preferable because it is more efficient and moreover the disadvantages of such a choice have shown not to be relevant to the overall functioning of a typical autonomous robot application. In fact, the greater efficiency could be exploited to minimize the overall deadline missing among the tasks and therefore robot can work smoothly. 2006-03 Thesis NonPeerReviewed application/pdf en http://eprints.utm.my/4060/9/AmmarAbdoMohammedHasanMCD2006.pdf Mohammed Hasan, Ammar Abdo (2006) Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning. Masters thesis, Universiti Teknologi Malaysia, Faculty of Computer Science and Information System.
spellingShingle QA75 Electronic computers. Computer science
Mohammed Hasan, Ammar Abdo
Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
title Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
title_full Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
title_fullStr Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
title_full_unstemmed Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
title_short Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
title_sort real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
topic QA75 Electronic computers. Computer science
url http://eprints.utm.my/4060/9/AmmarAbdoMohammedHasanMCD2006.pdf
http://eprints.utm.my/4060/
url_provider http://eprints.utm.my/