Research on optimization A* algorithm based on energy consumption of mobile navigation robot

被引:0
作者
Hong, Bin [1 ,2 ,3 ]
Cao, Zhan [1 ,2 ]
Li, Fugeng [1 ,2 ]
Nie, Yahui [1 ,3 ]
Hou, Jing [1 ,2 ,3 ]
Feng, Changyuan [1 ,2 ]
Ma, Zhihao [1 ,2 ]
机构
[1] Tianjin Univ, Internal Combust Engine Res Inst, Vehicle Intelligence & Simulat Engn Lab, Tianjin 300072, Peoples R China
[2] Tianjin Univ, Sch Mech Engn, Tianjin 300072, Peoples R China
[3] Tianjin Tianbo Sci & Technol Co Ltd, Tianjin 300072, Peoples R China
关键词
Mobile navigation robot; A* algorithm; energy consumption; contrast test;
D O I
10.1142/S1793962325500370
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A novel energy-efficient optimization A* algorithm is proposed to address the performance requirements of energy consumption reduction and global optimality in the context of mobile navigation robots for the visually impaired. The energy cost function of mobile navigation robots is incorporated into a heuristic algorithm based on the A* algorithm to plan energy-optimal paths quickly. The optimized A* algorithm was compared with the original A* algorithm and the Q-learning algorithm through simulation experiments on a grid map using the MATLAB platform. The experimental results show that compared with the standard A* algorithm, the optimized A* algorithm reduces the path-planning time by 37.2% and the energy consumption by 29.5%. In addition, compared with the Q-learning algorithm, this algorithm's overall search efficiency is improved by 76.8%. Simulation results show that the optimized A* algorithm is more efficient in searching and has a shorter seek time, fully saving energy.
引用
收藏
页数:20
相关论文
共 24 条
[1]   Evaluating Softwarization Gains in Drone Networks [J].
Alharthi, Mohannad ;
Taha, Abd-Elhamid M. ;
Hassanein, Hossam S. .
2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
[2]   Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments [J].
Ammar, Adel ;
Bennaceur, Hachemi ;
Chaari, Imen ;
Koubaa, Anis ;
Alajlan, Maram .
SOFT COMPUTING, 2016, 20 (10) :4149-4171
[3]  
Bhattacharyya S., 2022, P 1 INT C HUM CENTR, P283
[4]   Magnitude, temporal trends, and projections of the global prevalence of blindness and distance and near vision impairment: a systematic review and meta-analysis [J].
Bourne, Rupert R. A. ;
Flaxman, Seth R. ;
Braithwaite, Tasanee ;
Cicinelli, Maria V. ;
Das, Aditi ;
Jonas, Jost B. ;
Keeffe, Jill ;
Kempen, John H. ;
Leasher, Janet ;
Limburg, Hans ;
Naidoo, Kovin ;
Pesudovs, Konrad ;
Resnikoff, Serge ;
Silvester, Alex ;
Stevens, Gretchen A. ;
Tahhan, Nina ;
Wong, Tien Y. ;
Taylor, Hugh R. .
LANCET GLOBAL HEALTH, 2017, 5 (09) :E888-E897
[5]   Similarity detection method of science fiction painting based on multi-strategy improved sparrow search algorithm and Gaussian pyramid [J].
Chen, Gang ;
Zhu, Donglin ;
Chen, Xiangyu .
MULTIMEDIA TOOLS AND APPLICATIONS, 2023, 83 (14) :41597-41636
[6]   From Industry 4.0 to Robotics 4.0-A Conceptual Framework for Collaborative and Intelligent Robotic Systems [J].
Gao, Zhen ;
Wanyama, Tom ;
Singh, Ishwar ;
Gadhrri, Anoop ;
Schmidt, Reiner .
13TH INTERNATIONAL CONFERENCE INTERDISCIPLINARITY IN ENGINEERING (INTER-ENG 2019), 2020, 46 :591-599
[7]   Time-Efficient A* Algorithm for Robot Path Planning [J].
Guruji, Akshay Kumar ;
Agarwal, Himansh ;
Parsediya, D. K. .
3RD INTERNATIONAL CONFERENCE ON INNOVATIONS IN AUTOMATION AND MECHATRONICS ENGINEERING 2016, ICIAME 2016, 2016, 23 :144-149
[8]   A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].
HART, PE ;
NILSSON, NJ ;
RAPHAEL, B .
IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+
[9]   Energy Modeling and Power Measurement for Mobile Robots [J].
Hou, Linfei ;
Zhang, Liang ;
Kim, Jongwon .
ENERGIES, 2019, 12 (01)
[10]  
Jin B., 2024, Meas.: Energy, V1, P100001, DOI [10.1016/j.meaene.2024.100001, DOI 10.1016/J.MEAENE.2024.100001]