{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T08:46:34Z","timestamp":1767084394875},"reference-count":35,"publisher":"Cambridge University Press (CUP)","issue":"11","license":[{"start":{"date-parts":[[2015,3,20]],"date-time":"2015-03-20T00:00:00Z","timestamp":1426809600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:title>SUMMARY<\/jats:title><jats:p>This paper considers the problem of merging grid maps that have different resolutions. Because the goal of map merging is to find the optimal transformation between two partially overlapping grid maps, it can be viewed as a special image registration issue. To address this special issue, the solution considers the non-common areas and designs an objective function based on the trimmed mean-square error (MSE). The trimmed and scaling iterative closest point (TsICP) algorithm is then proposed to solve this well-designed objective function. As the TsICP algorithm can be proven to be locally convergent in theory, a good initial transformation should be provided. Accordingly, scale-invariant feature transform (SIFT) features are extracted for the maps to be potentially merged, and the random sample consensus (RANSAC) algorithm is employed to find the geometrically consistent feature matches that are used to estimate the initial transformation for the TsICP algorithm. In addition, this paper presents the rules for the fusion of the grid maps based on the estimated transformation. Experimental results carried out with publicly available datasets illustrate the superior performance of this approach at merging grid maps with respect to robustness and accuracy.<\/jats:p>","DOI":"10.1017\/s0263574715000168","type":"journal-article","created":{"date-parts":[[2015,3,20]],"date-time":"2015-03-20T14:31:54Z","timestamp":1426861914000},"page":"2516-2531","source":"Crossref","is-referenced-by-count":19,"title":["Merging grid maps of different resolutions by scaling registration"],"prefix":"10.1017","volume":"34","author":[{"given":"Liang","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jihua","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaoyi","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingru","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2015,3,20]]},"reference":[{"key":"S0263574715000168_ref34","doi-asserted-by":"publisher","DOI":"10.12988\/ijma.2014.44119"},{"key":"S0263574715000168_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-8141(02)00067-6"},{"key":"S0263574715000168_ref18","doi-asserted-by":"publisher","DOI":"10.1049\/el.2010.2844"},{"key":"S0263574715000168_ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.876965"},{"key":"S0263574715000168_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2004.05.007"},{"key":"S0263574715000168_ref11","first-page":"180","article-title":"Merging grid maps via point set registration","volume":"28","author":"Zhu","year":"2013","journal-title":"Int. J. Robot. Autom."},{"key":"S0263574715000168_ref23","doi-asserted-by":"crossref","unstructured":"A. Censi , L. Iocchi and G. Grisetti , \u201cScan Matching in the Hough Domain,\u201d Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), vol. 2 (2005) pp. 2739\u20132744.","DOI":"10.1109\/ROBOT.2005.1570528"},{"key":"S0263574715000168_ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574712000732"},{"key":"S0263574715000168_ref29","unstructured":"Y. Hwang , B. Han and H. K. Ahn , \u201cA Fast Nearest Neighbor Search Algorithm by Nonlinear Embedding,\u201d Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), (2012) pp. 3053\u20133060."},{"key":"S0263574715000168_ref25","first-page":"189","article-title":"OctoMap: A probabilistic, flexible, and compact 3D map representation for robotic systems","volume":"34","author":"Wurm","year":"2013","journal-title":"Auton Robot."},{"key":"S0263574715000168_ref2","volume-title":"Fox, Probabilistic Robotics","author":"Thrun","year":"2005"},{"key":"S0263574715000168_ref22","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"S0263574715000168_ref10","first-page":"1107","article-title":"Divide and Conquer: EKF SLAM in O(n)","volume":"24","author":"Lina","journal-title":"IEEE Trans. Robot."},{"key":"S0263574715000168_ref15","unstructured":"J. M. Phillips , R. Liu and C. Tomasi , \u201cNon-common Area Robust ICP for Minimizing Fractional RMSD,\u201d Proceedings of International Conference on 3-D Digital Imaging and Modeling (3DIM-07), (2007) pp. 427\u2013434."},{"key":"S0263574715000168_ref27","doi-asserted-by":"crossref","unstructured":"M. Greenspan and M. Yurick , \u201cApproximate k-d Tree Search for Efficient ICP,\u201d Proceedings of International Conference on 3-D Digital Imaging and Modeling (3DIM-03), (2003) pp. 442\u2013448.","DOI":"10.1109\/IM.2003.1240280"},{"key":"S0263574715000168_ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2006.1638022"},{"key":"S0263574715000168_ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2004.1371614"},{"key":"S0263574715000168_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2005.07.001"},{"key":"S0263574715000168_ref28","doi-asserted-by":"crossref","unstructured":"A. Nuchter , K. Lingemann and J. Hertzberg , \u201cCached k-d Tree Search for ICP algorithms,\u201d Proceedings of International Conference on 3-D Digital Imaging and Modeling (3DIM-07), (2007) pp. 419\u2013426.","DOI":"10.1109\/3DIM.2007.15"},{"key":"S0263574715000168_ref1","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500404"},{"key":"S0263574715000168_ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364905056348"},{"key":"S0263574715000168_ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2009.2021337"},{"key":"S0263574715000168_ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906065378"},{"key":"S0263574715000168_ref13","doi-asserted-by":"publisher","DOI":"10.1109\/34.121791"},{"key":"S0263574715000168_ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2010.03.007"},{"key":"S0263574715000168_ref16","unstructured":"S. Du , N. Zheng , S. Ying and J. Wei , \u201cICP with Bounded Scale for Registration of mD Point Sets,\u201d Proceedings of the IEEE International Conference on Multimedia and Expo (ICME), (2007) pp. 1291\u20131294."},{"key":"S0263574715000168_ref3","first-page":"254","volume-title":"Robotics Research","author":"Thrun","year":"2005"},{"key":"S0263574715000168_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-008-9097-4"},{"key":"S0263574715000168_ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.876927"},{"key":"S0263574715000168_ref20","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"S0263574715000168_ref32","unstructured":"A. Eliazar and R. Parr , \u201cDP-SLAM,\u201d [Online]. Available at: http:\/\/www.cs.duke.edu\/~parr\/dpslam\/."},{"key":"S0263574715000168_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-0002-3"},{"key":"S0263574715000168_ref19","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ipr.2013.0545"},{"key":"S0263574715000168_ref31","unstructured":"C. Stachniss , \u201cRobotics Datasets,\u201d [Online]. Available at: http:\/\/www.informatik.uni-freiburg.de\/~stachnis\/datasets.html."},{"key":"S0263574715000168_ref33","doi-asserted-by":"publisher","DOI":"10.1017\/S0017089500002135"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574715000168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T21:20:41Z","timestamp":1555622441000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574715000168\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,20]]},"references-count":35,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["S0263574715000168"],"URL":"https:\/\/doi.org\/10.1017\/s0263574715000168","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,20]]}}}