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 lesson which these observations convey is, be, and not seem. Let us acquiesce. Let us take our bloated nothingness out of the path of the divine circuits. Let us unlearn our wisdom of the world. Let us lie low in the lord’s power, and learn that truth alone makes rich and great.”
—Ralph Waldo Emerson (1803–1882)
“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)