A GPU-Based Parallel Region Classification Method for Continuous Constraint Satisfaction Problems

Abstract

Continuous constraint satisfaction is prevalent in many science and engineering fields. When solving continuous constraint satisfaction problems, it is more advantageous for practitioners to derive all feasible regions (i.e., the solution space) rather than a limited number of solution points, since these feasible regions facilitate design concept generation and design tradeoff evaluation. Several CPU-based branch-and-prune methods and geometric approximation methods have been proposed to derive feasible regions for continuous constraint satisfaction problems. However, these methods have not been extensively adopted in practice, mainly because of their high computational expense. To overcome the computational bottleneck of extant CPU-based methods, this paper introduces a GPU-based parallel region classification method to derive feasible regions for continuous constraint satisfaction problems in a reasonable computational time. Using interval arithmetic, coupled with the computational power of GPU, this method iteratively partitions the design space into many subregions and classifies these subregions as feasible, infeasible, and indeterminate regions. To visualize these classified regions in the design space, a planar visualization approach that projects all classified regions into one figure is also proposed. The GPU-based parallel region classification method and the planar visualization approach are validated through two case studies about the bird function and the welded beam design. These case studies show that the method and the approach can solve the continuous constraint satisfaction problems and visualize the results effectively and efficiently. A four-step procedure for implementing the method and the approach in practice is also outlined.