This is a routing problem, hopefully someone has already solved it. If there is a suburb of streets mapped from aerial imagery and you have several volunteers how do you work out the most efficient path for all the voluneteers to take to grab street names with minimal overlap etc.