Boolean networks-based auction algorithm for task assignment of multiple UAVs (Q1665641)

From MaRDI portal
Revision as of 21:51, 24 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Boolean networks-based auction algorithm for task assignment of multiple UAVs
scientific article

    Statements

    Boolean networks-based auction algorithm for task assignment of multiple UAVs (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2018
    0 references
    Summary: This paper presents an application of Boolean networks-based auction algorithm (BNAA) for task assignment in unmanned aerial vehicles (UAVs) systems. Under reasonable assumptions, the assignment framework consists of mission control system, communication network, and ground control station. As the improved algorithm of consensus-based bundle algorithm (CBBA), the BNAA utilizes a cluster-based combinatorial auction policy to handle multiple tasks. Instead of empirical method based on look-up table about conditional variables, Boolean network is introduced into consensus routine of BNAA for solving the conflict of assignment across the fleet of UAVs. As a new mathematic theory, semitensor product provides the implementation and theoretical proof of Boolean networks. Numerical results demonstrate the effectiveness and efficiency of proposed BNAA method.
    0 references

    Identifiers