Declarative Synthesis and Multi-Objective Optimization of Stripboard Circuit Layouts Using Answer Set Programming
Fang Li
TL;DR
This work addresses the automation of stripboard (Veroboard) circuit layout by formulating the problem in Answer Set Programming (ASP) and solving it via a two-phase procedure: first to ensure feasible connectivity, then to optimize layout quality. The method includes a KiCad netlist parser, an ASP encoding on a 2D grid, feasibility synthesis, and multi-objective optimization that minimizes total strip crossings and board area, followed by normalization and visualization. Experimental results across several benchmark circuits show compact, manufacturable layouts with reasonable solve times, and a physical Guitar Pedal build validates practical applicability. The approach demonstrates the potential of declarative programming to solve complex design automation tasks in electronics prototyping and education.
Abstract
This paper presents a novel approach to automated stripboard circuit layout design using Answer Set Programming (ASP). The work formulates the layout problem as both a synthesis and multi-objective optimization task that simultaneously generates viable layouts while minimizing board area and component strip crossing. By leveraging ASP's declarative nature, this work expresses complex geometric and electrical constraints in a natural and concise manner. The two-phase solving methodology first ensures feasibility before optimizing layout quality. Experimental results demonstrate that this approach generates compact, manufacturable layouts for a range of circuit complexities. This work represents a significant advancement in automated stripboard layout, offering a practical tool for electronics prototyping and education while showcasing the power of declarative programming for solving complex design automation problems.
