Parallel algorithms for visibility analysis and path planning

In search and rescue (SAR) and emergency planning operations real-time response is critical, particularly when lives are endangered. Until recently, such operations were planned manually by experts in the field using tools such as templates, protractors and calculators. An initiative from the Depart...

Full description

Bibliographic Details
Main Author: Delle Donne, Vince
Other Authors: Ratzer, Gerald (advisor)
Format: Others
Language:en
Published: McGill University 1995
Subjects:
Online Access:http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22857
id ndltd-LACETR-oai-collectionscanada.gc.ca-QMM.22857
record_format oai_dc
spelling ndltd-LACETR-oai-collectionscanada.gc.ca-QMM.228572014-02-13T03:46:16ZParallel algorithms for visibility analysis and path planningDelle Donne, VinceGeodesy.Computer Science.In search and rescue (SAR) and emergency planning operations real-time response is critical, particularly when lives are endangered. Until recently, such operations were planned manually by experts in the field using tools such as templates, protractors and calculators. An initiative from the Department of National Defence of Canada has recommended the development of a prototype computerized tool to help the experts in the planning phase of these operations.This thesis, which was carried out under PRECARN project Passport, addresses two types of algorithms that are at the core of SAR and emergency planning operations: airborne path planning for surveillance and search, and land path planning for mobility analysis and rescue route determination.The major limitation associated with these algorithms is the high computational cost incurred from the treatment of vast amounts of data representing elevation, transportation networks, vegetation and other soil characteristics. In addition, the programming complexity of these algorithms is not negligible. These issues demand the high performance computing capabilities and relative ease of programming of today's multiprocessor shared-memory computers, as well as algorithms that are scalable and highly efficient.Parallel algorithms for visibility analysis and path planning using digital terrain data are proposed. The algorithms have been implemented on a Sun symmetric multiprocessor (SMP) SPARC 20 machine and integrated with the Passport airborne path planning and land path planning software. Results of experiments are presented. Some results are compared with a previous implementation on the MasPar MP-1 and MP-2 massively parallel computers.McGill UniversityRatzer, Gerald (advisor)1995Electronic Thesis or Dissertationapplication/pdfenalephsysno: 001476858proquestno: MM08007Theses scanned by UMI/ProQuest.All items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated.Master of Science (School of Computer Science.) http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22857
collection NDLTD
language en
format Others
sources NDLTD
topic Geodesy.
Computer Science.
spellingShingle Geodesy.
Computer Science.
Delle Donne, Vince
Parallel algorithms for visibility analysis and path planning
description In search and rescue (SAR) and emergency planning operations real-time response is critical, particularly when lives are endangered. Until recently, such operations were planned manually by experts in the field using tools such as templates, protractors and calculators. An initiative from the Department of National Defence of Canada has recommended the development of a prototype computerized tool to help the experts in the planning phase of these operations. === This thesis, which was carried out under PRECARN project Passport, addresses two types of algorithms that are at the core of SAR and emergency planning operations: airborne path planning for surveillance and search, and land path planning for mobility analysis and rescue route determination. === The major limitation associated with these algorithms is the high computational cost incurred from the treatment of vast amounts of data representing elevation, transportation networks, vegetation and other soil characteristics. In addition, the programming complexity of these algorithms is not negligible. These issues demand the high performance computing capabilities and relative ease of programming of today's multiprocessor shared-memory computers, as well as algorithms that are scalable and highly efficient. === Parallel algorithms for visibility analysis and path planning using digital terrain data are proposed. The algorithms have been implemented on a Sun symmetric multiprocessor (SMP) SPARC 20 machine and integrated with the Passport airborne path planning and land path planning software. Results of experiments are presented. Some results are compared with a previous implementation on the MasPar MP-1 and MP-2 massively parallel computers.
author2 Ratzer, Gerald (advisor)
author_facet Ratzer, Gerald (advisor)
Delle Donne, Vince
author Delle Donne, Vince
author_sort Delle Donne, Vince
title Parallel algorithms for visibility analysis and path planning
title_short Parallel algorithms for visibility analysis and path planning
title_full Parallel algorithms for visibility analysis and path planning
title_fullStr Parallel algorithms for visibility analysis and path planning
title_full_unstemmed Parallel algorithms for visibility analysis and path planning
title_sort parallel algorithms for visibility analysis and path planning
publisher McGill University
publishDate 1995
url http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22857
work_keys_str_mv AT delledonnevince parallelalgorithmsforvisibilityanalysisandpathplanning
_version_ 1716638638530363392