HEURISTIC WAYFINDING FOR NONMOTORIZED TRANSPORT

Heuristic processes are described for finding the shortest path by looking at maps and sketches representing transportation networks drawn true to scale and not to scale. Nine experiments were conducted and the results were compared with those derived from Moore's algorithm. Fifty subjects in each experiment were given a fixed amount of time to find the shortest path. The majority of subjects used two mental processes to demarcate the shortest path. Two of the nine experiments required finding the safest path through a network. All experiments support the general belief that most people are able to choose the shortest or the safest path with some degree of accuracy. The results of these experiments and the interviews with the subjects indicate that good maps and sketches are important for steering people in wayfinding, particularly those using nonmotorized transportation.

Language

  • English

Media Info

  • Features: Figures; References; Tables;
  • Pagination: p. 1-4
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00781567
  • Record Type: Publication
  • ISBN: 0309071186
  • Files: TRIS, TRB, ATRI
  • Created Date: Feb 1 2000 12:00AM