2.50
Hdl Handle:
http://hdl.handle.net/10547/297906
Title:
A novel scalable parallel algorithm for finding optimal paths over heterogeneous terrain
Authors:
Maple, Carsten; Hitchcock, Jonathan James
Abstract:
The area of path planning has received a great deal of attention recently. Algorithms are required that can deliver optimal paths for robots to take over homogeneous or non-homogeneous terrain. Optimal paths may be those that involve the shortest distance travelled, the least number of turns or the least number of ascents and descents. The often highly complex nature of terrains and the necessity for realtime solutions have lead to a requirement for the development of parallel algorithms. Such problems have been notoriously difficult to parallelise efficiently; indeed it has been said that an efficiency of 25-60% should be considered a success. In this paper we present a parallel algorithm for finding optimal paths over non-homogeneous terrain that demonstrates superlinear speed-up.
Citation:
Maple, C., Hitchcock, J. (2005) "A novel scalable parallel algorithm for finding optimal paths over heterogeneous terrain", Proceedings of the Ninth International Conference on Information Visualisation (IV’05), 664-669
Publisher:
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date:
7-Jul-2005
URI:
http://hdl.handle.net/10547/297906
DOI:
10.1109/IV.2005.12
Additional Links:
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1509145
Type:
Conference papers, meetings and proceedings
Language:
en
ISSN:
1550-6037
ISBN:
0769523978
Appears in Collections:
Centre for Research in Distributed Technologies (CREDIT)

Full metadata record

DC FieldValue Language
dc.contributor.authorMaple, Carstenen_GB
dc.contributor.authorHitchcock, Jonathan Jamesen_GB
dc.date.accessioned2013-08-12T08:32:08Z-
dc.date.available2013-08-12T08:32:08Z-
dc.date.issued2005-07-07-
dc.identifier.citationMaple, C., Hitchcock, J. (2005) "A novel scalable parallel algorithm for finding optimal paths over heterogeneous terrain", Proceedings of the Ninth International Conference on Information Visualisation (IV’05), 664-669en_GB
dc.identifier.isbn0769523978-
dc.identifier.issn1550-6037-
dc.identifier.doi10.1109/IV.2005.12-
dc.identifier.urihttp://hdl.handle.net/10547/297906-
dc.description.abstractThe area of path planning has received a great deal of attention recently. Algorithms are required that can deliver optimal paths for robots to take over homogeneous or non-homogeneous terrain. Optimal paths may be those that involve the shortest distance travelled, the least number of turns or the least number of ascents and descents. The often highly complex nature of terrains and the necessity for realtime solutions have lead to a requirement for the development of parallel algorithms. Such problems have been notoriously difficult to parallelise efficiently; indeed it has been said that an efficiency of 25-60% should be considered a success. In this paper we present a parallel algorithm for finding optimal paths over non-homogeneous terrain that demonstrates superlinear speed-up.en_GB
dc.language.isoenen
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCen_GB
dc.relation.urlhttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1509145en_GB
dc.subjectA* algorithmen_GB
dc.subjectparallel computingen_GB
dc.subjectpath planningen_GB
dc.titleA novel scalable parallel algorithm for finding optimal paths over heterogeneous terrainen
dc.typeConference papers, meetings and proceedingsen
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.