Hierarchical Path Search with Partial Materialization of Costs for a Smart Wheelchair

  • Authors:

  • Daniel Cagigas;Julio Abascal

  • Affiliations:

  • Department of Computer Architecture and Technology, University of Seville, Spain/ e-mail: dcagigas@us.es;Laboratory of Human–/Computer Interaction for Special Needs, University of the Basque Country, Spain/ e-mail: julio@si.ehu.es

  • Venue:
  • Journal of Intelligent and Robotic Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, the off-line path planner module of a smart wheelchair aided navigation system is described. Environmental information is structured into a hierarchical graph (H-graph) and used either by the user interface or the path planner module. This information structure facilitates efficient path search and easier information access and retrieval. Special path planning issues like planning between floors of a building (vertical path planning) are also viewed. The H-graph proposed is modelled by a tree. The hierarchy of abstractions contained in the tree has several levels of detail. Each abstraction level is a graph whose nodes can represent other graphs in a deeper level of the hierarchy. Path planning is performed using a path skeleton which is built from the deepest abstraction levels of the hierarchy to the most upper levels and completed in the last step of the algorithm. In order not to lose accuracy in the path skeleton generation and speed up the search, a set of optimal subpaths are previously stored in some nodes of the H-graph (path costs are partially materialized). Finally, some experimental results are showed and compared to traditional heuristic search algorithms used in robot path planning.