Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 30458


Select areas to restrict search in scientific publication database:
10011145
Hybrid Gravity Gradient Inversion-Ant Colony Optimization Algorithm for Motion Planning of Mobile Robots
Authors:
Abstract:
Motion planning is a common task required to be fulfilled by robots. A strategy combining Ant Colony Optimization (ACO) and gravity gradient inversion algorithm is proposed for motion planning of mobile robots. In this paper, in order to realize optimal motion planning strategy, the cost function in ACO is designed based on gravity gradient inversion algorithm. The obstacles around mobile robot can cause gravity gradient anomalies; the gradiometer is installed on the mobile robot to detect the gravity gradient anomalies. After obtaining the anomalies, gravity gradient inversion algorithm is employed to calculate relative distance and orientation between mobile robot and obstacles. The relative distance and orientation deduced from gravity gradient inversion algorithm is employed as cost function in ACO algorithm to realize motion planning. The proposed strategy is validated by the simulation and experiment results.
Digital Object Identifier (DOI):

References:

[1] G. J. Heald and H. D .Griiffiths, “A review of underwater detection techniques and their applicability to the landmine problem”. in Proc.2nd Int. Conf. Detection Abandoned Land Mine, pp.173-176, 1998.
[2] Ling Xiong, Jie Ma, Jin-wen Tian. “Gravity Gradient Aided Position Approach Based on EKF and NN”. 2011 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference, pp. 1347-1350, July.2011.
[3] H. Zheng, H. Wang, L. Wu, H. Chai, Y. Wang. “Simulation Research on Gravity-Geomagnetism Combined Aided Underwater Navigation”. Royal Institute of Navigation, vol. 66, No. 1, pp. 83-98, 2013.
[4] L. Wu, X. Tian, J. Ma, and J.W. Tian, “Underwater object detection based on gravity gradient, “IEEE Geosci. Remote Sens. Lett., vol. 7, no.2, pp.362-365, Apr.2010.
[5] L. Wu, X.P. Ke, H. Hsu, J. Fang, C.Y. Xiong, and Y. Wang, “Joint gravity and gravity gradient inversion for subsurface underwater object detection,” IEEE Geosci. Remote Sens. Lett., vol. 107, no.4, pp.865-869, Jul.2013.
[6] L. Wu and J.W.Tian, “Automated gravity gradient tensor inversion for underwater object detection,” J. Geophys. Eng., vol. 7,no. 4, pp. 410-416,Dec.2010.
[7] Zu Yan, J.Ma, Jinwen Tian, Hai Liu, Jinggang Yu, and Yun Zhang “A Gravity Gradient Differential Ratio Method for Underwater object Detection,“ IEEE Geosci. Remote Sens. Lett., vol. 11, no.4, pp.833-837, Apr.2014.
[8] Song-Hiang Chia, Kuo-Lan Su, Jr-Hung Guo, Cheng-Yun Chung.” Ant Colony System Based Mobile Robot Path Planning”, 2010 Fourth International Conference on Genetic and Evolutionary Computing, pp. 210-213, 2010.
[9] Michael Brand, Michael Masuda, Nicole Wehner and Xiao-Hua Yu. “Ant Colony Optimization algorithm for robot path planning”, 2010 International Conference on Computer Design and Applications, pp. V3-436-V3-440, 2010.
[10] Zhang Chibin, Wang Xingsong and Du Yong. “Complete Coverage Path Planning Based on Ant Colony Algorithm”, 2008 15th International Conference on Mechatronics and Machine Vision in Practice, pp. 357-361, 2008.
[11] Jie Chen, Fang Ye and Tao Jiang. “Path Planning under Obstacle-Avoidance Constraints Based on Ant Colony Optimization Algorithm”, 2017 17th International Conference on Communication Technology (ICCT), pp. 1434-1438, 2017.
[12] Rong Du, Xiaobin Zhang, Cailian Chen and Xingping Guan. “Path Planning under Obstacle-Avoidance Constraints Based on Ant Colony Optimization Algorithm”, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, pp. 768-773, 2010
[13] Ronald Uriol, Antonio Moran. “Mobile Robot Path Planning in Complex Environments Using Ant Colony Optimization Algorithm”, 2017 3rd International Conference on Control, Automation and Robotics (ICCAR), pp: 15-21, 2017.
Vol:14 No:05 2020Vol:14 No:04 2020Vol:14 No:03 2020Vol:14 No:02 2020Vol:14 No:01 2020
Vol:13 No:12 2019Vol:13 No:11 2019Vol:13 No:10 2019Vol:13 No:09 2019Vol:13 No:08 2019Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007