Real-time scheduling and synchronization for the NPS Autonomous Underwater Vehicle
Shukla, Shridhar B.
MetadataShow full item record
The work described in this thesis is part of a multi-year research project to develop an Autonomous Underwater Vehicle (AUV-II), which is an intelligent robot submarine, carried out by the Departments of Mechanical Engineering, Computer Science, and Electrical and Computer Engineering of the Naval Postgraduate School. The AUV-II on-board computer must perform several different tasks such as navigation, autopilot, guidance, sonar processing and collision avoidance, etc., under strict timing constraints to guarantee the safety of the vehicle. This thesis describes the design and development of real-time scheduling software, which is capable of scheduling and synchronizing the periodic and aperiodic processes required by the AUV-II. A design recommendation of a graphical user interface has been developed to improve the software engineering aspects of this project.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Banham, Stephen R. (Monterey, California. Naval Postgraduate School, 1990-03);This thesis investigates the use of current graphical interface techniques to build more effective computer-user interfaces to Operations Research (OR) schedule optimization models. The design is directed at the scheduling ...
Analysis of Current Flight Scheduling Practices and Recommendations to Efficiently Reduce Deviations from Syllabus Time-To-Train Hall, Bentley (Tyler); Hargrove, Hayward (Trey); Willis, James (Marshall) (Monterey, California. Naval Postgraduate School, 2011-09-07);EXECUTIVE SUMMARY: The objective of our project is to investigate current scheduling requirements, constraints, and procedures to identify problems with scheduling practices and syllabus management for Primary Flight ...
Negelspach, Greg L. (Monterey, California. Naval Postgraduate School, 1994-09);Optimal scheduling of parallel programs onto multiprocessor computers is an exponentially hard problem. Because of this, most scheduling algorithms in use today rely on heuristics to determine the best balance of computation ...