Real-Time Efficient Exploration in Unknown Dynamic Environments Using MAVs

被引:0
作者
Mohamed, Haytham [1 ]
Moussa, Adel [1 ,2 ]
Elhabiby, Mohamed [3 ]
El-Sheimy, Naser [1 ]
机构
[1] Univ Calgary, Dept Geomat Engn, Calgary, AB T2N 1N4, Canada
[2] Port Said Univ, Dept Elect & Comp Engn, Port Said 42523, Egypt
[3] Ain Shams Univ, Publ Works Dept, Cairo 11566, Egypt
基金
加拿大自然科学与工程研究理事会;
关键词
scan matching; SLAM; laser rangefinder; point registration; least squares; line tracking; PCA; ICP; MAV; reference key frame; FLIGHT;
D O I
10.3390/ijgi7110450
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Micro aerial vehicles (MAVs) have been acknowledged as an influential technology for indoor search and rescue operations. The time constraint is a crucial factor in most search and rescue operations. The employed MAVs in indoor environments are characterized by short endurance flight time and limited payload weights. Hence, adding more batteries to extend the flight time is practically not feasible. Typically, most of the indoor missions' environments might not be accessed and remain unknown. Working in such environments requires effective exploration and information gathering to save time and maximize the coverage area. Furthermore, due to the dynamism of such environments, choosing the least risky trajectory is an important task. This paper proposes a real-time active exploration technique which is capable of efficiently generating paths that minimize the vehicle's risk and maximize the coverage area. Furthermore, it accomplishes real-time monitoring of sudden changes in the estimated map, due to the dynamic objects, by reevaluating at real-time the destination and trajectory to minimize the risk on the chosen path and simultaneously preserving the maximization of the coverage area. Ultimately, recording the implemented trajectory of the vehicle also assists in time-saving as the vehicle depends on this trajectory during the exit process. The performance of the technique is studied under static and dynamic environments and is also compared with different algorithms.
引用
收藏
页数:23
相关论文
共 29 条
[1]  
Acuna R., 2012, P 15 INT C CLIMB WAL
[2]  
[Anonymous], 2016 IEEE S SER COMP
[3]  
[Anonymous], 2006, THESIS
[4]   A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices [J].
Barbehenn, M .
IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (02) :263-263
[5]  
Bruce J, 2002, 2002 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-3, PROCEEDINGS, P2383, DOI 10.1109/IRDS.2002.1041624
[6]  
Buniyamin N., 2011, Int. J. Syst. Appl., Eng. Dev., V5, P151
[7]   2D Euclidean distance transform algorithms: A comparative survey [J].
Fabbri, Ricardo ;
Costa, Luciano Da F. ;
Torelli, Julio C. ;
Bruno, Odemir M. .
ACM COMPUTING SURVEYS, 2008, 40 (01)
[8]   Replanning with RRTs [J].
Ferguson, Dave ;
Kalra, Nidhi ;
Stentz, Anthony .
2006 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), VOLS 1-10, 2006, :1243-1248
[9]   Anytime RRTs [J].
Ferguson, Dave ;
Stentz, Anthony .
2006 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-12, 2006, :5369-+
[10]  
Hoffmann R, 2013, 2013 EUROPEAN CONFERENCE ON MOBILE ROBOTS (ECMR 2013), P38, DOI 10.1109/ECMR.2013.6698817