Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Artificial Intelligence & Robotic Control (5)
- CubeSat (2)
- Open Orbiter Project (2)
- OpenOrbiter (2)
- Small Spacecraft (2)
-
- Autonomous operating software (1)
- Constraint Satisfaction Problem (1)
- Dynamic Task Scheduling (1)
- Greedy Knapsack (1)
- Health Care (1)
- Hill-Climbing Search (1)
- Medical Rate Setting (1)
- Most Constrained Variable Algorithm (1)
- Operating Software (1)
- Profit Maximization (1)
- Scheduler (1)
- Small spacecraft (1)
- Task Scheduling (1)
Articles 1 - 6 of 6
Full-Text Articles in OS and Networks
An Overview Of The Openorbiter Autonomous Operating Software, Dayln Limesand, Timothy Whitney, Jeremy Straub, Ronald Marsh
An Overview Of The Openorbiter Autonomous Operating Software, Dayln Limesand, Timothy Whitney, Jeremy Straub, Ronald Marsh
Jeremy Straub
The OpenOrbiter spacecraft aims to demonstrate the efficacy of the Open Prototype for Educational Nanosats (OPEN) framework. Software is an important part of this framework. This paper discusses the operating software for the spacecraft (which runs on top of the Linux operating system to command spacecraft operations). It presents an overview of this software and then pays particular attention to the aspects of software design that enable onboard autonomy. It also discusses the messaging scheme that is used onboard and the testing and validation plan. Finally, it discusses system extensibility, before concluding.
Constraint Satisfaction Problem: A Generic Scheduler, Ben Carpenter, Brent Weichel, Jeremy Straub, Eunjin Kim
Constraint Satisfaction Problem: A Generic Scheduler, Ben Carpenter, Brent Weichel, Jeremy Straub, Eunjin Kim
Jeremy Straub
The task was to create a scheduler that would create a schedule that gets as many of the tasks done as possible while maximizing the total value of the tasks performed. Each task was assigned a value, a priority, and a duration. Each task also had certain times that they could be run, so they couldn’t just be run at any point where they fit. We decided that in order to get a more accurate ordering for the process, we would take the value divided by the duration that way we were less likely to skip over processes that ran …
Dynamic Task Scheduling Problem: Greedy Knapsack Solution, Christian Sandtveit, Darrin Winger, Jeremy Straub, Eunjin Kim
Dynamic Task Scheduling Problem: Greedy Knapsack Solution, Christian Sandtveit, Darrin Winger, Jeremy Straub, Eunjin Kim
Jeremy Straub
The problem that we worked with was a dynamic scheduling problem. For this problem, we are given a set of tasks to be scheduled in an allotted time slot, so that the total value of the tasks done is maximized. Each task has a duration, value. Each task also has one or more periods in which they can be scheduled. Some tasks can have conflicting time slots that can prevent other tasks from being scheduled. As tasks are assigned time slots it is possible to prevent other tasks from being as-signed a time slot. Looking for ways to minimize the …
Task Scheduling Problem: Using The Most Constrained Variable Algorithm To Maximize, Jaeden Lovin, Calvin Bina, Jeremy Straub, Eunjin Kim
Task Scheduling Problem: Using The Most Constrained Variable Algorithm To Maximize, Jaeden Lovin, Calvin Bina, Jeremy Straub, Eunjin Kim
Jeremy Straub
For this constraint satisfaction problem we needed to schedule a series of tasks to run in a certain order. Each task has a set duration that it must run for and a domain of times during which it can run during. Each task had a value and the goal of the problem was to pick times for the tasks to run in or-der to maximize the total value. We thought of multiple ways to potentially approach this problem, and decided to use some form of the least constraining variable. We would choose the task with the least constraints on other …
Medical Rate Setting Problem: Using The Hill-Climbing Search To Maximize Health Care Provider Profit, Calvin Bina, Jaeden Lovin, Jeremy Straub, Eunjin Kim
Medical Rate Setting Problem: Using The Hill-Climbing Search To Maximize Health Care Provider Profit, Calvin Bina, Jaeden Lovin, Jeremy Straub, Eunjin Kim
Jeremy Straub
Our program for calculating the optimal price for a service is relatively simple, but it gets great results. We make use of quadratic regres-sion. Quadratic regression has a very similar concept to linear regression. Given a set of data points, we find the equation that is the best fit to represent those data points. With linear re-gression, our resulting equation is linear. How-ever, with quadratic regression, our end result is a quadratic equation. We have two quadratic equations to come up with. One is our cost function and the other is our units sold func-tion. Both of these equations are …
Update On The Operating Software For Openorbiter, Dayln Limesand, Christoffer Korvald, Jeremy Straub, Ronald Marsh
Update On The Operating Software For Openorbiter, Dayln Limesand, Christoffer Korvald, Jeremy Straub, Ronald Marsh
Jeremy Straub
The operating software team of the OpenOrbiter project has been tasked with developing software for general spacecraft maintenance, performing mission tasks and the monitoring of system critical aspects of the spacecraft. To do so, the team is developing an autonomous system that will be able to continuously check sensors for data, and schedule tasks that pertain to the current mission and general maintenance of the onboard systems. Development in support of these objectives is ongoing with work focusing on the completion of the development of a stable system. This poster presents an overview of current work on the project and …