• Login
    View Item 
    •   Home
    • IRAC Institute for Research in Applicable Computing - to April 2016
    • Centre for Research in Distributed Technologies (CREDIT)
    • View Item
    •   Home
    • IRAC Institute for Research in Applicable Computing - to April 2016
    • Centre for Research in Distributed Technologies (CREDIT)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UOBREPCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalDepartmentThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalDepartment

    My Account

    LoginRegister

    About

    AboutLearning ResourcesResearch Graduate SchoolResearch InstitutesUniversity Website

    Statistics

    Display statistics

    A novel scalable parallel algorithm for finding optimal paths over heterogeneous terrain

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Authors
    Maple, Carsten
    Hitchcock, Jonathan James
    Issue Date
    2005-07-07
    Subjects
    A* algorithm
    parallel computing
    path planning
    
    Metadata
    Show full item record
    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
    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
    ae974a485f413a2113503eed53cd6c53
    10.1109/IV.2005.12
    Scopus Count
    Collections
    Centre for Research in Distributed Technologies (CREDIT)

    entitlement

     
    DSpace software (copyright © 2002 - 2021)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.