Marco Garcia, Daniel Lopez, & Dr. Ivona Grzegorczyk
Abstract
In many contemporary applications there is a need to match two finite or infinite sets using 1:1 correspondence. For example, Internet users may need to be matched with the advertisements that are of interest to them, or scientist in different field may need to be matched into pairs for some research projects in such a way that they like to work together. Hence the main issue is to find this 1:1 correspondence to satisfy as many desires as possible. Abstractly speaking, our main goal in this research project is to find a stable matching between two equally sized sets of elements given an ordering of preferences for each element that is optimizing some given function (where variable could be time, distance, satisfaction of the match, etc.) By adapting the Gale-Shapley algorithm we apply it to effectively create clones/drones to find and deliver packages to desired locations. This application shows the methodology for creating an optimized flight schedule (for various variables).
Details
Session 1
9:30am – 11:00am
Grand Salon
Leave a Reply