Base position planning of mobile manipulators for assembly tasks in construction environments

Abstract

With good mobility and flexibility, mobile manipulators have shown broad applications in construction scenarios. Base position (BP) planning, which refers to the robot autonomously determining its working station in the environment, is an important technique for mobile manipulators when performing the construction assembly task, especially in a large-scale construction environment. However, the BP planning process is tedious and time-consuming for a human worker to carry out. Thus, to improve the efficiency of construction assembly tasks, a novel BP planning method is proposed in this paper, which can lead to appropriate BPs and minimize the number of BPs at the same time. Firstly, the feasible BP regions are generated based on the grid division and the variable workspace of the mobile manipulator. Then, the positioning uncertainties of the mobile manipulator are considered in calculating the preferred BP areas using clustering. Lastly, a set coverage optimization model is established to obtain the minimum number of BPs using an optimization algorithm according to the greedy principle. The simulated experiment based on a 9-degree of free (DoF) mobile manipulator has been performed. The results illustrated that the time for BP planning was significantly reduced and the number of BPs was reduced by 63.41% compared to existing manual planning, which demonstrated the effectiveness of the proposed method.

Keywords

Base position (BP) planning / Mobile manipulators / Variable workspace / Positioning uncertainties / Construction environments

References

[1] Kim S, Peavy M, Huang PC, et al. Development of BIM-integrated construction robot task planning and simulation system. Autom Constr, 2021, 127.

[2] Gharbia M, Chang-Richards A, Lu Y, et al. Robotic technologies for on-site building construction: a systematic review. J Build Eng, 2020, 32.

[3] Giftthaler M, Sandy T, Dörfler K, et al. Mobile robotic fabrication at 1:1 scale: the In situ Fabricator. Construct Robot, 2017, 1: 3-14.

[4] Ren S, Yang X, Xu J, et al. Determination of the base position and working area for mobile manipulators. Assembly Autom, 2016, 36: 80-88.

[5] Xu J, Domae Y, Ueshiba T, et al. Planning a Minimum sequence of positions for picking parts from multiple trays using a mobile manipulator. IEEE Access, 2021, 9: 165526-165541.

[6] Yu Q, Wang G, Hua X, et al. Base position optimization for mobile painting robot manipulators with multiple constraints. Robot CIM-Int Manuf, 2018, 54: 56-64.

[7] Zeghloul S, Pamanes-Garcia JA. Multi-criteria optimal placement of robots in constrained environments. Robotica, 1993, 11: 105-110.

[8] Feddema JT (1996) Kinematically optimal robot placement for minimum time coordinated motion. In: proceedings of IEEE international conference on robotics and automation, pp 3395–3400

[9] Hsu D, Latcombe JC, Sorkin S (1999) Placing a robot manipulator amid obstacles for optimized execution. In: proceedings of the 1999 IEEE international symposium on assembly and task planning (ISATP'99)(Cat. no. 99TH8470), pp 280–285

[10] Mits S, Bouzakis KD, Sagris D, et al. Determination of optimum robot base location considering discrete end-effector positions by means of hybrid genetic algorithm. Robot CIM-Int Manuf, 2008, 24: 50-59.

[11] Ren S, Yang X, Wang G et al (2015) Study on the stop position of the mobile manipulator for painting on big parts. ASME international mechanical engineering congress and exposition (IMECE2015), Houston, TX, https://doi.org/10.1115/IMECE2015-50907

[12] Ren S, Xie Y, Yang X, et al. A method for optimizing the base position of mobile painting manipulators. IEEE T Autom Sci Eng, 2017, 14: 370-375.

[13] Fan Q, Gong Z, Tao B, et al. Base position optimization of mobile manipulators for machining large complex components. Robot CIM-Int Manuf, 2021, 70.

[14] Lin X, Yang J, Yue Y. A base position planning strategy for a mobile inspection robot. J Astronautics, 2018, 39: 1030-1037.

[15] Harada K, Tsuji T, Kikuchi K et al (2015) Base position planning for dual-arm mobile manipulators performing a sequence of pick-and-place tasks. IEEE-RAS International Conference on Humanoid Robots, pp 194–201

[16] Vafadar S, Olabi A, Panahi MS (2018) Optimal motion planning of mobile manipulators with minimum number of platform movements. 19th IEEE International Conference on Industrial Technologies (ICIT), 262–267, Lyon, France. doi:https://doi.org/10.1109/icit.2018.8352187

[17] Xu J, Domae Y, Ueshiba T (2020) Planning a sequence of base positions for a mobile manipulator to perform multiple pick-and-place tasks. arXiv preprint arXiv:2010.00779

[18] Helm V, Ercan S, Gramazio F et al (2012) Mobile robotic fabrication on construction sites: dimRob. 25th IEEE\RSJ International Conference on Intelligent Robots and Systems (IROS), 4335–4341, Algarve, Portugal

[19] Sandy T, Giftthaler M, Dörfler K. Autonomous repositioning and localization of an in situ fabricator. IEEE International Conference on Robotics and Automation (ICRA), 2016, 2016: 2852-2858.

[20] Ding L, Jiang W, Zhou Y, et al. BIM-based task-level planning for robotic brick assembly through image-based 3D modeling. Adv Eng Inform, 2020, 43.

[21] Zhang S, Qie J, Shao Z (2021) Workspace analysis of a mobile robot system for the ship section painting. In: 14th International Conference on Intelligent Robotics and Applications (ICIRA), 716–727, Yantai, China

[22] Siciliano B, Khatib O. Robotics and the Handbook, 2016, Germany: Springer.

[23] Craig JJ. Introduction to robotics: mechanics and control, 2009, India: Pearson Education

[24] Xu J, Harada K, Wan W. Planning an efficient and robust base sequence for a mobile manipulator performing multiple pick-and-place tasks. IEEE Int Conf Robot Automat (ICRA), 2020, 2020: 11018-11024.

[25] Zeng D, Wan S, Li Y, et al. A hybrid optimization algorithm for working position setting of assembling robot. J Graphics, 2016, 37: 496-501.

[26] AlSultan KS, Hussain MF, Nizami JS. A genetic algorithm for the set covering problem. J Oper Res Soc, 1996, 47: 702-709.

[27] Du HK, Zhao YK. Survey on intelligent optimization algorithms for solving integer programming problems. Appl Res Comput, 2010, 27: 408-412.

[28] Tomazella CP, Nagano MS. A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem. Expert Syst Appl, 2020, 158.

[29] Lan G, DePuy GW, Whitehouse GE. An effective and simple heuristic for the set covering problem. Eur J Oper Res, 2007, 176: 1387-1403.

Funding

National Natural Science Foundation of China http://dx.doi.org/10.13039/501100001809(U1913603)