A maze-running algorithm using fuzzy set theory for routing methods of printed circuit boards

This paper presents a routing technique for printed circuit boards using fuzzy sets theory. In PCB designs, a clearance that means the allowable minimum spacing between conductors is defined. When an automated router performs wiring based on simple numeric clearances, traces are often placed along the boundaries of a clearance. This makes routing subsequent nets virtually infeasible, leading to the problem that a rip-up and re-route process has to be repeated. In the proposed routing system, clearances are represented by fuzzy sets. A maze-running algorithm applying the concept of fuzzy clearances is introduced