

![0_image_0.png](0_image_0.png) 

solving a specific (**d, k**)-combination (δ av) is the average of the plans distances between all pairs of plans in the set. The tests were performed on an AMD Athlon(tm) XP 2600+, 512 Mb RAM. The CPU-time limit was 300 seconds.

Figure 6 gives the results for the largest problem in IPC-3 DriverLog-Time (fully-automated track). LPG-d solves 109 (**d, k**)-combinations, including combinations d ≤ 0.4 and k **= 10**, and d = 0.95 and k = 2. The average CPU time (top plots) is 162.8 seconds. The average δ av
(bottom plots) is 0.68, with δ av always greater than 0.4. With the original δa function LPG-d solves 110 (**d, k**)-combinations, the average CPU time is 160 seconds, and the average δ av is 0.68; while with γ = 2 LPG-d solves 100 combinations, the average CPU time is 169.5 seconds, and the average δ av is 0.69.

Figure 7 shows the results for the largest problem in IPC-3 Satellite-Strips. LPG-d solves 211 (**k, d**)-combinations; 173 of them require less than 10 seconds. The average CPU time is 12.1 seconds, and the average δ av is 0.69. We observed similar results when using the original 21