Multi-robot services are widely used to improve the efficiency of industry Internet applications, especially in smart factories. Under the situation that the tasks are becoming more and more intensive, how can smart factories use limited robot resources to complete tasks more efficiently? In order to solve this problem, we transform it into a resource-constrained multiproject scheduling problem, and consider using a combinatorial auction method to get the solution. In order to ensure the security of the system and solve the transaction cost of the robot system, we adopt Blockchain technology and smart contracts to organize the work of the robots. We finally conducted performance analysis of our proposed method, and the results show that smart contracts and combined auction algorithms are safe and effective.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Smart Contract-based Protocol for Efficient Project Scheduling in Industrial Internet


    Contributors:
    Liu, Peng (author) / Peng, Yanjun (author) / Fu, Tingting (author)


    Publication date :

    2020-11-01


    Size :

    1353831 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Smart Contract and Traditional Contract

    Motika, Željka | Wiley | 2020


    Blockchain-Based Adaptive Trust Management in Internet of Vehicles Using Smart Contract

    Singh, Pranav Kumar / Singh, Roshan / Nandi, Sunit Kumar et al. | IEEE | 2021


    Autonomous Vehicle Scheduling using the Contract Net Protocol in a Truck Terminal

    Suetake, N. / Ikari, H. / Unoki, T. | British Library Conference Proceedings | 1995


    Smart Contract Based Carpooling Application for Secure and Efficient Ride Sharing

    Bai V, Ramani / Sudhir, Pranav / Joshi, Rashmi et al. | IEEE | 2023


    Smart autolifting system based on industrial internet of things

    PARK HYUN MYO / HA SE HYUN / LEE GWI SEOK et al. | European Patent Office | 2020

    Free access