WAYFINDING IN URBAN SPACE AS A PROBLEM SOLVING CONCERNING LOSTNESS AND FINDING

Abstract

Protocols taken from the experiments in Shibuya's ground level and Ginza's underground level are analyzed using eight types of codes as follows : view(V), signage(S), guide(G) and memory(M) information; A-plan(Ap) and B-plan(Bp); lostness(?) and finding(!). Two types of protocol sequences, finding(!, [V S G M], Ap) and lostness(?, [V S G M], Bp), are identified. The results show that as a problem solving, wayfinding in above situations has shallow and simple planning process. However, plenty of environmental information can be acquired, and in case of getting lost, "way out" behavior, stated as B-plan, can be executed. Unspoken process is also discussed.