Optimal exploration strategies in haptic search

V. van Polanen, W.M. Bergmann Tiest, N. Creemers, M.J. Verbeek, A.M.L. Kappers

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Abstract

In this study, we have investigated which strategies were optimal in different haptic search tasks, where items were held in the hand. Blindfolded participants had to detect the presence of a target among distractors while using predetermined strategies. The optimal strategy was determined by considering reaction time and error data. In the search for salient targets, a rough sphere among smooth or a cube among spheres, parallel strategies were optimal. With non-salient targets, the results were different. In the search for a sphere among cubes, a parallel strategy was effective, but only if the fingers could be used. In the search for a smooth sphere among rough, only a serial strategy was successful. Thus, the optimal strategy depended on the required perceptual information.
Original languageEnglish
Title of host publicationHaptics: Neuroscience, Devices Modeling, and Applications : 9th International Conference EuroHaptics 2014, Versailles, France, June 24-26, 2015. Proceedings, Part I
Place of PublicationHeidelberg
PublisherSpringer
Pages185-191
Number of pages7
Volume2014
ISBN (Electronic)978-3-662-44193-0
ISBN (Print)978-3-662-44192-3
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event9th International Conference on Haptics: Neuroscience, Devices, Modeling, and Applications (EuroHaptics 2014) - Versailles, France
Duration: 24 Jun 201426 Jun 2014
Conference number: 9
https://eurohaptics2014.limsi.fr/

Publication series

NameLecture Notes in Computer Sience
PublisherSpringer
Volume8618
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Haptics: Neuroscience, Devices, Modeling, and Applications (EuroHaptics 2014)
Abbreviated titleEurohaptics 2014
CountryFrance
CityVersailles
Period24/06/1426/06/14
Internet address

Cite this