Space–time prism bounds of activity programs: a goal-directed search in multi-state supernetworks

Feixiong Liao (Corresponding author)

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Uittreksel

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.
TaalEngels
Pagina's900-921
Aantal pagina's22
TijdschriftInternational Journal of Geographical Information Science
Volume33
Nummer van het tijdschrift5
DOI's
StatusGepubliceerd - 4 mei 2019

Vingerafdruk

Prisms
Anchors
travel
time
programme
anchor
geography
participation

Trefwoorden

    Citeer dit

    @article{6e9f9253b7854e5492bf2166099def7b,
    title = "Space–time prism bounds of activity programs: a goal-directed search in multi-state supernetworks",
    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.",
    keywords = "goal-directed search, multi-state supernetwork, potential path area, Space–time prism",
    author = "Feixiong Liao",
    year = "2019",
    month = "5",
    day = "4",
    doi = "10.1080/13658816.2018.1563300",
    language = "English",
    volume = "33",
    pages = "900--921",
    journal = "International Journal of Geographical Information Science",
    issn = "1365-8816",
    publisher = "Taylor and Francis Ltd.",
    number = "5",

    }

    Space–time prism bounds of activity programs : a goal-directed search in multi-state supernetworks. / Liao, Feixiong (Corresponding author).

    In: International Journal of Geographical Information Science, Vol. 33, Nr. 5, 04.05.2019, blz. 900-921.

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    TY - JOUR

    T1 - Space–time prism bounds of activity programs

    T2 - International Journal of Geographical Information Science

    AU - Liao,Feixiong

    PY - 2019/5/4

    Y1 - 2019/5/4

    N2 - 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.

    AB - 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.

    KW - goal-directed search

    KW - multi-state supernetwork

    KW - potential path area

    KW - Space–time prism

    UR - http://www.scopus.com/inward/record.url?scp=85059939470&partnerID=8YFLogxK

    U2 - 10.1080/13658816.2018.1563300

    DO - 10.1080/13658816.2018.1563300

    M3 - Article

    VL - 33

    SP - 900

    EP - 921

    JO - International Journal of Geographical Information Science

    JF - International Journal of Geographical Information Science

    SN - 1365-8816

    IS - 5

    ER -