Super Maps for the 21st Century

Posted by CmdrTaco on Sunday June 13, 2004 @02:10AM from the you-can't-get-there-from-here dept.

Roland Piquepaille writes "After five years of trials, Craig Knoblock and his team at the Information Sciences Institute of the University (ISI) of Southern California, have developed Heracles Maps, an easy-to-use laptop package to optimize routes in the whole world for both military and business travelers. This news release, "A SuperMap for Soldiers -- Or Business Travelers," says that the application integrates various sources of geospatial information, such as satellite imagery of mapping data. From this data, soldiers can easily find a safe route between two locations without being seen or shot from an enemy in another location. this package can easily be adapted to civilian applications, such as a powerful travel planner. You'll find more details and references in this overview."

1 of 101 comments (clear)

Min score:

Reason:

Sort:

Re:Travelling saleman problem? by Digital_Quartz · 2004-06-13 02:51 · Score: 3, Informative

The travelling salesmen problem is "Find the shortest path which visits every node in the network" (I.E: Find the shortest possible route to visit every city in a given set).

The "shortest path between two nodes" is definately in P, computable by Dijkstra's Shortest Path algorithm, for example.