[1] Zhang Chibin, Yan Xiaolong,. Robot coverage algorithm under rectangular decomposition environment [J]. Journal of Southeast University (English Edition), 2008, 24 (2): 188-191. [doi:10.3969/j.issn.1003-7985.2008.02.013]
Copy
Robot coverage algorithm under rectangular decomposition environment(
)
)Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]
- Volumn:
- 24
- Issue:
- 2008 2
- Page:
- 188-191
- Research Field:
- Automation
- Publishing date:
- 2008-06-03
Info
- Title:
- Robot coverage algorithm under rectangular decomposition environment
- Author(s):
- Zhang Chibin; Yan Xiaolong
- School of Mechanical Engineering, Southeast University, Nanjing 211189, China
- PACS:
- TP27
- DOI:
- 10.3969/j.issn.1003-7985.2008.02.013
- Abstract:
- The environment modeling algorithm named rectangular decomposition, which is composed of cellular nodes and interleaving networks, is proposed.The principle of environment modeling is to divide the environment into individual square sub-areas.Each sub-area is orientated by the central point of the sub-areas called a node.The rectangular map based on the square map can enlarge the square area side size to increase the coverage efficiency in the case of there being an adjacent obstacle.Based on this algorithm, a new coverage algorithm, which includes global path planning and local path planning, is introduced.In the global path planning, uncovered subspaces are found by using a special rule.A one-dimensional array P, which is used to obtain the searching priority of node in every direction, is defined as the search rule.The array P includes the condition of coverage towards the adjacent cells, the condition of connectivity and the priorities defined by the user in all eight directions.In the local path planning, every sub-area is covered by using template models according to the shape of the environment.The simulation experiments show that the coverage algorithm is simple, efficient and adapted for complex two-dimensional environments.
References:
[1] Zheng Xiaoming, Koenig Sven.Robot coverage of terrain with non-uniform traversability[C]//Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.San Diego, 2007:3757-3764.
[2] Hazon N, Kaminka G A.Redundancy efficiency and robustness in multi-robot coverage[C]//Proceedings of the 2005 IEEE International Conference on Robotics and Automation. Barcelona, Spain, 2005:735-741.
[3] Correll N, Martinoli A.Robust distributed coverage using a swarm of miniature robots[C]//2007 IEEE International Conference on Robotics and Automation.Roma, Italy, 2007:379-384.
[4] Kondo M, Kimura K.Collision avoidance using a free space enumeration method based on grid expansion[J].Advanced Robotics, 1989, 3(3):159-175.
[5] Trahanias P.Visual recognition of workspace landmarks for topological navigation [J].Autonomous Robotics, 1999, 7(2):143-158.
[6] Alberto Elfes.Sonar-based real-world mapping and navigation[J].IEEE Journal of Robotics and Automation, 1987, RA-3(3):249-265.
[7] Wang Meng, Liu James N K.Online path searching for autonomous robot navigation[C]//2004 IEEE Conference on Robotics, Automation and Mechatronics.Singapore, 2004:746-751.
Memo
- Memo:
-
Biography: Zhang Chibin(1968—), male, doctor, associate professor, chibinchang@yahoo.com.cn.
Foundation items: The National Natural Science Foundation of China(No.50475076), the National High Technology Research and Development Program of China(863 Program)(No.2006AA04Z234).
Citation: Zhang Chibin, Yan Xiaolong.Robot coverage algorithm under rectangular decomposition environment[J].Journal of Southeast University(English Edition), 2008, 24(2):188-191.