A multi-scroll chaotic system for a higher coverage path planning of a mobile robot using flatness controller

2019 ◽  
Vol 118 ◽  
pp. 366-375 ◽  
Author(s):  
Salah Nasr ◽  
Hassen Mekki ◽  
Kais Bouallegue
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Chaotic System ◽  
Coverage Path Planning

scholarly journals A Bounded Strategy of the Mobile Robot Coverage Path Planning Based on Lorenz Chaotic System

10.5772/64115 ◽  
2016 ◽  
Vol 13 (3) ◽  
pp. 107 ◽  
Author(s):  
Caihong Li ◽  
Yong Song ◽  
Fengying Wang ◽  
Zhiqiang Wang ◽  
Yibin Li
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Chaotic System ◽  
Coverage Path Planning ◽  
Lorenz Chaotic System

CPC Algorithm: Exact Area Coverage by a Mobile Robot Using Approximate Cellular Decomposition

Robotica ◽  
2020 ◽  
pp. 1-22
Author(s):  
K. R. Guruprasad ◽  
T. D. Ranjitha
Keyword(s):  
Operating System ◽  
Path Planning ◽  
Mobile Robot ◽  
Formal Analysis ◽  
Area Coverage ◽  
Cell Permeability ◽  
Cellular Decomposition ◽  
Robot Operating System ◽  
Coverage Path Planning

SUMMARY A new coverage path planning (CPP) algorithm, namely cell permeability-based coverage (CPC) algorithm, is proposed in this paper. Unlike the most CPP algorithms using approximate cellular decomposition, the proposed algorithm achieves exact coverage with lower coverage overlap compared to that with the existing algorithms. Apart from a formal analysis of the algorithm, the performance of the proposed algorithm is compared with two representative approximate cellular decomposition-based coverage algorithms reported in the literature. Results of demonstrative experiments on a TurtleBot mobile robot within the robot operating system/Gazebo environment and on a Fire Bird V robot are also provided.

Virtual Door-Based Coverage Path Planning for Mobile Robot

2009 ◽  
pp. 197-207 ◽  
Author(s):  
Hyun Myung ◽  
Hae-min Jeon ◽  
Woo-Yeon Jeong ◽  
Seok-Won Bang
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Coverage Path Planning

Research on Coverage Path Planning of Mobile Robot Based on Genetic Algorithm

2013 ◽  
Vol 819 ◽  
pp. 379-383 ◽  
Author(s):  
San Peng Deng ◽  
Zhong Min Wang ◽  
Peng Zhou ◽  
Hong Bing Wu
Keyword(s):  
Genetic Algorithm ◽  
Path Planning ◽  
Mobile Robot ◽  
Cell Decomposition ◽  
Global Motion ◽  
Complete Coverage ◽  
Regional Environment ◽  
Coverage Path Planning ◽  
Environment Model ◽  
Local Space

This paper presents a complete coverage path planning method, which combines local space coverage with global motion planning. It is realized by modeling mobile robot environment based on Boustrophedon cell decomposition method; and according to the characteristics of regional environment model, the connectivity of the traversing space is represented by a complete weighted connected matrix. Then Genetic algorithm (GA) is used to optimize the subspace traversal distance to obtain the shortest global traversal sequence of mobile robot.

Sign in / Sign up

Export Citation Format

Share Document