[2] [2] YANG S C, SCHERER S.CubeSLAM:monocular 3-D object SLAM［J］.IEEE Transactions on Robotics, 2019, 35(4):925-938.

[3] [3] DOHERTY K J, BAXTER D P, SCHNEEWEISS E, et al.Probabilistic data association via mixture models for robust semantic SLAM［C］//IEEE International Conference on Robotics and Automation.Paris:IEEE, 2020:1098-1104.

[4] [4] LI F, CHEN W F, XU W F, et al.A mobile robot visual SLAM system with enhanced semantics segmentation［J］.IEEE Access, 2020, 8:25442-25458.

[6] [6] LU S Z, YU H L, WANG X H, et al.Clustering method of raw meal composition based on PCA and Kmeans ［C］//The 37th Chinese Control Conference(CCC).Wuhan: Chinese Association of Automation, 2018:9007-9010.

[7] [7] BOWMAN S L, ATANASOV N, DANIILIDIS K, et al.Probabilistic data association for semantic SLAM ［C］//IEEE International Conference on Robotics and Automation.Singapore:IEEE, 2017:1722-1729.

[8] [8] MU B P, LIU S Y, PAULL L, et al.SLAM with objects using a nonparametric pose graph ［C］//IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).Daejeon:IEEE, 2016:4602-4609.

[9] [9] RAN T, YUAN L, ZHANG J B, et al.Not only look but infer:multiple hypothesis clustering of data association inference for semantic SLAM［J］.IEEE Transactions on Instrumentation and Measurement, 2021, 70:1-9.

[10] [10] ZHANG J B, YUAN L, RAN T, et al.Bayesian nonparametric object association for semantic SLAM ［J］.IEEE Robotics and Automation Letters, 2021, 6(3):5493-5500.

[11] [11] KAESS M, DELLAERT F.A Markov chain Monte Carlo approach to closing the loop in SLAM［C］//IEEE International Conference on Robotics and Automation.Barcelona:IEEE, 2005:643-648.

[12] [12] REDMON J, DIVVALA S, GIRSHICK R, et al.You only look once:unified, real-time object detection ［C］//IEEE Conference on Computer Vision and Pattern Recognition.Las Vegas, NV:IEEE, 2016:779-788.

[13] [13] ZHANG J H, GUI M P, WANG Q C, et al.Hierarchical topic model based object association for semantic SLAM［J］.IEEE Transactions on Visualization and Computer Graphics, 2019, 25(11):3052-3062.