Check patentability & draft patents in minutes with Patsnap Eureka AI!

Multi-agent path planning method based on deep reinforcement learning

A technology of reinforcement learning and path planning, applied in the field of artificial intelligence, it can solve the problems of lack of communication, slow return convergence, and slow training process of intelligent agents, and achieve the effect of improving convergence speed, reducing computing cost, and improving efficiency.

Pending Publication Date: 2021-07-23
HANGZHOU DIANZI UNIV
View PDF0 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] In view of the above-mentioned deficiencies existing at present, the technical problem to be solved by the present invention lies in the lack of communication between agents in the prior art; the poor adaptability in the case of changing maps; Slow convergence of returns and slow training process due to framework design

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
  • Multi-agent path planning method based on deep reinforcement learning
  • Multi-agent path planning method based on deep reinforcement learning
  • Multi-agent path planning method based on deep reinforcement learning

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] Such as figure 1 and figure 2 As shown, it is the method flow of the present invention and the specific algorithm network structure. A multi-agent path planning method based on deep reinforcement learning proposed by the present invention includes the following steps:

[0035] S1: Generate a complex data set, in which the starting point and target point of each agent will be randomly generated, and different 2D grid square map sizes, obstacle densities, and the number of agents will be randomly combined.

[0036] Use python to generate or manually design a global grid map, obstacles, a certain number of agent start points and target point binary maps. The grid map is a square with a side length of 10, 50, and 100; the obstacle density is the percentage of the number of obstacle grids in the entire map to the number of map grids, which can be selected as 10%, 30%, and 50%; the number of agents is 4, 8, 32, 512, 1024, the agent must reach the target point, that is, be ...

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

The invention discloses a multi-agent path planning method based on deep reinforcement learning. The method is a distributed path planning method, and comprises the following steps: inputting local observation information of a single agent into a neural network, transmitting information among the agents by using the graph neural network, training an approximate strategy function of the neural network, and outputting a movement strategy. Neural network parameters are trained by using a method of combining deep reinforcement learning and imitation learning, so that the convergence of a return function is faster. After training, a higher group path planning success rate in a four-neighborhood 2D grid map can be realized under the scale of thousands of agents, namely, a collision-free route from a starting point to an ending point is successfully planned for each agent within time limitation. The adaptability to the change of the map size and the barrier density is high.

Description

technical field [0001] The invention belongs to the technical field of artificial intelligence, and in particular relates to a multi-agent path planning based on deep reinforcement learning. Background technique [0002] Multi-agent path planning is a problem of finding a set of non-conflicting paths for multiple agents from the starting position to the target position, while achieving optimal constraints: such as minimizing the sum of paths or action costs of all agents , throughput maximization, etc. Research on this problem has a large number of application scenarios in logistics, unmanned vehicles, military, security, games and other fields. [0003] There are many traditional algorithms for path planning of a single agent at home and abroad, such as A* algorithm, particle swarm algorithm, genetic algorithm, ant colony algorithm, simulated annealing algorithm, etc. With the improvement of industry and living standards, the work of a single agent often cannot meet the n...

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
IPC IPC(8): G06Q10/04G06N3/04G06N3/08
CPCG06Q10/047G06N3/08G06N3/045
Inventor 范钰捷林志赟王博程自帅韩志敏
Owner HANGZHOU DIANZI UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More