We present an algorithm that enables robots to navigate a street network with a minimum of local and global knowledge using the Dipole calculus for qualitative spatial representation of line segments. A constraint-based approach is employed where decisions are made based on relational constraints imposed on possible route alternatives. We also provide a simulation to evaluate the usefulness of the navigation algorithm.