Open Access. Powered by Scholars. Published by Universities.®

Theory and Algorithms Commons

Open Access. Powered by Scholars. Published by Universities.®

2014

Artificial Intelligence & Robotic Control

Articles 1 - 5 of 5

Full-Text Articles in Theory and Algorithms

Constraint Satisfaction Problem: A Generic Scheduler, Ben Carpenter, Brent Weichel, Jeremy Straub, Eunjin Kim Apr 2014

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 Apr 2014

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 …


Medical Rate Setting: Multi-Curve Approximation And Projection, Darrin Winger, Christian Sandtveit, Jeremy Straub, Eunjin Kim Apr 2014

Medical Rate Setting: Multi-Curve Approximation And Projection, Darrin Winger, Christian Sandtveit, Jeremy Straub, Eunjin Kim

Jeremy Straub

In order to maximize profit, our approach was to maximize the difference between total revenue and total cost, where total revenue would be larger than total cost. In the problem we are given a series of points, which relates price, cost, profit and quantity. We can calculate the total revenue by multi-plying the price with quantity, and the total cost by multiplying the cost with the quantity. Total profit is calculated by multiplying profit and quantity. We are given 4 initial points, and based on those 4 points we will calculate the point where the profit is currently maximized. Based …


Task Scheduling Problem: Using The Most Constrained Variable Algorithm To Maximize, Jaeden Lovin, Calvin Bina, Jeremy Straub, Eunjin Kim Apr 2014

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 Apr 2014

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 …