Path Planning
Path planning is an important issue as it allows a robot to get from point A to point B. Path planning algorithms are measured by their computational complexity. The feasibility of real-time motion planning is dependent on the accuracy of the map (or floorplan), on robot localization and on the number of obstacles. Topologically, the problem of path planning is related to the shortest path problem problem of finding a route between two nodes in a graph.
Read more about this topic: Robotic Mapping
Famous quotes containing the words path and/or planning:
“The broken ridge of the hills
was the line of a lover’s shoulder,
his arm-turn, the path to the hills,
the sudden leap and swift thunder
of mountain boulders, his laugh.”
—Hilda Doolittle (1886–1961)
“Judge Bedford: Planning on having children?
David: Naturally.
Judge Bedford: Good, then I know what to get you for a wedding present.
David: Yeah? What’s that?
Judge Bedford: A vasectomy.”
—Dale Launer (b. 1953)