Um Método Heurístico para Cálculo de Rotas com Desvios de Obstáculos em Serviços Web de Mapas Digitais

Victor E. D. BassoVasco Furtado

Computing a route between two points that deviate from an obstacle is a typical activity of geoprocessing systems, but that is not supported by services of digital map in the web due to the high computational cost. We propose here an approach to the problem that uses conjointly the shortest route provided by these services and heuristic methods based on visibility algorithms. This method is inspired in route planning for robots what can suggest alternative waypoints to force the contour of the obstacles identified. A comparative assessment of different scenarios indicates the feasibility of the method and its potential for improvement.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: