"Satisfying constraints: Discrete and continuous"

"Satisfying constraints: Discrete and continuous"

Suppose you wish to aim a laser towards the moon, without hitting satellites in orbit around the Earth -- is that possible? What is the range of possible solutions? This is an example of a *constraint satisfaction* problem (CSP) with continuous variables. A well-known CSP with *discrete* variables is coloring a map such that no two neighbouring countries have the same colour. I will discuss discrete and continuous CSPs and some algorithms for solving them: mapping to a Boolean satisfiability problem in the discrete case, and using methods from interval arithmetic in the continuous case. These will be illustrated using open-source software packages that I have written for solving such problems using the Julia programming language. 

Transmisión vía Youtube: bit.ly/YouTube_ICF

Participante: Dr. David P. Sanders

Institución: Facultad de Ciencias, UNAM

Fecha y hora: Este evento terminó el Miércoles, 07 de Septiembre de 2022