Recent Advances in Mobile Robotics 2011
DOI: 10.5772/26889
|View full text |Cite
|
Sign up to set email alerts
|

Neural Networks Based Path Planning and Navigation of Mobile Robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…Simulated annealing method has been developed to avoid such type of problem. 52 Kroumov and Yu 53 addressed the problems related to generating optimal paths with the help of neural networks. Modified pulse-coupled neural network (MPCNN) is a real-time system which constructs a grid-based map by processing images captured using vision camera sensors.…”
Section: Development Stages For Automatic Steering System Of the Lhd mentioning
confidence: 99%
“…Simulated annealing method has been developed to avoid such type of problem. 52 Kroumov and Yu 53 addressed the problems related to generating optimal paths with the help of neural networks. Modified pulse-coupled neural network (MPCNN) is a real-time system which constructs a grid-based map by processing images captured using vision camera sensors.…”
Section: Development Stages For Automatic Steering System Of the Lhd mentioning
confidence: 99%
“…Using a topologically‐ordered map, [LYS09] plan paths in a 2D multi‐agent environment, later extended to a cooperative hunting task by [NY11]. [KY11] introduces a neural network that has an obstacle description of a stationary 2D environment in its hidden layer and outputs a repulsive penalty function to solve the local minima problem of the artificial potential field method in navigating mobile robots. [DH14] uses ant colony optimization to plan a global path with least repulsive penalty function produced by a neural network that has obstacle information in its hidden layers.…”
Section: Related Workmentioning
confidence: 99%
“…The spanning tree method combines every four grids into a unit and realizes traversal by connecting all units. This method requires a lot of storage space, and the path turns into the biological excitation neural network algorithm [5]. The neuron uses the shunt equation to communicate with the adjacent neurons.…”
Section: Introductionmentioning
confidence: 99%