Space–time prism bounds of activity programs: a goal-directed search in multi-state supernetworks. Issue 5 (4th May 2019)

• Record Type: Journal Article
• Authors: Liao, Feixiong
• Is Part Of: International journal of geographical information science. Volume 33:Issue 5(2019)
• Page Start: 900
• Page End: 921
• Publication Date: 2019-05-04
• Subjects: Space–time prism -- potential path area -- multi-state supernetwork -- goal-directed search; Geography -- Data processing -- Periodicals; Information storage and retrieval systems -- Periodicals; Géomatique -- Périodiques; Systèmes d'information -- Périodiques; 910.285
• DOI: 10.1080/13658816.2018.1563300
• Languages: English
• ISSNs: 1365-8816

Abstract

ABSTRACT: Space–time prism (STP), which envelops the spatial and temporal opportunities for travel and activity participation within a time frame, is a fundamental concept in time geography. Despite many variants, STPs have been mostly modeled for one flexible activity between two anchor points. This study proposes a systemic approach to construct the STP bounds of activity programs that usually include various possible realizations of activity chains. To that effect, multi-state supernetworks are applied to represent the relevant path sets of multi-activity travel patterns. A goal-directed search method in multi-state supernetworks is developed to delineate the potential space–time path areas satisfying the space–time constraints. Particularly, the approximate lower and upper STP bounds are obtained by manipulating the goal-directed search procedure utilizing landmark-based triangular inequalities and spatial characteristics. The suggested approach can in an efficient fashion find the activity state dependent bounds of STP and potential path area. The formalism of goal-directed search through multi-state supernetworks addresses the fundamental shift from constructing STPs for single flexible activities to activity programs of flexible activity chains.