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...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2006-03.
|
| Subjects: | |
| Online Access: | Get fulltext |