04 - Fast Tour
Pages
HW04
- Is posted
- Goal: Write a script to plan and execute a fast planetary tour.
Planning
Finding a fast planetary tour is a planning or routing problem, but it's
a bit different from the traditional examples.
References:
- https://en.wikipedia.org/wiki/Motion_planning
- https://en.wikipedia.org/wiki/Distance-vector_routing_protocol
- https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
- https://en.wikipedia.org/wiki/A*_search_algorithm
Common plan is to reduce the problem to a discrete graph, then search the graph
for an appropriate solution.
Examples:
- Solving a maze
- Backing up a car
- 2D version of the moon tour issue