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...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2006
|
| 主题: | |
| 在线阅读: | http://eprints.utm.my/id/eprint/4060/9/AmmarAbdoMohammedHasanMCD2006.pdf http://eprints.utm.my/id/eprint/4060/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|