l*********y
发帖数: 142 | 1 Given a 2D-grid map with several obstacles such as walls, doors and ones
with other shapes, use A* algorithm to give the robot a path from point A to
point B with fewest turns.
没想明白怎么做，哪位指点一下? | g*********s
发帖数: 1782 | 2 how to model "fewest turn"? assigning penalty is not good, i think.
A to
【在 l*********y 的大作中提到】
: Given a 2D-grid map with several obstacles such as walls, doors and ones
: with other shapes, use A* algorithm to give the robot a path from point A to
: point B with fewest turns.
: 没想明白怎么做，哪位指点一下?
| l*****a
发帖数: 14598 | 3 convert the 2D-grid map to a graph ,no edge is there is obstacles.
then use A* algorithm.
A to
【在 l*********y 的大作中提到】
: Given a 2D-grid map with several obstacles such as walls, doors and ones
: with other shapes, use A* algorithm to give the robot a path from point A to
: point B with fewest turns.
: 没想明白怎么做，哪位指点一下?
| h**6
发帖数: 4160 | |
|
