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

DOI10.1080/095281300409856zbMath1033.68661OpenAlexW2069774726MaRDI QIDQ4779495

Maurizio Piaggio, R. Zaccaria, Antonio Sgorbissa

Publication date: 28 March 2004

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/095281300409856

zbMATH Keywords

semi-autonomous mobile robots

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Artificial intelligence for robotics (68T40)

Related Items (3)

Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems ⋮ Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks ⋮ Modelling computational requirements of mobile robotic systems using zones and processing windows

Cites Work

• The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Pre-emptive versus non-pre-emptive real time scheduling in intelligent mobile robotics