Corpus ID: 17963388

Research on Complete Coverage Path Planning Algorithms based on A*Algorithms

@article{Cai2014ResearchOC,
  title={Research on Complete Coverage Path Planning Algorithms based on A*Algorithms},
  author={Zengyu Cai and Shuxia Li and Yong Gan and Ran Zhang and Qikun Zhang},
  journal={The Open Cybernetics \& Systemics Journal},
  year={2014},
  volume={8}
}
�� � � � � � � � �� �� �� �� �� �� �� �� �� � �� �� �� �� �� �� �� �� �� � �� �� �� �� �� �� �� �� �� � �� �� �� �� �� �� �� �� �� � �� �� �� �� �� �� �� �� �� � �� �� �� �� �� �� �� �� �� � �� �� �� �� �� �� �� �� �� � �� �� �� �� �� �� �� �� �� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � 

Tables from this paper

Research on Full Traversal Path Planning based on Improved Reciprocating Algorithm
  • Bobo Ge, Shan. Hu, Peng Zheng
  • 2020 IEEE 9th Joint International Information Technology and Artificial Intelligence Conference (ITAIC)
  • 2020
In recent years, sweeping machines, as one of the household products in artificial intelligence applications, have continuously impacted our lives. However, there are common problems such asExpand
SOLUTION OF AN INTEGRATED TRAVELING SALESMAN AND COVERAGE PATH PLANNING PROBLEM BY USING A GENETIC ALGORITHM WITH MODIFIED OPERATORS
Coverage path planning (CPP) is a fundamental task that is conducted in many applications for machining, cleaning, mine sweeping, lawn mowing, and performing missions by using unmanned aerialExpand
Non Uniform Area Coverage (NUAC) for an agricultural robot based on grid decomposition
TLDR
Simulation results show that the proposed algorithm performs coverage efficiently in the presence of irregular obstacles within the environment. Expand
A path planning framework for indoor low-cost mobile robots
  • Sixiang Zuo, Y. Ou, Xiaorui Zhu
  • Engineering, Computer Science
  • 2017 IEEE International Conference on Information and Automation (ICIA)
  • 2017
TLDR
This paper presents a path planning framework for low-cost mobile robots, which mainly includes three parts: map-processing, collision avoidance and wall following, and proposes a local-map-based incremental wall following method without adding extra distance sensors. Expand
Path Planning of an Autonomous Robotic Vehicle for Outdoor Cleaning
  • A.S. Darsana, P. S. Lal Priya
  • Computer Science
  • 2018 International Conference on Circuits and Systems in Digital Enterprise Technology (ICCSDET)
  • 2018
TLDR
A new algorithm which reduces the number of turns as well as the repetition rate is been developed and it is compared with one of the latest algorithm and the proposed method is shown to give better results. Expand
Robot Coverage Path Planning under Uncertainty Using Knowledge Inference and Hedge Algebras
TLDR
A novel approach to enable autonomous robotic systems to achieve efficient coverage path planning is proposed, which combines adaptation with knowledge reasoning techniques and hedge algebras to achieve optimal Coverage path planning in multiple decision-making under dynamic operating environments. Expand
Hybrid Spiral STC-Hedge Algebras Model in Knowledge Reasonings for Robot Coverage Path Planning and Its Applications
Robotics is a highly developed field in industry, and there is a large research effort in terms of humanoid robotics, including the development of multi-functional empathetic robots as humanExpand
Robot Coverage Path planning for general surfaces using quadratic differentials
TLDR
This paper gives each point on the surface a uv-coordinates naturally represented by a complex number, except for a small number of zero points (singularities), and shows that natural, efficient robot paths can be obtained by using such coordinate systems. Expand
Localization and Mapping for Outdoor Mobile Robots with RTK GPS and Sensor Fusion : An Investigation of Sensor Technologies for the Automower Platform
The following thesis addresses the problem of localizing an outdoor mobile robot and mapping the environment using the state of the art of consumer grade RTK GPS. The thesis investigates limitationExpand
Applied Robot Coverage Path Planning with Multiple Decision Making Capability under Uncertainty using Knowledge Inference with Hedge Algebras
TLDR
A novel approach to enable an autonomous robotics which implements path planning combining adaptation with knowledge reasoning techniques and hedge algebra to enable a autonomous robot to realise optimal coverage path planning under dynamic uncertainty is proposed. Expand

References

SHOWING 1-10 OF 19 REFERENCES
A Complete Coverage Path Planning Method for Mobile Robot in Uncertain Environments
TLDR
Simulation studies show that the proposed method for mobile robot motion planning with obstacles avoidance is very effective for the dynamic uncertain environments. Expand
Coverage Path Planning: The Boustrophedon Cellular Decomposition
TLDR
The boustrophedon cellular decomposition is developed, which is an exact cel­ lular decomposition approach, for the purposes of coverage, and is provably complete and Experiments on a mobile robot validate this approach. Expand
Combined complete coverage path planning for autonomous mobile robot in indoor environment
Complete coverage path planning is a key problem for autonomous mobile robot, which concerns both efficiency and completeness of coverage. This paper proposed a novel strategy of combined coverageExpand
Complete coverage path planning of mobile robots for humanitarian demining
TLDR
A path planning algorithm for a non‐circular shaped mobile robot to autonomously navigate in an unknown area for humanitarian demining by finding the complete coverage path in the graph accounting for the dimensions of the mobile robot. Expand
Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach
TLDR
A set of multi-robot coverage algorithms is presented that minimize repeat coverage and use the same planar cell-based decomposition as the Boustrophedon single robot coverage algorithm, but provide extensions to handle how robots cover a single cell, and how robots are allocated among cells. Expand
Complete coverage path planning and guidance for cleaning robots
TLDR
A complete coverage path planning and guidance methodology for a mobile robot, having the automatic floor cleaning of large industrial areas as a target application, and the capability of the path planner to deal with a priori mapped or unexpected obstacles in the middle of the working space. Expand
Path Planning for Complete and Efficient Coverage Operation of Mobile Robots
TLDR
A novel cell decomposition algorithm that divides a given area into several cells so that each cell is covered by a robot motion that requires minimum time to cover the cell. Expand
On the Complete Coverage Path Planning for Mobile Robots
TLDR
This paper presents a generalized complete coverage path planning algorithm and its implementation for a mobile robot, and a backstepping controller considering constraints imposed on the control input is established to track the optimal route. Expand
Complete coverage navigation of cleaning robots using triangular-cell-based map
TLDR
This paper presents a novel approach for navigation of cleaning robots in an unknown workspace by proposing a new map representation method as well as a complete coverage navigation method which enable the cleaning robot to navigate the complete workspace without complete information about the environment. Expand
Obstacle Avoidance and Path Planning Based on Flow Field for Biomimetic Robotic Fish
TLDR
The swimming of the robot fish to avoid some obstacles is viewed as potential flow around the obstacles and the streamlines from the robot position to the target are chosen as the desired paths for the mobile robot to move to the destination. Expand
...
1
2
...