Constraint Programming applied to the Aerospace Industry

The goal of this project is to apply constraint programming to planning and scheduling problems that arise in the aerospace industry. Constraint programming is a successful methodology for solving complex combinatorial problems. The aerospace industry offers many opportunities to apply state-of-the-art constraint programming techniques in order to optimize complex scheduling and resource allocation problems, avionics scheduling, and space mission planning.

The novelty in this proposal is three fold. First, we intend to model problems successfully as constraint programs. Recently, emphasis in the constraint programming community has been placed on when and how constraint programming can be used to solve real-world problems. Next, we will develop novel search algorithms to solve the modeled problem. Finally, we will develop new constraint propagation techniques. Through these innovations, we hope to find solutions that will be useful to the industrial partner.

Faculty Supervisor:

Dr. Peter van Beek

Student:

Matthew Kitching

Partner:

Discipline:

Computer science

Sector:

Aerospace and defense

University:

University of Waterloo

Program: