Abstract

Circumvention around an obstacle entails a dynamic interaction with the obstacle to maintain a safe clearance. We used a novel mathematical interpolation method based on the modified Shepard’s method of Inverse Distance Weighting to compute dynamic clearance that reflected this interaction as well as minimal clearance. This proof-of-principle study included seven young healthy, four post-stroke and four healthy age-matched individuals. A virtual environment designed to assess obstacle circumvention was used to administer a locomotor (walking) and a perceptuo-motor (navigation with a joystick) task. In both tasks, participants were asked to navigate towards a target while avoiding collision with a moving obstacle that approached from either head-on, or 30° left or right. Among young individuals, dynamic clearance did not differ significantly between obstacle approach directions in both tasks. Post-stroke individuals maintained larger and smaller dynamic clearance during the locomotor and the perceptuo-motor task respectively as compared to age-matched controls. Dynamic clearance was larger than minimal distance from the obstacle irrespective of the group, task and obstacle approach direction. Also, in contrast to minimal distance, dynamic clearance can respond differently to different avoidance behaviors. Such a measure can be beneficial in contrasting obstacle avoidance behaviors in different populations with mobility problems.

Full Text
Paper version not known

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 call

Disclaimer: 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.