An any-angle routing method using quasi-Newton method

In recent Printed Circuit Boards (PCB) routing and package routing, any-angle gridless routing is required since the density has increased and the specification becomes severe. In this paper, we propose a routing method which solves an any-angle gridless routing problem by formulating the problem by non-linear programming which is solved by quasi-Newton method. Our proposed method minimizes the total wire length or the total length error while satisfying constraints such as the separation for a route and an obstacle, the separation for two routes, and the angle of bend in a route. Experiments show that the proposed method is effective to obtain any-angle gridless routes in short computational time.