Individual Wheelchair Accessible Pathfinding

Abstract

Title: Individual Wheelchair Accessible Pathfinding Author: Roman Sereda Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: Prof. RNDr. Roman Barták, Ph.D., Department of Theoretical Computer Science and Mathematical Logic Abstract: The thesis deals with finding routes satisfying specific criteria and preferences of people using wheelchairs. We formalize the problem, specifically, possible constraints, user profiles and preferences (such as road surface, slope, minimal width and maximal ascent etc.) and then propose a technique to find, compare, and visualize (optimal) routes based on those criteria. The technique is implemented and empirically evaluated. Keywords: Pathfinding, Wheelchair, Maps, Shortest path, Optimal path