The varieties of student experience - an open research question and some ways to answer it

Based on meetings of the Society for Research into Higher Education’s Student Experience Network over the past three years, the genuinely open research question is posed whether there is one or more undergraduate student experience within English higher education. Answering this question depends on whether what is taught or what is learnt is examined. If the latter, then a unitary student experience can be said to exist only in the narrowest of normative senses. What undergraduates actually learn – defined in the widest sense – is the $64,000 question of research on the student experience. Various ways to answer this question are proposed, including using students to research students. Conceptual tools to apply to findings can be developed from youth studies and cognate disciplines, particularly in relation to student identities and aspirations. Lastly, these proposals are placed in the wider context of comparative models of the varieties of student experience, including those emerging in the UK’s national regions.

Movement of the People

Abstract not available for this paper.

Implementation of cognitive mapping, spatial representation and wayfinding behaviours of people within evacuation modelling tools

Within the building evacuation context, wayfinding describes the process in which an individual located within an arbitrarily complex enclosure attempts to find a path which leads them to relative safety, usually the exterior of the enclosure. Within most evacuation modelling tools, wayfinding is completely ignored; agents are either assigned the shortest distance path or use a potential field to find the shortest path to the exits. In this paper a novel wayfinding technique that attempts to represent the manner in which people wayfind within structures is introduced and demonstrated through two examples. The first step is to encode the spatial information of the enclosure in terms of a graph. The second step is to apply search algorithms to the graph to find possible routes to the destination and assign a cost to the routes based on their personal route preferences such as "least time" or "least distance" or a combination of criteria. The third step is the route execution and refinement. In this step, the agent moves along the chosen route and reassesses the route at regular intervals and may decide to take an alternative path if the agent determines that an alternate route is more favourable e.g. initial path is highly congested or is blocked due to fire.