Environment Mapping Algorithm Using Semantic Description and Constrained Delaunay Triangulation

被引:2
|
作者
Figurowski, Daniel [1 ]
Dworak, Pawel [1 ]
机构
[1] West Pomeranian Univ Technol, Fac Elect Engn, Dept Control Engn & Robot, 26 Kwietnia 10, PL-71126 Szczecin, Poland
关键词
Mobile robot; Environment mapping; Semantic segmentation; Computational geometry; NAVIGATION; MAPS;
D O I
10.5755/j01.eie.25.6.24818
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The article discusses the issue of creating an environment's map with semantic division of areas. This simplifies some aspects of mobile robot control and permits the robot to carry out tasks issued in a human-understandable form. The article presents an innovative algorithm for mapping the environment by a mobile robot. Its novelty stems from the use of a semantic description of the world and Delaunay triangulation method with constraints. This description is used to segment the map of the environment and to reduce redundant information. The developed algorithm is based on the idea of extending the borders of the already discovered areas; they are expanded as the new data are collected from the environment. These data contain information about the location of semantic types in the explored space and is used to update the areas during analysis of the environment's map. The before mentioned triangulation method is used in that process. The performance of the proposed algorithm is tested in simulation studies. The obtained results show a good computational efficiency of the method, which is crucial in the problem of environment exploration by mobile robots with limited computational resources.
引用
收藏
页码:4 / 7
页数:4
相关论文
共 50 条
  • [1] Line Recognition Algorithm Using Constrained Delaunay Triangulation
    Naouai, Mohamed
    Narjess, Melki
    Hamouda, Atef
    [J]. PROCEEDINGS ELMAR-2010, 2010, : 51 - 56
  • [2] AN ONLINE ALGORITHM FOR CONSTRAINED DELAUNAY TRIANGULATION
    DEFLORIANI, L
    PUPPO, E
    [J]. CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, 1992, 54 (04): : 290 - 300
  • [3] COMPUTING CONSTRAINED TRIANGULATION AND DELAUNAY TRIANGULATION - A NEW ALGORITHM
    ZHOU, JM
    SHAO, KR
    ZHOU, KD
    ZHAN, QH
    [J]. IEEE TRANSACTIONS ON MAGNETICS, 1990, 26 (02) : 694 - 697
  • [4] Constrained Delaunay triangulation using Delaunay visibility
    Yang, Yi-Jun
    Zhang, Hui
    Yong, Jun-Hai
    Zeng, Wei
    Paul, Jean-Claude
    Sun, Jiaguang
    [J]. ADVANCES IN VISUAL COMPUTING, PT 1, 2006, 4291 : 682 - 691
  • [5] A fast algorithm for constructing constrained Delaunay triangulation
    Nguyen Minh Nam
    Hoang Van Kiem
    Nguyen Vinh Nam
    [J]. 2009 IEEE-RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES: RESEARCH, INNOVATION AND VISION FOR THE FUTURE, 2009, : 11 - +
  • [6] A constrained Delaunay triangulation algorithm based on incremental points
    Wu, Baichao
    Tang, Aiping
    Wang, Lianfa
    [J]. ADVANCES IN CIVIL ENGINEERING, PTS 1-4, 2011, 90-93 : 3277 - 3282
  • [7] Sweep-line algorithm for constrained Delaunay triangulation
    Domiter, V.
    Zalik, B.
    [J]. INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2008, 22 (04) : 449 - 462
  • [8] The employment of regular triangulation for constrained Delaunay triangulation
    Maur, P
    Kolingerová, I
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 3, 2004, 3045 : 198 - 206
  • [9] Local adjustment algorithm for inserting constrained segments in Delaunay triangulation
    Song, Zhan-Feng
    Zhan, Zhen-Yan
    Pu, Hao
    [J]. Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 2002, 37 (04):
  • [10] A New Delaunay Triangulation Algorithm Based on Constrained Maximum Circumscribed Circle
    CAO Ming
    [J]. Wuhan University Journal of Natural Sciences, 2015, 20 (04) : 313 - 317