A Multi-agent Cooperative Task Assignment Method Without Conflict

A task allocation and task technology, applied in data processing applications, instruments, calculations, etc., can solve problems such as agent conflicts and difficulty in taking into account time consumption at the same time, so as to avoid path conflicts, reduce task allocation time, and reduce calculation time.

Active Publication Date: 2021-10-01
BEIJING UNIV OF POSTS & TELECOMM
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] However, conflict avoidance and time-consuming costs are usually two incomparable and conflicting aspects in the process of multi-agents performing tasks, that is, it is difficult to take into account the minimum time consumption and avoid conflicts at the same time, that is, when multi-agents complete a certain In the process of the task, in order to make the time cost less, the optimal path will be selected, but in this case, it will inevitably cause conflicts between agents

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Multi-agent Cooperative Task Assignment Method Without Conflict
  • A Multi-agent Cooperative Task Assignment Method Without Conflict
  • A Multi-agent Cooperative Task Assignment Method Without Conflict

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0060] Below in conjunction with accompanying drawing and specific implementation, the present invention is described in further detail:

[0061] The embodiment is as follows: 8 tasks are assigned to 3 agents, and two complex tasks need to be executed by two agents respectively.

[0062] Step S101, establish an environment and resource model, represent the environment resource using a grid, and map the agent position and task position to the grid points:

[0063] A={a xy |a xy ∈{0,1},x∈{1,L x},y∈{1,L y}}, where a xy =1 means the grid point (x, y) can pass through, a xy =0 means the grid point (x, y) cannot pass through;

[0064] L x : Indicates the number of grid points in the abscissa direction, L x = 10;

[0065] L y : Indicates the number of grid points in the ordinate direction, L y = 16;

[0066] S R ={s r1 ,s r2 ,...,s ri ...,s rn}: represents the initial position set of the agent, where, S ri Represents the r in the agent set i initial position;

[0...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

An embodiment of the present invention provides a multi-agent non-conflict cooperative task assignment method, the method includes: performing task modeling on a multi-agent network; using a grid to perform resource modeling for the location of a scene; planning the relationship between an agent and each task The path between each location point is obtained; the time consumption between the agent and each task is calculated according to the moving path; for the tasks performed by the agent in the scene described, such tasks are decomposed into multiple simple tasks; In the coding process, repair unreasonable coding and determine the rationality of various codings; use intelligent evolutionary algorithms to analyze task allocation problems, and obtain the optimal solution of the current step; analyze path resource conflicts in the optimal solution, detect and avoid resource conflicts ; Through the whole algorithm process, the non-conflict cooperative task assignment of the multi-agent system is completed. By using the embodiments of the present invention, the efficiency of task allocation and execution in complex task allocation scenarios is improved, and shared resource conflicts are avoided.

Description

technical field [0001] The invention relates to the field of multi-Agent task assignment, and more specifically relates to a multi-Agent cooperative task assignment method which avoids shared resource conflicts. Background technique [0002] Cooperative task assignment means that a group of agents cooperate to solve a task, that is, agents cooperate to achieve a common goal. For tasks that cannot be accomplished by a single agent, agent collaboration can increase agent efficiency and allow more complex tasks to be performed. The advantages of agent collaboration are as follows: For an agent, it is impossible to complete some complex tasks independently, because the space of a single agent is limited. It may be cheaper and easier to use multiple simple agents than one complex agent. Multi-agent systems are more flexible and fault-tolerant than single-agent systems. [0003] In the current research and experiment process, in order to enable multi-agents to complete tasks co...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06Q10/06
CPCG06Q10/06312
Inventor 张洪光李嘉珂吴帆范文浩刘元安
Owner BEIJING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products