Abstract
Proposed in the 1980s, the sparse distributed memory (SDM) is a model of an associative memory based on the properties of a high dimensional binary space. This model has received some attention from researchers of different areas and has been improved over time. However, a few problems have to be solved when using it in practice, due to the non-randomness characteristics of the actual data. We tested an SDM using different forms of encoding the information, and in two different domains: robot navigation and manipulation. Our results show that the performance of the SDM in the two domains is affected by the way the information is actually encoded, and may be improved by some small changes in the model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
