Research Summaries

Back Collection Planning and Scheduling Algorithm

Fiscal Year 2017
Division Graduate School of Engineering & Applied Science
Department Mechanical & Aerospace Engineering
Investigator(s) Proulx, Ronald J.
Ross, Isaac M.
Sponsor Department of Defense Space (DoD)
Summary We propose to a fundamentally new concept for collection planning and scheduling. In this approach, we use the indicator function to pose the problem as a non-smooth dynamic optimization problem. This is in sharp contrast to the current approach of posing it as an orienteering or a traveling salesman problem. Because our proposed approach removes heuristics and the need for an operator in the loop, rapid and autonomous tasking can be performed without incurring unnecessary penalties on other high-priority tasks.
Keywords collection planning and scheduling non-smooth optimization thesis project
Publications Publications, theses (not shown) and data repositories will be added to the portal record when information is available in FAIRS and brought back to the portal
Data Publications, theses (not shown) and data repositories will be added to the portal record when information is available in FAIRS and brought back to the portal