{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:38:49Z","timestamp":1775695129563,"version":"3.50.1"},"reference-count":38,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T00:00:00Z","timestamp":1649808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Sciences and Engineering Research Council of Canada","award":["CRSNG RDCPJ 518029-18"],"award-info":[{"award-number":["CRSNG RDCPJ 518029-18"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotics"],"abstract":"<jats:p>In a factory with different kinds of spatial atmosphere (warehouses, corridors, small or large workshops with varying sizes of obstacles and distribution patterns), the robot\u2019s generated paths for navigation tasks mainly depend on the representation of that environment. Hence, finding the best representation for each particular environment is necessary to forge a compromise between length, safety, and complexity of path planning. This paper aims to scrutinize the impact of environment model representation on the performance of an automated guided vehicle (AGV). To do so, a multi-objective cost function, considering the length of the path, its complexity, and minimum distance to obstacles, is defined for a perfect circular robot. Unlike other similar studies, three types of representation, namely quadrangle, irregular triangle, and varying-size irregular triangle, are then utilized to model the environment while applying an inflation layer to the discretized view. Finally, a navigation scenario is tested for different cell decomposition methods and an inflation layer size. The obtained results indicate that a nearly constant coarse size triangular mesh is a good candidate for a fixed-size robot in a non-changing environment. Moreover, the varying size of the triangular mesh and grid cell representations are better choices for factories with changing plans and multi-robot sizes due to the effect of the inflation layer. Based on the definition of a metric, which is a criterion for quantifying the performance of path planning on a representation type, constant or variable size triangle shapes are the only and best candidate for discretization in about 59% of industrial environments. In other cases, both cell types, the square and the triangle, can together be the best representation.<\/jats:p>","DOI":"10.3390\/robotics11020050","type":"journal-article","created":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T23:07:16Z","timestamp":1649891236000},"page":"50","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Investigating the Impact of Triangle and Quadrangle Mesh Representations on AGV Path Planning for Various Indoor Environments: With or Without Inflation"],"prefix":"10.3390","volume":"11","author":[{"given":"Ahmadreza","family":"Meysami","sequence":"first","affiliation":[{"name":"Mechanical Engineering Department, Universit\u00e9 du Qu\u00e9bec \u00e0 Trois-Rivi\u00e8res, Trois-Rivieres, QC G8Z 4M3, Canada"}]},{"given":"Jean-Christophe","family":"Cuilli\u00e8re","sequence":"additional","affiliation":[{"name":"Mechanical Engineering Department, Universit\u00e9 du Qu\u00e9bec \u00e0 Trois-Rivi\u00e8res, Trois-Rivieres, QC G8Z 4M3, Canada"}]},{"given":"Vincent","family":"Fran\u00e7ois","sequence":"additional","affiliation":[{"name":"Mechanical Engineering Department, Universit\u00e9 du Qu\u00e9bec \u00e0 Trois-Rivi\u00e8res, Trois-Rivieres, QC G8Z 4M3, Canada"}]},{"given":"Sousso","family":"Kelouwani","sequence":"additional","affiliation":[{"name":"Mechanical Engineering Department, Universit\u00e9 du Qu\u00e9bec \u00e0 Trois-Rivi\u00e8res, Trois-Rivieres, QC G8Z 4M3, Canada"}]}],"member":"1968","published-online":{"date-parts":[[2022,4,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.jmsy.2019.12.002","article-title":"Automated guided vehicle systems, state-of-the-art control algorithms and techniques","volume":"54","author":"Versteyhe","year":"2020","journal-title":"J. Manuf. Syst."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"202312","DOI":"10.1109\/ACCESS.2020.3035729","article-title":"A review of recent advances in automated guided vehicle technologies: Integration challenges and research areas for 5G-based smart manufacturing applications","volume":"8","author":"Oyekanlu","year":"2020","journal-title":"IEEE Access"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Fragapane, G., Ivanov, D., Peron, M., Sgarbossa, F., and Strandhagen, J.O. (2020). Increasing flexibility and productivity in Industry 4.0 production networks with autonomous mobile robots and smart intralogistics. Ann. Oper. Res., 1\u201319.","DOI":"10.1007\/s10479-020-03526-7"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.rcim.2009.10.003","article-title":"Autonomous navigation of an automated guided vehicle in industrial environments","volume":"26","year":"2010","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_5","unstructured":"Eykhoff, P. (1974). System Identification, Wiley."},{"key":"ref_6","first-page":"1","article-title":"Robotic mapping: A survey","volume":"1","author":"Thrun","year":"2002","journal-title":"Explor. Artif. Intell. New Millenn."},{"key":"ref_7","unstructured":"Moravec, H., and Elfes, A. (1985, January 25\u201328). High resolution maps from wide angle sonar. Proceedings of the 1985 IEEE International Conference on Robotics and Automation, St. Louis, MO, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Botsch, M., Kobbelt, L., Pauly, M., Alliez, P., and L\u00e9vy, B. (2010). Polygon Mesh Processing, CRC Press.","DOI":"10.1201\/b10688"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Marton, Z.C., Rusu, R.B., and Beetz, M. (2009, January 12\u201317). On fast surface reconstruction methods for large and noisy point clouds. Proceedings of the 2009 IEEE International Conference on Robotics And Automation, Kobe, Japan.","DOI":"10.1109\/ROBOT.2009.5152628"},{"key":"ref_10","unstructured":"Latombe, J.-C. (2012). Robot Motion Planning, Springer Science & Business Media."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/100.486659","article-title":"Path planning with multiple objectives","volume":"3","author":"Fujimura","year":"1996","journal-title":"IEEE Robot. Autom. Mag."},{"key":"ref_12","first-page":"90","article-title":"Steps towards the automatic evaluation of robot obstacle avoidance algorithms","volume":"Volume 88","author":"Minguez","year":"2006","journal-title":"Proc. of Workshop of Benchmarking in Robotics, in the IEEE\/RSJ Int. Conf. on Intelligent Robots and Systems (IROS)"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1007\/s10846-016-0362-z","article-title":"A review of global path planning methods for occupancy grid maps regardless of obstacle density","volume":"84","author":"Tsardoulias","year":"2016","journal-title":"J. Intell. Robot. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Plaku, E., Kavraki, L.E., and Vardi, M.Y. (2008, January 19\u201323). Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning. Proceedings of the 2008 IEEE International Conference on Robotics and Automation, Pasadena, CA, USA.","DOI":"10.1109\/ROBOT.2008.4543786"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Aggarwal, R., and Kumar, M. (2020). Chance-Constrained Approach to Optimal Path Planning for Urban UAS. AIAA Scitech 2020 Forum, American Institute of Aeronautics and Astronautics, Inc.","DOI":"10.2514\/6.2020-0857"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2658","DOI":"10.1007\/s12555-019-0396-z","article-title":"Robotic Path Planning Based on a Triangular Mesh Map","volume":"18","author":"Liu","year":"2020","journal-title":"Int. J. Control. Autom. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.cag.2020.06.006","article-title":"Comparing navigation meshes: Theoretical analysis and practical metrics","volume":"91","author":"Triesscheijn","year":"2020","journal-title":"Comput. Graph."},{"key":"ref_18","unstructured":"Kallmann, M. (2010). Shortest Paths with Arbitrary Clearance from Navigation Meshes. Symposium on Computer Animation, Eurographics Association."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Oliva, R., and Pelechano, N. (2013). A generalized exact arbitrary clearance technique for navigation meshes. Proceedings of Motion on Games, Association for Computing Machinery.","DOI":"10.1145\/2522628.2522900"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es, R.L., de Oliveira, A.S., Fabro, J.A., Becker, T., and Brenner, V.A. (2016). ROS navigation: Concepts and tutorial. Robot Operating System (ROS), Springer.","DOI":"10.1007\/978-3-319-26054-9_6"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Fernandes, E., Costa, P., Lima, J., and Veiga, G. (2015, January 17\u201319). Towards an orientation enhanced astar algorithm for robotic navigation. Proceedings of the 2015 IEEE International Conference on Industrial Technology (ICIT), Seville, Spain.","DOI":"10.1109\/ICIT.2015.7125590"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1080\/16864360.2014.902677","article-title":"Integration of CAD, FEA and topology optimization through a unified topological model","volume":"11","author":"Francois","year":"2014","journal-title":"Comput.-Aided Des. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.asoc.2004.04.003","article-title":"Curve and surface reconstruction from points: An approach based on self-organizing maps","volume":"5","author":"Kumar","year":"2004","journal-title":"Appl. Soft Comput."},{"key":"ref_24","first-page":"49","article-title":"On the linear weighted sum method for multi-objective optimization","volume":"26","author":"Stanimirovic","year":"2011","journal-title":"Facta Acta Univ."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Ravankar, A., Ravankar, A.A., Kobayashi, Y., Hoshino, Y., and Peng, C.-C. (2018). Path smoothing techniques in robot navigation: State-of-the-art, current and future challenges. Sensors, 18.","DOI":"10.3390\/s18093170"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.procs.2018.01.113","article-title":"Genetic algorithm based approach for autonomous mobile robot path planning","volume":"127","author":"Lamini","year":"2018","journal-title":"Procedia Comput. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Rekleitis, I., Bedwani, J.-L., and Dupuis, E. (2009, January 12\u201317). Autonomous planetary exploration using LIDAR data. Proceedings of the 2009 IEEE International Conference on Robotics and Automation, Kobe, Japan.","DOI":"10.1109\/ROBOT.2009.5152504"},{"key":"ref_28","unstructured":"Kallmann, M. (2005, January 31). Path planning in triangulations. Proceedings of the IJCAI Workshop on Reasoning, Representation, and Learning in Computer Games, Edinburgh, Scotland."},{"key":"ref_29","unstructured":"Mark, d.B., Otfried, C., Marc, v.K., and Mark, O. (2008). Computational Geometry Algorithms and Applications, Spinger."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_31","unstructured":"Liu, X., and Gong, D. (2011, January 15\u201317). A comparative study of A-star algorithms for search and rescue in perfect maze. Proceedings of the 2011 International Conference on Electric Information and Control Engineering, Wuhan, China."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1322432.1322434","article-title":"2D Euclidean distance transform algorithms: A comparative survey","volume":"40","author":"Fabbri","year":"2008","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1016\/j.robot.2012.08.010","article-title":"Efficient grid-based spatial representations for robot navigation in dynamic environments","volume":"61","author":"Lau","year":"2013","journal-title":"Robot. Auton. Syst."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0010-4485(97)00085-7","article-title":"An adaptive method for the automatic triangulation of 3D parametric surfaces","volume":"30","year":"1998","journal-title":"Comput.-Aided Des."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0010-4485(00)00028-2","article-title":"3D automatic remeshing applied to model modification","volume":"32","author":"Cuilliere","year":"2000","journal-title":"Comput.-Aided Des."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.cad.2016.03.004","article-title":"A new approach to automatic and a priori mesh adaptation around circular holes for finite element analysis","volume":"77","author":"Lacroix","year":"2016","journal-title":"Comput.-Aided Des."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/S0965-9978(00)00057-0","article-title":"Automatic mesh pre-optimization based on the geometric discretization error","volume":"31","year":"2000","journal-title":"Adv. Eng. Softw."},{"key":"ref_38","unstructured":"Clearpath Robotics Inc. (2022, April 09). Turtlebot-2-Open-Source-Robot. Available online: https:\/\/clearpathrobotics.com\/turtlebot-2-open-source-robot\/."}],"container-title":["Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2218-6581\/11\/2\/50\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:53:20Z","timestamp":1760136800000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2218-6581\/11\/2\/50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,13]]},"references-count":38,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,4]]}},"alternative-id":["robotics11020050"],"URL":"https:\/\/doi.org\/10.3390\/robotics11020050","relation":{},"ISSN":["2218-6581"],"issn-type":[{"value":"2218-6581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,13]]}}}