Editing Robotic mapping (section)

== Path planning ==
[[motion 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]] of finding a route between two nodes in a [[Graph (discrete mathematics)|graph]].