• Login
    View Item 
    •   Home
    • Research Publications
    • Engineering & Technology
    • Department of Electronics, Computing & Maths
    • View Item
    •   Home
    • Research Publications
    • Engineering & Technology
    • Department of Electronics, Computing & Maths
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UDORACommunitiesTitleAuthorsIssue DateSubmit DateSubjectsThis CollectionTitleAuthorsIssue DateSubmit DateSubjects

    My Account

    LoginRegister

    About and further information

    AboutOpen Access WebpagesOpen Access PolicyTake Down Policy University Privacy NoticeUniversity NewsTools for ResearchersLibraryUDo

    Statistics

    Display statistics

    Reliable, distributed scheduling and rescheduling for time-critical, multiagent systems

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Whitbrook_2017_Reliable_distri ...
    Size:
    2.207Mb
    Format:
    PDF
    Description:
    Published PDF (Open Access ...
    Download
    Authors
    Whitbrook, Amanda cc
    Meng, Qinggang
    Chung, Paul W. H.
    Affiliation
    University of Derby
    Loughborough University
    Issue Date
    2017-04-26
    
    Metadata
    Show full item record
    Abstract
    This paper addresses two main problems with many heuristic task allocation approaches – solution trapping in local minima and static structure. The existing distributed task allocation algorithm known as PI (Performance Impact) is used as the vehicle for developing solutions to these problems as it has been shown to out-perform the state-of-the-art Consensus Based Bundle Algorithm (CBBA) for time-critical problems with tight deadlines, but is both static and sub-optimal with a tendency towards trapping in local minima. The paper describes two additional modules that are easily integrated with PI. The first extends the algorithm to permit dynamic online rescheduling in real time, and the second boosts performance by introducing an additional soft max action selection procedure that increases the algorithm’s exploratory properties. The paper demonstrates the effectiveness of the dynamic rescheduling module and shows that the average time taken to perform tasks can be reduced by up to 9% when the soft max module is used. In addition, the solution of some problems that baseline PI cannot handle is enabled by the second module. These developments represent a significant advance in the state-of-the-art for multi-agent, time-critical task assignment.
    Citation
    Whitbrook, A. et al (2017) 'Reliable, Distributed Scheduling and Rescheduling for Time-Critical, Multiagent Systems' , IEEE Transactions on Automation Science and Engineering, DOI: 10.1109/TASE.2017.2679278
    Publisher
    IEEE
    Journal
    IEEE Transactions on Automation Science and Engineering
    URI
    http://hdl.handle.net/10545/621610
    DOI
    10.1109/TASE.2017.2679278
    Additional Links
    http://ieeexplore.ieee.org/document/7907248/
    Type
    Article
    Language
    en
    ISSN
    1545-5955
    EISSN
    15583783
    ae974a485f413a2113503eed53cd6c53
    10.1109/TASE.2017.2679278
    Scopus Count
    Collections
    Department of Electronics, Computing & Maths

    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.