Task assignment based on improved contract net in dynamic environment

Wang Mingqian; Cao Shuai

doi:10.30574/gjeta.2020.2.3.0018

Research & review articles are invited for publication in September 2026 (Vol. 28, Issue 3) || Submission: up to 28^th September || Editorial decision: within 48 hrs.

Task assignment based on improved contract net in dynamic environment

Wang Mingqian ^{1, 2, *} and Cao Shuai ^{1, 2}

1 School of Information Engineering, Changzhou Vocational Institute of Mechatronic Technology, Changzhou, Jiangsu Province, P.R.China.

2 Jiangsu Internet of Things and Manufacturing Information Engineering Technology Research and Development Center, Changzhou, Jiangsu Province, P.R.China.

Research Article

Global Journal of Engineering and Technology Advances, 2020, 02(03), 045-053.

Article DOI: 10.30574/gjeta.2020.2.3.0018

DOI url: https://doi.org/10.30574/gjeta.2020.2.3.0018

Publication history

Received on 15 March 2020; accepted on 21 March 2020

Abstract

Task assignment algorithm research is an important direction in multi-agent research. The traditional contract-based task allocation algorithm has a low efficiency problem, and the problem will be more prominent in a dynamic environment. In the dynamic environment, an improved contract network method is proposed for the task allocation algorithm of multi-agent system. This method considers task familiarity and load balance, and improves the efficiency of multi-agent system allocation. Simulation results show that this paper shows that the method improves the system revenue.

Keywords

Dynamic environment; Improved contract net; Task familiarity; Task assignment

Download Article PDF

https://gjeta.com/sites/default/files/fulltext_pdf/GJETA-2020-0018.pdf

Preview Article PDF

How to cite this article

Wang Mingqian and Cao Shuai. Task assignment based on improved contract net in dynamic environment. Global Journal of Engineering and Technology Advances, 2020, 2(3), 045-053. Article DOI: https://doi.org/10.30574/gjeta.2020.2.3.0018

Copyright © Author(s). All rights reserved. This article is published under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, sharing, adaptation, distribution, and reproduction in any medium or format, as long as appropriate credit is given to the original author(s) and source, a link to the license is provided, and any changes made are indicated.

All statements, opinions, and data contained in this publication are solely those of the individual author(s) and contributor(s). The journal, editors, reviewers, and publisher disclaim any responsibility or liability for the content, including accuracy, completeness, or any consequences arising from its use.