Topological mapping using vision and a sparse distributed memory

被引:0
|
作者
Mendes M. [1 ]
Coimbra A.P. [2 ]
Crisóstomo M.M. [2 ]
机构
[1] ESTGOH, Polytechnic Institute of Coimbra, Oliveira do Hospital 3400-124, R. General Santos Costa
[2] Institute of Systems and Robotics, Pólo II, University of Coimbra
来源
关键词
Path planning; Robot navigation; SDM; Sparse distributed memory;
D O I
10.1007/978-94-007-1192-1_23
中图分类号
学科分类号
摘要
Navigation based on visual memories is very common among humans. However, planning long trips requires a more sophisticated representation of the environment, such as a topological map, where connections between paths are easily noted. The present approach is a system that learns paths by storing sequences of images and image information in a sparse distributed memory (SDM). Connections between paths are detected by exploring similarities in the images, using the same SDM, and a topological representation of the paths is created. The robot is then able to plan paths and switch from one path to another at the connection points. The system was tested under reconstitutions of country and urban environments, and it was able to successfully map, plan paths and navigate autonomously. © 2011 Springer Science+Business Media B.V.
引用
收藏
页码:273 / 284
页数:11
相关论文
共 50 条
  • [41] Distributed-Memory Sparse Kernels for Machine Learning
    Bharadwaj, Vivek
    Buluc, Aydin
    Demmel, James
    2022 IEEE 36TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2022), 2022, : 47 - 58
  • [42] Increasing the Semantic Storage Density of Sparse Distributed Memory
    Vdovychenko, R.
    Tulchinsky, V
    CYBERNETICS AND SYSTEMS ANALYSIS, 2022, 58 (03) : 331 - 342
  • [44] PARALLEL TRIANGULARIZATION OF SPARSE MATRICES ON DISTRIBUTED MEMORY MULTIPROCESSORS
    DUATO, J
    PONS, J
    HYPERCUBE AND DISTRIBUTED COMPUTERS, 1989, : 133 - 146
  • [45] DISTRIBUTED-MEMORY COMPILER DESIGN FOR SPARSE PROBLEMS
    WU, J
    DAS, R
    SALTZ, J
    BERRYMAN, H
    HIRANANDANI, S
    IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (06) : 737 - 753
  • [46] Solving sparse triangular systems on distributed memory multicomputers
    Gonzalez, P
    Cabaleiro, JC
    Pena, TF
    PROCEEDINGS OF THE SIXTH EUROMICRO WORKSHOP ON PARALLEL AND DISTRIBUTED PROCESSING - PDP '98, 1998, : 470 - 478
  • [47] Investigating the sparse simplex algorithm on a distributed memory multiprocessor
    Maros, I
    Mitra, G
    PARALLEL COMPUTING, 2000, 26 (01) : 151 - 170
  • [48] Binding of Sparse Distributed Representations in Hierarchical Temporal Memory
    Boudreau, Luke
    Kudithipudi, Dhireesha
    PROCEEDINGS OF THE 2019 7TH ANNUAL NEURO-INSPIRED COMPUTATIONAL ELEMENTS WORKSHOP (NICE 2019), 2020,
  • [49] Increasing the Semantic Storage Density of Sparse Distributed Memory
    R. Vdovychenko
    V. Tulchinsky
    Cybernetics and Systems Analysis, 2022, 58 : 331 - 342
  • [50] A new approach to Kanerva's sparse distributed memory
    Hely, TA
    Willshaw, DJ
    Hayes, GM
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 1997, 8 (03): : 791 - 794