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:
“If a man can write a better book, preach a better sermon, or make a better mouse-trap, than his neighbor, though he build his house in the woods, the world will make a beaten path to his door.”
—Ralph Waldo Emerson (1803–1882)
“For the people in government, rather than the people who pester it, Washington is an early-rising, hard-working city. It is a popular delusion that the government wastes vast amounts of money through inefficiency and sloth. Enormous effort and elaborate planning are required to waste this much money.”
—P.J. (Patrick Jake)