Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Robert George

dblp:126/5039 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Artificial intelligence
1 paper
Motion planning and robot control · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › fixed-priority scheduling
rate-monotonic scheduling
0.011996
A rate-monotonic scheduler for the real-time control of autonomous robots · ICRA 1996
Embedded and real-time systems
real-time scheduling
0.011996
A rate-monotonic scheduler for the real-time control of autonomous robots · ICRA 1996
Robotics › Motion planning and robot control › robot control
autonomous robot control
0.011996
A rate-monotonic scheduler for the real-time control of autonomous robots · ICRA 1996

Methods — techniques the papers use, named apart from their topics

preemptive static priority scheduling · 0.0lightweight threads · 0.0
YearPublicationVenuePosition
1996 A rate-monotonic scheduler for the real-time control of autonomous robots
abstract
Most existing real-time control systems use ad hoc static priority scheduling methods, in spite of the fact that the rate monotonic scheduling algorithm was proved to be the optimal static priority scheduling algorithm over 20 years ago. In this paper, we discuss a task library we are using for the real-time control of autonomous robots. The task library comprises a preemptive rate-monotonic scheduler which provides guaranteed optimal scheduling when certain conditions of processor utilization are met. The task library has been implemented as a collection of lightweight threads, which operate entirely in user-space for maximum efficiency. We show the performance advantages resulting from the reduced overhead of this approach, compared with commercial operating systems. The task system is robust, extensible, and portable, and has been successfully used to control the autonomous mobile robot Yamabico-11 developed at the Naval Postgraduate School.
Robert George, Yutaka Kanayama
ICRA1