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:
“Often on bare rocky carries the trail was so indistinct that I repeatedly lost it, but when I walked behind him I observed that he could keep it almost like a hound, and rarely hesitated, or, if he paused a moment on a bare rock, his eye immediately detected some sign which would have escaped me. Frequently we found no path at all at these places, and were to him unaccountably delayed. He would only say it was “ver strange.””
—Henry David Thoreau (1817–1862)
“When we are planning for posterity, we ought to remember that virtue is not hereditary.”
—Thomas Paine (1737–1809)