Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study two speedup techniques for route planning in road net- works: highway hierarchies (HH) and goal directed search using landmarks (ALT). It turns out that there are several interesting synergies. Highway hi- erarchies yield a way to implement landmark selection more efficiently and to store landmark information more space efficiently than before. ALT gives queries in highway hierarchies an excellent sense of direction and allows some pruning of the search space. For computing shortest distances and approxi- mately shortest travel times, this combination yields significant speedups (be- ten a factor of 2.5 and 5) over HH alone, while for exact queries using the travel time metric only minor improvements are achieved.  also explain how to compute actual shortest paths very efficiently.
['Daniel Delling', 'Peter Sanders', 'Dominik Schultes', 'Dorothea Wagner']
I am writing a research paper on a idea Highway Hierarchies Star
[{"from": "human", "value": "I am writing a research paper on a idea Highway Hierarchies Star"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study two speedup techniques for route planning in road net- works: highway hierarchies (HH) and goal directed search using landmarks (ALT). It turns out that there are several interesting synergies. Highway hi- erarchies yield a way to implement landmark selection more efficiently and to store landmark information more space efficiently than before. ALT gives queries in highway hierarchies an excellent sense of direction and allows some pruning of the search space. For computing shortest distances and approxi- mately shortest travel times, this combination yields significant speedups (be- ten a factor of 2.5 and 5) over HH alone, while for exact queries using the travel time metric only minor improvements are achieved.  also explain how to compute actual shortest paths very efficiently."}]