Home /Research /Pre-emptive versus non-pre-emptive real time scheduling in intelligent mobile robotics
OTHER

Pre-emptive versus non-pre-emptive real time scheduling in intelligent mobile robotics

Maurizio Piaggio, Antonio Sgorbissa, Renato Zaccaria

Year
2000
Citations
30

Abstract

Autonomous and semi-autonomous mobile robots have to perform a multiplicity of concurrent activities in order to carry out useful tasks in unstructured human-populated environments. Even if it is commonly accepted that a successful accomplishment of assigned tasks requires some sort of real time capability to quickly react and adapt to environmental changes, it is not clear which operating system support is best suited for the scheduling and synchronizing of concurrent activities with different timing requirements. This paper discusses this problem, comparing two different real time scheduling policies for autonomous robot applications: pre-emptive rate monotonic and non pre-emptive Earliest Deadline First (EDF). Experimental results are presented and evaluated.

Keywords

Computer scienceRoboticsArtificial intelligenceScheduling (production processes)Mobile robotReal-time computingHuman–computer interactionRobotMathematical optimization

Related papers

Browse all OTHER papers