Path planning of intelligent mobile robot based on Dijkstra algorithm

Under the premise of grid environment modeling method, a relaxed Dijkstra algorithm is proposed to solve the problem of real-time path planning for mobile robot in large-scale and obstacle intensive working environment. Firstly, four neighborhood search is used to construct the Manhattan distance po...

Full description

Bibliographic Details

Published in:	Journal of physics. Conference series Vol. 2083; no. 4; pp. 42034 - 42041
Main Author:	Li, Xueyan
Format:	Journal Article
Language:	English
Published:	IOP Publishing 01.11.2021
Subjects:	Grid method Mobile robot Path planning Relaxed Dijkstra algorithm
ISSN:	1742-6588, 1742-6596
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!