| 摘要 |
The method involves cutting a map into blocks of variable size according to a criterion depending on cost values of basic units of the block (42), and associating a cost value of each block through the cutting. A route between a starting point and an ending point is obtained (48) from two linear segments, and a global crossing cost equal to a sum of local crossing costs is optimized, where each linear segment having a local crossing cost connects a point of one block and another point of another block selected according to a criterion of distance from the former point of the former block. |
