Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Rapid path planning method based on variant dual DQNs (deep Q-networks) and mobile robot

A mobile robot and fast path technology, applied to road network navigators and other directions, can solve problems such as overestimation of action values ​​and unsatisfactory mobile robots

Inactive Publication Date: 2018-08-07
UNIV OF SHANGHAI FOR SCI & TECH
View PDF3 Cites 24 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In practice, people generally use methods based on traditional algorithms such as ant colony algorithm. However, with the continuous development of science and technology, the environment faced by mobile robots is becoming more and more complex and changeable. Traditional path planning methods can no longer meet the needs of mobile robots. need
[0003] In response to this situation, people proposed Deep Reinforcement Learning (DRL), which integrates deep learning and reinforcement learning, in which deep learning is mainly responsible for using the perception function of the neural network to extract features from the input environment state. , to realize the fitting of the environment state to the state-action value function; while the reinforcement learning is responsible for completing the decision-making according to the output of the deep neural network and a certain exploration strategy, so as to realize the mapping from the state to the action, which can better meet the needs of mobile robots. Generally, path planning is based on the classic DQN algorithm in DRL. However, the DQN algorithm has the disadvantage of overestimating the action value.

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
  • Rapid path planning method based on variant dual DQNs (deep Q-networks) and mobile robot
  • Rapid path planning method based on variant dual DQNs (deep Q-networks) and mobile robot
  • Rapid path planning method based on variant dual DQNs (deep Q-networks) and mobile robot

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0043] Embodiments of the present invention are described in detail below, examples of which are shown in the drawings, wherein the same or similar reference numerals designate the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the figures are exemplary only for explaining the present invention and should not be construed as limiting the present invention.

[0044] see figure 1 , the embodiment of the present invention is a mutation-based dual DQN fast path planning method, which includes the following steps:

[0045] Step S1: The mobile robot samples mini-batch transformation information (s, a, r, s′, d) from the experience playback memory, and randomly selects one of the two dueling deep convolutional neural networks according to the first preset rule as the first online network and the other as the first target network,

[0046] Wherein, the mini-batch is the number of sampling experien...

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 rapid path planning method based on variant dual DQNs (deep Q-networks) and a mobile robot, wherein the mobile robot samples mini-batch conversion information from an experience replay storage; one of two dueling deep convolutional neural networks is selected as a first online network according to first preset rules, with the other serving as a first target network; predicted online operate value function Q(s, a; w) and greedy operation a' are acquired; maximum value of the predicted target operate value function is acquired; a loss function on current time step is calculated according to the maximum value of the predicted target operate value function and the predicted online operate value function; online weight parameter w is updated via an adaptive moment estimation method according to the loss function. The weight parameter updating mode based on dual Q learning and dueling DQN, and path planning is more effectively achieved for the mobile robot.

Description

technical field [0001] The present invention relates to the fields of machine learning and artificial intelligence, specifically, the present invention is a fast path planning method based on mutation-based double DQN. Background technique [0002] The path planning of the mobile robot means that the robot perceives the environment and autonomously plans a route to the target based on the information obtained by the sensor camera. In practice, people generally use methods based on traditional algorithms such as ant colony algorithm. However, with the continuous development of science and technology, the environment faced by mobile robots is becoming more and more complex and changeable. Traditional path planning methods can no longer meet the needs of mobile robots. need. [0003] In response to this situation, people proposed Deep Reinforcement Learning (DRL), which integrates deep learning and reinforcement learning, in which deep learning is mainly responsible for using ...

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): G01C21/34
CPCG01C21/34
Inventor 黄颖魏国亮王永雄
Owner UNIV OF SHANGHAI FOR SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products