SlideShare a Scribd company logo
1 of 33
Incorporating context-dependent energy
into the pedestrian dynamic scheduling model
with GPS data
Yuki Oyama* and Eiji Hato
* JSPS Researcher / The University of Tokyo
oyama@bin.t.u-tokyo.ac.jp
Behavior in Networks Studies Unit	
14th International Conference on Travel Behaviour Research, Windsor.
Wed. 22 July. Paper: 187, Parallel Session H-2, Hanover 2.
Table of Contents
1.  Introduction :
–  City Center Sojourn of pedestrians
2.  Modeling :
–  Pedestrian dynamic scheduling model
–  Context-dependent energy
3.  Data Processing :
–  Probe Person data with GPS technologies
–  Detection of pedestrian activity paths
4.  Case study :
–  Model Estimation and Results
5.  Conclusions
1
Part 1	
Part 2	
Part 3
Part 1: Modeling Framework
1.  Introduction :
–  City Center Sojourn of pedestrians
2.  Modeling :
–  Pedestrian dynamic scheduling model
–  Context-dependent energy
3.  Data Processing :
–  Probe Person data with GPS technologies
–  Detection of pedestrian activity paths
4.  Case study :
–  Model Estimation and Results
5.  Conclusions
*
Part 1
Target | City Center Sojourn
•  City Center Sojourn refers to pedestrian scheduling behavior in
city centers, which includes a sequence of moving (travel) and
staying (activity) decisions.	
Time	
Space	
Entry	
Exit	
Sojourn
time	
2
(About 1 km square)
Target | Pedestrian scheduling
•  Spatial attributes (stumbling on an attractive shop,… )
•  Activity history (finding next shop for goods she wants, …)
•  Social interaction (a friend says he wants to drop in a café,…) …
3
Activities can be generated (walking) context-dependently	
Pattern is not alternative but
result of dynamic scheduling
process
e.g.; Habib (2011)	
Activities (staying) do not
always decided to conduct
before travels (moving)
Review | Scheduling models 4
Space
Time
t=1
t=2
t=3
A B
C
T : Time budget
t1
t2
Space
A B
C t1
t2
Space
Time
A B
C
1. Markov chain	
pt (i, j) tk
k=1
K
∑ = T maxU
2. Time allocation	
 3. Utility maximization	
Bowman and Ben-Akiva (2001),
Recker (1995)
Lerman (1979),
Borgers and Timmermans (1986)	
Bhat et al. (2005),
Fukuyama and Hato (2013)	
× random ordered	
△ semi-separated	
× independent	
( pre-trip )	
◯ ordered	
◯ linked	
× independent	
( pre-trip )	
◯ ordered	
× separated	
◯ context-dependent	
( but only at the time )
Model | Dynamic scheduling model 5
Activity = Time allocation behavior to a certain ’space’	
-  Moving : duration time choice in a certain ’link’
-  Staying : duration time choice in a certain ’node’ 	
Dynamic scheduling model in space
1. Activity generation model
Continue or Finish activities ?
2. Time allocation model
Duration time choice in the space
*‘Continue’ means moving next space
*‘Finish’ means moving out of district
Space
Time
link1 link2 link3
link4
link5
node5
Finish Continue
tl2
tl3
tl4
tl5
tl1
tn5
max uk (tk )
What this decision is based on?
l ∈ S
n ∈ S
6
Is it enough with only time constraints ?	
0 50 100 150 200 250 300 350 400 450 500
0
50
100
150
200
250
300
350
Sojourn time of tour (min.)
tourID
ID: 220 (67.3%)
484.3min
(max.)
•  Non-mandatory tour (shopping,
eating, recreational, other activities
are included).
•  Sojourn time (cumulative duration)
is continuously distributed.
•  We cannot explain the sojourn
time differences among tours by
only time constraint.
Model | Activity generation model
Psychological (personal) concept as resource 	
We have to consider: 	
tk
k=1
K
∑
Model | Activity generation model 7
- Need	
- Satisfaction	
- Satiation	
(Maslow, 1943; Arentze and Timmermans, 2004; Nijland et al., 2013)	
(Pattabhiraman et al., 2013)	
(MacAlister, 1982; Bhat et al., 2005)	
•  All of activities in a tour have ‘energy’ in common.
•  Energy decreases by engaging activities, and can increase based on context.
need
0
day
und
0
need = f (t)
Psychological mechanisms in behavior modeling	
utility
0
time
u(t) = t
- For a particular activity
- Monotonicity	
‘Energy’ : personal resource for engaging in activities.
Key Idea | Context-dependent energy 8
Consumption : ec
(n)
Ec
(n)
= ec (t(k)
, x(k)
)
k=1
n
∑
52%	
Accumulated decrease by
engaging in activities
•  An individual continues activities as long as she has energy remaining.
•  There can be ‘energy gain’ by activity results or spatial attributes.
Remaining : E(n)
Motivation for continuing
activities in city centers
Ei,d
Initial stock :
A certain level which she
plans to achieve
Key Idea | Context-dependent energy 8
Consumption : ec
(n)
Ec
(n)
= ec (t(k)
, x(k)
)
k=1
n
∑
52%	
Accumulated decrease by
engaging in activities
•  An individual continues activities as long as she has energy remaining.
•  There can be ‘energy gain’ by activity results or spatial attributes.
Remaining : E(n)
Motivation for continuing
activities in city centers
Stumbling on
an attractive
shop.
74%	
Ei,d
Initial stock :
A certain level which she
plans to achieve
Gain (or Loss) :
Variation based on
behavioral context
eg
(n)
0%	
: Finish the sojournE(n)
= 0
P
N
50m
n = 1stay :
n = 2stay :
- decide to back home
stopped activity place
alternatives
start
finish :
move
move
Key Idea | Context-dependent energy 9
E(n+1)
= Ei,d − Ec
(n)
+ Eg
(n+1)
(1)
finish
energyforactivity
( )
0
time
move movestaystay
n = 1
n = 2
E
= NE
Context-dependent energy :
- An example of a sojourn tour
Energy consumption by
engaging in an activity
Context-dependent
energy gain
•  An individual continues activities as long as she has energy remaining.
•  There can be ‘energy gain’ by activity results or spatial attributes.
Remaining energy stock :
Activity duration choice :
n = 0
Step1: Initialization
Step2: Conducting an activity
Step3: Preparation for next activity
n := n + 1
Calculating energy consumption :
Context-dependent energy gain (or loss) :
No
Yes
Step4: Update of stock
Step5:
Step6: Finish district sojourn
t(n)
E(n)
> 0
E(n)
= E
eg (c(n)
)
ec (t(n)
)
Update of stock : ec (t(n)
)
E(n)
E(n)
= + eg (c(n)
)
E(n)
= E(n)
Model | Activity generation model 10
E(n+1)
= Ei,d − Ec
(n)
+ Eg
(n+1)
Ec
(n)
= ec (t(k)
, x(k)
)
k=1
n
∑
Eg
(n)
= γkiIki
i
∑ + δnjsnj
j
∑
k=1
n
∑
(1)
(2)
(3)
Remaining energy :
Energy consumption :
Energy gain (or loss) :
Ini
snj
: Activity history variables
: Spatial attributes variables
Model | Pedestrian scheduling model 11
(1)'
If energy is greater than zero, the sojourn will be continued, otherwise finished.
E(n)
= Ei,d − Ec
(n−1)
+ Eg
(n)
+ε
Time allocation model	
 (Habib, 2011)	
max U(tk ) =
1
αk
exp ψkzk +ε'k( ) tk
αk
−1( )
k=1
2
∑
αk :satiation parameter ( < 1)
ε'k :random error term (i.i.d. gumbel distribution)
zk :vector of variables ψk :vector of weights
t1 +t2 = Ts.t.,
*k=1: next activity, k=2: composite activities
Activity generation model	
ε :random error term (i.i.d. gumbel distribution)
Pr(continue) = Pr(E(n)
> 0)
(4)
(5)
Model | Pedestrian scheduling model 12
Joint probability :
Pr(continue ∩Time = tk )
×Φ
Jd (ε)− ρJc (ε'k )
1− ρ2
$
%
&
&
'
(
)
)
(6)
MLE (Maximum Likelihood Estimates)
(7)
=
1−α1
tk
+
1−α2
T −tk
"
#
$
%
&
'⋅
1
σ
exp
−(V '2 −V '1)
σ
"
#
$
%
&
'⋅ 1+exp
−(V '2 −V '1)
σ
"
#
$
%
&
'
)
*
+
,
-
.
−2
L = Pri
(continue ∩Time = tk )( )
δic
k=1
n
∏
"
#
$
%
&
'
i=1
I
∏
V 'k =ψkzk +(αk −1)ln tk( )
where,
J(ε) : the inverse of CDF of standard normal distribution (Lee, 1983)
Habib(2011)*
*Khandker M. Nurul Habib (2011). A random utility maximization (RUM) based dynamic activity scheduling model:
Application in weekend activity scheduling, Transportation, Vol.38, pp.123-151.
Part 2 : Data processing
1.  Introduction :
–  City Center Sojourn of pedestrians
2.  Modeling :
–  Pedestrian dynamic scheduling model
–  Context-dependent energy
3.  Data Processing :
–  Probe Person data with GPS technologies
–  Detection of pedestrian activity paths
4.  Case study :
–  Model Estimation and Results
5.  Conclusions
*
Part 2
Data | Probe Person survey 13
Methods :
GPS (automatic)
+ Web diary
•  Latitude / Longitude (a coordinate)
•  Timestamp (at the interval of 5~30 s)
•  Trip purpose
•  Transportation mode
+ personal information
ˆm = ( ˆx, ˆt )
a = (x,t−
,t+
)
ˆmji
d = ( ˆxji
d , ˆtji
d )
ari
d = (x,t−
,t+
)
Personal day-to-day data
Measurements :
Reported activity episodes :
( ji
d
=1,..., Ji
d
)
(ri
d
=1,..., Ri
d
)
i : an individual, d : a daywhere,
Data | Probe Person survey 14
Sequential activity (moving and staying) data :
S
S
2
2 2 3 3 4 4
1
11
E
E
1st & 2nd trip Final trip3rd & 4th trip
time12:32:24 12:39:07 12:48:33
reported
(shopping)
inferred
as stay
reported
(shopping)
13:39:24 13:44:05 14:18:29 14:31:12 14:43:13 14:48:51
2 3
4 4
N
150m
reported
(eating)
•  Not only staying, moving activities are also observed sequentially.
•  Day-to-day data of the same person is collected.
a1:Mi
d = (a1,...,ami
d ,...,aMi
d ),
s = {n,l} ∈ S : a space
ami
d = (s(x),t−
,t+
)
Using PP data, we get ‘real’ activity sequence with spaces
Data | Probe Person survey 15
Reported path (  ) :
Time
Space
ˆm1
ˆm2
ˆm10
ˆm11
ˆm19
ˆm20
ˆm30
ˆm38
a1
r
x1
r
x
t
= ˆmJi
d
ˆmji
d = ( ˆxji
d , ˆtji
d )
ari
d = (x,t−
,t+
)
•  There can be dropped (non-
reported) staying activity.
•  Measurements have not
connected with ‘space’ yet.
(and it has measurement error)
1.  Label measurements (‘moving’ or ‘staying’)
2.  Connect measurements with ‘space’ (node / link)
We need to
Data | Detection of activity paths 16
Step1: Classification of moving or staying
Labeling
: ‘move’
Step1-1: Comparison travel time
Step1-2: i = 1
i = J
i =: i+1
p =: p+1
Yes
No
k =: k+1
Step1-3: j = i~p
and
and
No
Yes
No
No
(ttk,k+1 ttk,k+1
min
) > Tmin
ˆm1:J
k,k+1
Labeling
: ‘stay’
Yes
ˆmi
k,k+1
Labeling
: ‘move’ˆmi
k,k+1
Labeling
: ‘stay’
Yes
ˆmi:p
k,k+1
ˆti+1
ˆti > Tmin
d( ˆxi, ˆxi+1) / (ˆti+1
ˆti ) < vmin
ˆti
ˆtp > Tmin
d( ˆx j [i,p],g) < r
ttk,k+1 = tk+1
−
−tk
+
ttk,k+1
min
= d(xk, xk+1) / vw
: Reported travel time
: Shortest path travel time
gi:p =
1
p−i+1
( ˆxjlat
j=i
p
∑ , ˆxjlon
j=i
p
∑ )
Centroid of ˆmi:p
k,k+1
*Tmin =180s, vw =1.4m / s, r = 50m
(8)
(9)
Time
Space
ˆm1
ˆm2
ˆm10
ˆm11
ˆm19
ˆm20
ˆm30
ˆm38
a1
r
x1
r
x
t
= ˆmJi
d
a1
e
Time
Space
ˆm1
ˆm2
ˆm10
ˆm11
ˆm19
ˆm20
ˆm30
ˆm38
a1
r
x1
r
x
t
= ˆmJi
d
Data | Detection of activity paths 17
Step1: Classification of moving or staying
× ×ˆmji
d = ( ˆxji
d , ˆtji
d ,'move') ˆmji
d = ( ˆxji
d , ˆtji
d ,'stay')
Next: Connect activities with ‘space’ (move - link / stay - node)
Data | Detection of activity paths 18
Step2: Estimation of activity space for ‘stay’ data
Step2-1: Candidate set generation
UN = {n :n ∈ S}
Vin = βnj Xnj
j
∑ + w1 fni + w2 fn
fni = δk,n
i,d
k
∑
d
∑ ,
Universal set:
Space frequency score from day-to-day data:
CiN ⊂ UN
fn = δk,n
i,d
k
∑
d
∑
i
∑
Importance Sampling using MCMC method
ri = Pi / Pj = exp(Vin ) / exp(Vjn ),
: 1 if individual i stay n for activity k on day d, otherwise 0.δk,n
i,d
Finally we get a subset:
Adoption rate of i :
(10)
(11)
Data | Detection of activity paths 19
Step2: Estimation of activity space for ‘stay’ data
Step2-2: Probability calculation
Pi (n) = exp(Vin ) / exp(Vim )
m∈CiN
∑Prior probability:
Measurement probability:
P( ˆmp:q | n) = P( ˆxp:q | xn ) = Πj=p
q
P( ˆxj | xn )
P( ˆxj | xn ) =
1
2πσ
exp −
( ˆxj − xn )2
2σ 2
"
#
$$
%
&
''
P(n | ˆmp:q ) = a⋅ P( ˆmp:q | n)⋅ Pi (n)
Probability of space n for ‘stay’ measurement set   :ˆmp:q
* We assume that measurement error is only localization σ
(12)
(13)
(14)
e.g.; Danalet et al. (2014)
Data | Detection of activity paths 20
Detected activity path:
Space
Time
Step2: Estimation of ‘stay’ space
ˆm = ( ˆx, ˆt,'stay')
Space
Time
link1 link2 link3
link4
link5
node5tl2
tl3
tl4
tl5
tl1
tn5
a1
a2
a3
a4
a5
a6
Activity sequence with space
a1:Mi
d = (a1,...,ami
d ,...,aMi
d )
a = (n,t−
,t+
)
Lon.
Lat.
Step3: Estimation of ‘move’ space
ˆm = ( ˆx, ˆt,'move')
(Map-matching)
a = (l,t−
,t+
)
Part 3 : Case study in Matsuyama city
1.  Introduction :
–  City Center Sojourn of pedestrians
2.  Modeling :
–  Pedestrian dynamic scheduling model
–  Context-dependent energy
3.  Data Processing :
–  Probe Person data with GPS technologies
–  Detection of pedestrian activity paths
4.  Case study :
–  Model Estimation and Results
5.  Conclusions
*
Part 3
Case study | City center of Matsuyama 21
Ehime, Japan
Tokyo
Matsuyama city
Korea
D.P.R. Korea
China
Russia
N
200km
Matsuyama city :
•  Ehime prefecture, Shikoku
region
•  Population: 516,637
(December 1, 2010)
•  Area: 428.86 sq. km
•  Density: 1,204.68/sq. km
Data
City hall
Department
store
Department
store
MallStation
Yokogawara line
Ishite river
Mall
Tram
Museum
Library
Prefectural office
Matsuyama
castle
Park
Case study | City center of Matsuyama 22
•  2 department stores / 2 malls
•  Various retails and
restaurants are located
around the streets.
About 1.5 km square
City center of Matsuyama :
Case study | PP survey in Matsuyama 23
Survey Period Weeks No. of monitors Data (trip)
CityCenterPP2007 2007/02/19~2007/03/22 4 84 7,810
PP survey 2007A 2007/10/29~2008/01/21 12 508 17,697
PP survey 2007B 2007/10/29~2008/01/21 12 205 14,706
Bike sharing PP 2009/02/21~2009/03/07 2 15 668
Elderly PP 2010 2010/11/18~2011/01/31 12 30 1.380
Total 42 842 42,261
-> 414 sojourn tours (non-mandatory) were observed
Data collection :
Case study | PP survey in Matsuyama 24
Activity generation:
Reported : Total (report + estimates):
Estimation | Variables 25
variable Explanation Mean Min. Max.
【Initial stock :  】
Female dummy - - 0 1
Elderly dummy Age: over 60 - 0 1
Car inflow dummy Entry by car - 0 1
EP-Main distance Distance between EP and Main of the tour (m) 281.9 0 1138
【Consumption:    】
Spent time Elapsed time since entry (min./10) 114.74 3.20 484
Walking distance
【Activity history : 】
Cumulative trips Number of cumulative trips 1.7 1 12
Cumulative shopping trips - 0.79 0 9
Cumulative recreational trips - 0.17 0 5
Previous trip : eating 1 if previous trip purpose is eating, otherwise 0 - 0 1
Previous trip : shopping - - 0 1
Previous trip : Main - - 0 1
Previous activity duration Duration of previous activity (min.) 81.11 2.32 484
【Spatial attributes :  】
EP-distance Distance from Entry point (m) 200.35 0 1138
Shopping street 1 if decision making at shopping street,
otherwise 0
- 0 1
Department store 1 if decision making at department store,
otherwise 0
- 0 1
E(n+1)
= E + βc ec (t, x)
k=1
n
∑ + γkiIki
i
∑ + δn+1, jsn+1, j
j
∑
k=1
n+1
∑
Remaining energy
(1)
E = αk xk
k
∑Initial stock (8)
U(tk ) =
1
αk
exp ψkzk +ε'k( ) tk
αk
−1( ) (9)Duration
x
t,x
I
s
・Female has larger initial energy
・Elderly’s is limited
・Dist. between Entry point and
Main facility indicates positive
・Spent time and walking
distance decrease energy
・Energy gain by eating trip
・If main activity is conducted,
sojourn tour will be likely to finish
and next trip will be short.
・Shopping street motivates the
next activity
Energy gain
Energy loss
Initial stock
Energy consumption
Energy gain (context-dependent)
Activity duration
Estimation | Results 26
Variable Parameter t-value
Discrete choice
α1 Constant -0.382 -0.63
α2 Female dummy 0.560 1.88*
α3 Elderly dummy -0.931 -1.95*
α4 Log(EP-Main dist.(km) + 1) 0.369 5.12**
α5 Car inflow dummy -0.356 -1.30
βtime1 Basic parameter of time (min./10) -0.011 -3.23**
βtime2 A Number of trips 0.002 1.14
βtime3 Shopping dummy -0.014 -2.70**
βwalk Cumulative walking dist. (m/100) 2.985 3.77**
βwalk2 (Cumulative walking dist.)^2 -1.673 -3.66**
γ1 Cumulative trips -0.773 -3.86**
γ2 Cumulative shopping trips 0.689 3.32**
γ4 Previous activity : eating 0.922 2.58**
γ5 Previous activity : Main -1.285 -4.25**
γ6 Shopping street 0.625 1.87
Continuous choice
βtime1 Constant 6.004 2.87**
βtime2 Previous activity time (min./10) 0.017 4.67**
βtime3 Previous activity: shopping -0.705 -2.49*
βtime4 Previous activity: Main -1.304 -3.35**
βtime5 Log(EP-dist. (km)) -0.151 -3.38**
Log(σ) Std. deviation of error term 1.000 -
ρ Correlation 0.665 2.27*
αj Satiation Parameter of activity j -0.773 -7.85**
αc Satiation Parameter of activity c 0.880 0.83
Observations 482
Initial Likelihood -1173.584
Final Likelihood -935.792
Rho square (adj.) 0.183
Conclusions 27
•  To capture context-dependent activity generation and
scheduling process in pedestrian behavior,
•  we incorporated “energy” into the scheduling model and
described a sequential time-allocation behavior to
spaces.
•  And using PP data, we detected activity paths with space.
•  As a result, it was clarified that the energy consumption and gain
process are dependent on some behavioral and spatial
context variables.
Thank you for your attentions!!
Questions?	
Contact: oyama@bin.t.u-tokyo.ac.jp 	
or oymyk.dom@gmail.com

More Related Content

What's hot

Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)STAIR Lab, Chiba Institute of Technology
 
Bayesian Dark Knowledge and Matrix Factorization
Bayesian Dark Knowledge and Matrix FactorizationBayesian Dark Knowledge and Matrix Factorization
Bayesian Dark Knowledge and Matrix FactorizationPreferred Networks
 
Some Developments in Space-Time Modelling with GIS Tao Cheng – University Col...
Some Developments in Space-Time Modelling with GIS Tao Cheng – University Col...Some Developments in Space-Time Modelling with GIS Tao Cheng – University Col...
Some Developments in Space-Time Modelling with GIS Tao Cheng – University Col...Beniamino Murgante
 
New Mathematical Tools for the Financial Sector
New Mathematical Tools for the Financial SectorNew Mathematical Tools for the Financial Sector
New Mathematical Tools for the Financial SectorSSA KPI
 
Unbiased Markov chain Monte Carlo
Unbiased Markov chain Monte CarloUnbiased Markov chain Monte Carlo
Unbiased Markov chain Monte CarloJeremyHeng10
 
ML Reading Group (Intro to Quantum Computation)
ML Reading Group (Intro to Quantum Computation)ML Reading Group (Intro to Quantum Computation)
ML Reading Group (Intro to Quantum Computation)Antonin Hoskovec
 
A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTION
A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTIONA COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTION
A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTIONijsc
 
SIAM-AG21-Topological Persistence Machine of Phase Transition
SIAM-AG21-Topological Persistence Machine of Phase TransitionSIAM-AG21-Topological Persistence Machine of Phase Transition
SIAM-AG21-Topological Persistence Machine of Phase TransitionHa Phuong
 
Information-theoretic clustering with applications
Information-theoretic clustering  with applicationsInformation-theoretic clustering  with applications
Information-theoretic clustering with applicationsFrank Nielsen
 
SIAM - Minisymposium on Guaranteed numerical algorithms
SIAM - Minisymposium on Guaranteed numerical algorithmsSIAM - Minisymposium on Guaranteed numerical algorithms
SIAM - Minisymposium on Guaranteed numerical algorithmsJagadeeswaran Rathinavel
 
Binary Vector Reconstruction via Discreteness-Aware Approximate Message Passing
Binary Vector Reconstruction via Discreteness-Aware Approximate Message PassingBinary Vector Reconstruction via Discreteness-Aware Approximate Message Passing
Binary Vector Reconstruction via Discreteness-Aware Approximate Message PassingRyo Hayakawa
 
Applied Machine Learning For Search Engine Relevance
Applied Machine Learning For Search Engine Relevance Applied Machine Learning For Search Engine Relevance
Applied Machine Learning For Search Engine Relevance charlesmartin14
 
Reading papers - survey on Non-Convex Optimization
Reading papers - survey on Non-Convex OptimizationReading papers - survey on Non-Convex Optimization
Reading papers - survey on Non-Convex OptimizationX 37
 

What's hot (20)

Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
 
Bayesian Dark Knowledge and Matrix Factorization
Bayesian Dark Knowledge and Matrix FactorizationBayesian Dark Knowledge and Matrix Factorization
Bayesian Dark Knowledge and Matrix Factorization
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Some Developments in Space-Time Modelling with GIS Tao Cheng – University Col...
Some Developments in Space-Time Modelling with GIS Tao Cheng – University Col...Some Developments in Space-Time Modelling with GIS Tao Cheng – University Col...
Some Developments in Space-Time Modelling with GIS Tao Cheng – University Col...
 
New Mathematical Tools for the Financial Sector
New Mathematical Tools for the Financial SectorNew Mathematical Tools for the Financial Sector
New Mathematical Tools for the Financial Sector
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Unbiased Markov chain Monte Carlo
Unbiased Markov chain Monte CarloUnbiased Markov chain Monte Carlo
Unbiased Markov chain Monte Carlo
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Program on Quasi-Monte Carlo and High-Dimensional Sampling Methods for Applie...
Program on Quasi-Monte Carlo and High-Dimensional Sampling Methods for Applie...Program on Quasi-Monte Carlo and High-Dimensional Sampling Methods for Applie...
Program on Quasi-Monte Carlo and High-Dimensional Sampling Methods for Applie...
 
ML Reading Group (Intro to Quantum Computation)
ML Reading Group (Intro to Quantum Computation)ML Reading Group (Intro to Quantum Computation)
ML Reading Group (Intro to Quantum Computation)
 
A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTION
A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTIONA COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTION
A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND DIFFERENTIAL EVOLUTION
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
SIAM-AG21-Topological Persistence Machine of Phase Transition
SIAM-AG21-Topological Persistence Machine of Phase TransitionSIAM-AG21-Topological Persistence Machine of Phase Transition
SIAM-AG21-Topological Persistence Machine of Phase Transition
 
Information-theoretic clustering with applications
Information-theoretic clustering  with applicationsInformation-theoretic clustering  with applications
Information-theoretic clustering with applications
 
SIAM - Minisymposium on Guaranteed numerical algorithms
SIAM - Minisymposium on Guaranteed numerical algorithmsSIAM - Minisymposium on Guaranteed numerical algorithms
SIAM - Minisymposium on Guaranteed numerical algorithms
 
MUMS Opening Workshop - Model Uncertainty in Data Fusion for Remote Sensing -...
MUMS Opening Workshop - Model Uncertainty in Data Fusion for Remote Sensing -...MUMS Opening Workshop - Model Uncertainty in Data Fusion for Remote Sensing -...
MUMS Opening Workshop - Model Uncertainty in Data Fusion for Remote Sensing -...
 
Binary Vector Reconstruction via Discreteness-Aware Approximate Message Passing
Binary Vector Reconstruction via Discreteness-Aware Approximate Message PassingBinary Vector Reconstruction via Discreteness-Aware Approximate Message Passing
Binary Vector Reconstruction via Discreteness-Aware Approximate Message Passing
 
Applied Machine Learning For Search Engine Relevance
Applied Machine Learning For Search Engine Relevance Applied Machine Learning For Search Engine Relevance
Applied Machine Learning For Search Engine Relevance
 
Reading papers - survey on Non-Convex Optimization
Reading papers - survey on Non-Convex OptimizationReading papers - survey on Non-Convex Optimization
Reading papers - survey on Non-Convex Optimization
 

Similar to Yuki Oyama - Incorporating context-dependent energy into the pedestrian dynamic scheduling model with GPS data

Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Prob...
Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Prob...Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Prob...
Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Prob...jfrchicanog
 
Sampling from Massive Graph Streams: A Unifying Framework
Sampling from Massive Graph Streams: A Unifying FrameworkSampling from Massive Graph Streams: A Unifying Framework
Sampling from Massive Graph Streams: A Unifying FrameworkNesreen K. Ahmed
 
Cab travel time prediction using ensemble models
Cab travel time prediction using ensemble modelsCab travel time prediction using ensemble models
Cab travel time prediction using ensemble modelsAyan Sengupta
 
Introduction to complex networks
Introduction to complex networksIntroduction to complex networks
Introduction to complex networksVincent Traag
 
IVR - Chapter 2 - Basics of filtering I: Spatial filters (25Mb)
IVR - Chapter 2 - Basics of filtering I: Spatial filters (25Mb) IVR - Chapter 2 - Basics of filtering I: Spatial filters (25Mb)
IVR - Chapter 2 - Basics of filtering I: Spatial filters (25Mb) Charles Deledalle
 
Matrix Factorizations for Recommender Systems
Matrix Factorizations for Recommender SystemsMatrix Factorizations for Recommender Systems
Matrix Factorizations for Recommender SystemsDmitriy Selivanov
 
Poggi analytics - distance - 1a
Poggi   analytics - distance - 1aPoggi   analytics - distance - 1a
Poggi analytics - distance - 1aGaston Liberman
 
Human action recognition with kinect using a joint motion descriptor
Human action recognition with kinect using a joint motion descriptorHuman action recognition with kinect using a joint motion descriptor
Human action recognition with kinect using a joint motion descriptorSoma Boubou
 
Stochastic Frank-Wolfe for Constrained Finite Sum Minimization @ Montreal Opt...
Stochastic Frank-Wolfe for Constrained Finite Sum Minimization @ Montreal Opt...Stochastic Frank-Wolfe for Constrained Finite Sum Minimization @ Montreal Opt...
Stochastic Frank-Wolfe for Constrained Finite Sum Minimization @ Montreal Opt...Geoffrey Négiar
 
5.3 dyn algo-i
5.3 dyn algo-i5.3 dyn algo-i
5.3 dyn algo-iKrish_ver2
 
Oracle-based algorithms for high-dimensional polytopes.
Oracle-based algorithms for high-dimensional polytopes.Oracle-based algorithms for high-dimensional polytopes.
Oracle-based algorithms for high-dimensional polytopes.Vissarion Fisikopoulos
 
Differential game theory for Traffic Flow Modelling
Differential game theory for Traffic Flow ModellingDifferential game theory for Traffic Flow Modelling
Differential game theory for Traffic Flow ModellingSerge Hoogendoorn
 
Introduction to Artificial Neural Networks
Introduction to Artificial Neural NetworksIntroduction to Artificial Neural Networks
Introduction to Artificial Neural NetworksStratio
 
Actors for Behavioural Simulation
Actors for Behavioural SimulationActors for Behavioural Simulation
Actors for Behavioural SimulationClarkTony
 
[DL輪読会]Conditional Neural Processes
[DL輪読会]Conditional Neural Processes[DL輪読会]Conditional Neural Processes
[DL輪読会]Conditional Neural ProcessesDeep Learning JP
 
Conditional neural processes
Conditional neural processesConditional neural processes
Conditional neural processesKazuki Fujikawa
 

Similar to Yuki Oyama - Incorporating context-dependent energy into the pedestrian dynamic scheduling model with GPS data (20)

Chapter 1 - Introduction
Chapter 1 - IntroductionChapter 1 - Introduction
Chapter 1 - Introduction
 
Emm3104 chapter 1
Emm3104 chapter 1 Emm3104 chapter 1
Emm3104 chapter 1
 
Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Prob...
Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Prob...Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Prob...
Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Prob...
 
Sampling from Massive Graph Streams: A Unifying Framework
Sampling from Massive Graph Streams: A Unifying FrameworkSampling from Massive Graph Streams: A Unifying Framework
Sampling from Massive Graph Streams: A Unifying Framework
 
Cab travel time prediction using ensemble models
Cab travel time prediction using ensemble modelsCab travel time prediction using ensemble models
Cab travel time prediction using ensemble models
 
Introduction to complex networks
Introduction to complex networksIntroduction to complex networks
Introduction to complex networks
 
Smart Room Gesture Control
Smart Room Gesture ControlSmart Room Gesture Control
Smart Room Gesture Control
 
IVR - Chapter 2 - Basics of filtering I: Spatial filters (25Mb)
IVR - Chapter 2 - Basics of filtering I: Spatial filters (25Mb) IVR - Chapter 2 - Basics of filtering I: Spatial filters (25Mb)
IVR - Chapter 2 - Basics of filtering I: Spatial filters (25Mb)
 
Matrix Factorizations for Recommender Systems
Matrix Factorizations for Recommender SystemsMatrix Factorizations for Recommender Systems
Matrix Factorizations for Recommender Systems
 
Poggi analytics - distance - 1a
Poggi   analytics - distance - 1aPoggi   analytics - distance - 1a
Poggi analytics - distance - 1a
 
Human action recognition with kinect using a joint motion descriptor
Human action recognition with kinect using a joint motion descriptorHuman action recognition with kinect using a joint motion descriptor
Human action recognition with kinect using a joint motion descriptor
 
Emm3104 chapter 2 part2
Emm3104 chapter 2  part2Emm3104 chapter 2  part2
Emm3104 chapter 2 part2
 
Stochastic Frank-Wolfe for Constrained Finite Sum Minimization @ Montreal Opt...
Stochastic Frank-Wolfe for Constrained Finite Sum Minimization @ Montreal Opt...Stochastic Frank-Wolfe for Constrained Finite Sum Minimization @ Montreal Opt...
Stochastic Frank-Wolfe for Constrained Finite Sum Minimization @ Montreal Opt...
 
5.3 dyn algo-i
5.3 dyn algo-i5.3 dyn algo-i
5.3 dyn algo-i
 
Oracle-based algorithms for high-dimensional polytopes.
Oracle-based algorithms for high-dimensional polytopes.Oracle-based algorithms for high-dimensional polytopes.
Oracle-based algorithms for high-dimensional polytopes.
 
Differential game theory for Traffic Flow Modelling
Differential game theory for Traffic Flow ModellingDifferential game theory for Traffic Flow Modelling
Differential game theory for Traffic Flow Modelling
 
Introduction to Artificial Neural Networks
Introduction to Artificial Neural NetworksIntroduction to Artificial Neural Networks
Introduction to Artificial Neural Networks
 
Actors for Behavioural Simulation
Actors for Behavioural SimulationActors for Behavioural Simulation
Actors for Behavioural Simulation
 
[DL輪読会]Conditional Neural Processes
[DL輪読会]Conditional Neural Processes[DL輪読会]Conditional Neural Processes
[DL輪読会]Conditional Neural Processes
 
Conditional neural processes
Conditional neural processesConditional neural processes
Conditional neural processes
 

Recently uploaded

Churning of Butter, Factors affecting .
Churning of Butter, Factors affecting  .Churning of Butter, Factors affecting  .
Churning of Butter, Factors affecting .Satyam Kumar
 
Heart Disease Prediction using machine learning.pptx
Heart Disease Prediction using machine learning.pptxHeart Disease Prediction using machine learning.pptx
Heart Disease Prediction using machine learning.pptxPoojaBan
 
main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidmain PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidNikhilNagaraju
 
CCS355 Neural Network & Deep Learning Unit II Notes with Question bank .pdf
CCS355 Neural Network & Deep Learning Unit II Notes with Question bank .pdfCCS355 Neural Network & Deep Learning Unit II Notes with Question bank .pdf
CCS355 Neural Network & Deep Learning Unit II Notes with Question bank .pdfAsst.prof M.Gokilavani
 
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdfCCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdfAsst.prof M.Gokilavani
 
Risk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdfRisk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdfROCENODodongVILLACER
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxJoão Esperancinha
 
IVE Industry Focused Event - Defence Sector 2024
IVE Industry Focused Event - Defence Sector 2024IVE Industry Focused Event - Defence Sector 2024
IVE Industry Focused Event - Defence Sector 2024Mark Billinghurst
 
Application of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptxApplication of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptx959SahilShah
 
Call Girls Delhi {Jodhpur} 9711199012 high profile service
Call Girls Delhi {Jodhpur} 9711199012 high profile serviceCall Girls Delhi {Jodhpur} 9711199012 high profile service
Call Girls Delhi {Jodhpur} 9711199012 high profile servicerehmti665
 
Architect Hassan Khalil Portfolio for 2024
Architect Hassan Khalil Portfolio for 2024Architect Hassan Khalil Portfolio for 2024
Architect Hassan Khalil Portfolio for 2024hassan khalil
 
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETEINFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETEroselinkalist12
 
Introduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECHIntroduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECHC Sai Kiran
 
Comparative Analysis of Text Summarization Techniques
Comparative Analysis of Text Summarization TechniquesComparative Analysis of Text Summarization Techniques
Comparative Analysis of Text Summarization Techniquesugginaramesh
 
Artificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptxArtificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptxbritheesh05
 

Recently uploaded (20)

Churning of Butter, Factors affecting .
Churning of Butter, Factors affecting  .Churning of Butter, Factors affecting  .
Churning of Butter, Factors affecting .
 
Heart Disease Prediction using machine learning.pptx
Heart Disease Prediction using machine learning.pptxHeart Disease Prediction using machine learning.pptx
Heart Disease Prediction using machine learning.pptx
 
🔝9953056974🔝!!-YOUNG call girls in Rajendra Nagar Escort rvice Shot 2000 nigh...
🔝9953056974🔝!!-YOUNG call girls in Rajendra Nagar Escort rvice Shot 2000 nigh...🔝9953056974🔝!!-YOUNG call girls in Rajendra Nagar Escort rvice Shot 2000 nigh...
🔝9953056974🔝!!-YOUNG call girls in Rajendra Nagar Escort rvice Shot 2000 nigh...
 
main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidmain PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfid
 
CCS355 Neural Network & Deep Learning Unit II Notes with Question bank .pdf
CCS355 Neural Network & Deep Learning Unit II Notes with Question bank .pdfCCS355 Neural Network & Deep Learning Unit II Notes with Question bank .pdf
CCS355 Neural Network & Deep Learning Unit II Notes with Question bank .pdf
 
POWER SYSTEMS-1 Complete notes examples
POWER SYSTEMS-1 Complete notes  examplesPOWER SYSTEMS-1 Complete notes  examples
POWER SYSTEMS-1 Complete notes examples
 
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdfCCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
 
Risk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdfRisk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdf
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
 
IVE Industry Focused Event - Defence Sector 2024
IVE Industry Focused Event - Defence Sector 2024IVE Industry Focused Event - Defence Sector 2024
IVE Industry Focused Event - Defence Sector 2024
 
Application of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptxApplication of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptx
 
Call Girls Delhi {Jodhpur} 9711199012 high profile service
Call Girls Delhi {Jodhpur} 9711199012 high profile serviceCall Girls Delhi {Jodhpur} 9711199012 high profile service
Call Girls Delhi {Jodhpur} 9711199012 high profile service
 
Architect Hassan Khalil Portfolio for 2024
Architect Hassan Khalil Portfolio for 2024Architect Hassan Khalil Portfolio for 2024
Architect Hassan Khalil Portfolio for 2024
 
young call girls in Green Park🔝 9953056974 🔝 escort Service
young call girls in Green Park🔝 9953056974 🔝 escort Serviceyoung call girls in Green Park🔝 9953056974 🔝 escort Service
young call girls in Green Park🔝 9953056974 🔝 escort Service
 
Design and analysis of solar grass cutter.pdf
Design and analysis of solar grass cutter.pdfDesign and analysis of solar grass cutter.pdf
Design and analysis of solar grass cutter.pdf
 
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETEINFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
 
young call girls in Rajiv Chowk🔝 9953056974 🔝 Delhi escort Service
young call girls in Rajiv Chowk🔝 9953056974 🔝 Delhi escort Serviceyoung call girls in Rajiv Chowk🔝 9953056974 🔝 Delhi escort Service
young call girls in Rajiv Chowk🔝 9953056974 🔝 Delhi escort Service
 
Introduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECHIntroduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECH
 
Comparative Analysis of Text Summarization Techniques
Comparative Analysis of Text Summarization TechniquesComparative Analysis of Text Summarization Techniques
Comparative Analysis of Text Summarization Techniques
 
Artificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptxArtificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptx
 

Yuki Oyama - Incorporating context-dependent energy into the pedestrian dynamic scheduling model with GPS data

  • 1. Incorporating context-dependent energy into the pedestrian dynamic scheduling model with GPS data Yuki Oyama* and Eiji Hato * JSPS Researcher / The University of Tokyo oyama@bin.t.u-tokyo.ac.jp Behavior in Networks Studies Unit 14th International Conference on Travel Behaviour Research, Windsor. Wed. 22 July. Paper: 187, Parallel Session H-2, Hanover 2.
  • 2. Table of Contents 1.  Introduction : –  City Center Sojourn of pedestrians 2.  Modeling : –  Pedestrian dynamic scheduling model –  Context-dependent energy 3.  Data Processing : –  Probe Person data with GPS technologies –  Detection of pedestrian activity paths 4.  Case study : –  Model Estimation and Results 5.  Conclusions 1 Part 1 Part 2 Part 3
  • 3. Part 1: Modeling Framework 1.  Introduction : –  City Center Sojourn of pedestrians 2.  Modeling : –  Pedestrian dynamic scheduling model –  Context-dependent energy 3.  Data Processing : –  Probe Person data with GPS technologies –  Detection of pedestrian activity paths 4.  Case study : –  Model Estimation and Results 5.  Conclusions * Part 1
  • 4. Target | City Center Sojourn •  City Center Sojourn refers to pedestrian scheduling behavior in city centers, which includes a sequence of moving (travel) and staying (activity) decisions. Time Space Entry Exit Sojourn time 2 (About 1 km square)
  • 5. Target | Pedestrian scheduling •  Spatial attributes (stumbling on an attractive shop,… ) •  Activity history (finding next shop for goods she wants, …) •  Social interaction (a friend says he wants to drop in a café,…) … 3 Activities can be generated (walking) context-dependently Pattern is not alternative but result of dynamic scheduling process e.g.; Habib (2011) Activities (staying) do not always decided to conduct before travels (moving)
  • 6. Review | Scheduling models 4 Space Time t=1 t=2 t=3 A B C T : Time budget t1 t2 Space A B C t1 t2 Space Time A B C 1. Markov chain pt (i, j) tk k=1 K ∑ = T maxU 2. Time allocation 3. Utility maximization Bowman and Ben-Akiva (2001), Recker (1995) Lerman (1979), Borgers and Timmermans (1986) Bhat et al. (2005), Fukuyama and Hato (2013) × random ordered △ semi-separated × independent ( pre-trip ) ◯ ordered ◯ linked × independent ( pre-trip ) ◯ ordered × separated ◯ context-dependent ( but only at the time )
  • 7. Model | Dynamic scheduling model 5 Activity = Time allocation behavior to a certain ’space’ -  Moving : duration time choice in a certain ’link’ -  Staying : duration time choice in a certain ’node’ Dynamic scheduling model in space 1. Activity generation model Continue or Finish activities ? 2. Time allocation model Duration time choice in the space *‘Continue’ means moving next space *‘Finish’ means moving out of district Space Time link1 link2 link3 link4 link5 node5 Finish Continue tl2 tl3 tl4 tl5 tl1 tn5 max uk (tk ) What this decision is based on? l ∈ S n ∈ S
  • 8. 6 Is it enough with only time constraints ? 0 50 100 150 200 250 300 350 400 450 500 0 50 100 150 200 250 300 350 Sojourn time of tour (min.) tourID ID: 220 (67.3%) 484.3min (max.) •  Non-mandatory tour (shopping, eating, recreational, other activities are included). •  Sojourn time (cumulative duration) is continuously distributed. •  We cannot explain the sojourn time differences among tours by only time constraint. Model | Activity generation model Psychological (personal) concept as resource We have to consider: tk k=1 K ∑
  • 9. Model | Activity generation model 7 - Need - Satisfaction - Satiation (Maslow, 1943; Arentze and Timmermans, 2004; Nijland et al., 2013) (Pattabhiraman et al., 2013) (MacAlister, 1982; Bhat et al., 2005) •  All of activities in a tour have ‘energy’ in common. •  Energy decreases by engaging activities, and can increase based on context. need 0 day und 0 need = f (t) Psychological mechanisms in behavior modeling utility 0 time u(t) = t - For a particular activity - Monotonicity ‘Energy’ : personal resource for engaging in activities.
  • 10. Key Idea | Context-dependent energy 8 Consumption : ec (n) Ec (n) = ec (t(k) , x(k) ) k=1 n ∑ 52% Accumulated decrease by engaging in activities •  An individual continues activities as long as she has energy remaining. •  There can be ‘energy gain’ by activity results or spatial attributes. Remaining : E(n) Motivation for continuing activities in city centers Ei,d Initial stock : A certain level which she plans to achieve
  • 11. Key Idea | Context-dependent energy 8 Consumption : ec (n) Ec (n) = ec (t(k) , x(k) ) k=1 n ∑ 52% Accumulated decrease by engaging in activities •  An individual continues activities as long as she has energy remaining. •  There can be ‘energy gain’ by activity results or spatial attributes. Remaining : E(n) Motivation for continuing activities in city centers Stumbling on an attractive shop. 74% Ei,d Initial stock : A certain level which she plans to achieve Gain (or Loss) : Variation based on behavioral context eg (n) 0% : Finish the sojournE(n) = 0
  • 12. P N 50m n = 1stay : n = 2stay : - decide to back home stopped activity place alternatives start finish : move move Key Idea | Context-dependent energy 9 E(n+1) = Ei,d − Ec (n) + Eg (n+1) (1) finish energyforactivity ( ) 0 time move movestaystay n = 1 n = 2 E = NE Context-dependent energy : - An example of a sojourn tour Energy consumption by engaging in an activity Context-dependent energy gain •  An individual continues activities as long as she has energy remaining. •  There can be ‘energy gain’ by activity results or spatial attributes.
  • 13. Remaining energy stock : Activity duration choice : n = 0 Step1: Initialization Step2: Conducting an activity Step3: Preparation for next activity n := n + 1 Calculating energy consumption : Context-dependent energy gain (or loss) : No Yes Step4: Update of stock Step5: Step6: Finish district sojourn t(n) E(n) > 0 E(n) = E eg (c(n) ) ec (t(n) ) Update of stock : ec (t(n) ) E(n) E(n) = + eg (c(n) ) E(n) = E(n) Model | Activity generation model 10 E(n+1) = Ei,d − Ec (n) + Eg (n+1) Ec (n) = ec (t(k) , x(k) ) k=1 n ∑ Eg (n) = γkiIki i ∑ + δnjsnj j ∑ k=1 n ∑ (1) (2) (3) Remaining energy : Energy consumption : Energy gain (or loss) : Ini snj : Activity history variables : Spatial attributes variables
  • 14. Model | Pedestrian scheduling model 11 (1)' If energy is greater than zero, the sojourn will be continued, otherwise finished. E(n) = Ei,d − Ec (n−1) + Eg (n) +ε Time allocation model (Habib, 2011) max U(tk ) = 1 αk exp ψkzk +ε'k( ) tk αk −1( ) k=1 2 ∑ αk :satiation parameter ( < 1) ε'k :random error term (i.i.d. gumbel distribution) zk :vector of variables ψk :vector of weights t1 +t2 = Ts.t., *k=1: next activity, k=2: composite activities Activity generation model ε :random error term (i.i.d. gumbel distribution) Pr(continue) = Pr(E(n) > 0) (4) (5)
  • 15. Model | Pedestrian scheduling model 12 Joint probability : Pr(continue ∩Time = tk ) ×Φ Jd (ε)− ρJc (ε'k ) 1− ρ2 $ % & & ' ( ) ) (6) MLE (Maximum Likelihood Estimates) (7) = 1−α1 tk + 1−α2 T −tk " # $ % & '⋅ 1 σ exp −(V '2 −V '1) σ " # $ % & '⋅ 1+exp −(V '2 −V '1) σ " # $ % & ' ) * + , - . −2 L = Pri (continue ∩Time = tk )( ) δic k=1 n ∏ " # $ % & ' i=1 I ∏ V 'k =ψkzk +(αk −1)ln tk( ) where, J(ε) : the inverse of CDF of standard normal distribution (Lee, 1983) Habib(2011)* *Khandker M. Nurul Habib (2011). A random utility maximization (RUM) based dynamic activity scheduling model: Application in weekend activity scheduling, Transportation, Vol.38, pp.123-151.
  • 16. Part 2 : Data processing 1.  Introduction : –  City Center Sojourn of pedestrians 2.  Modeling : –  Pedestrian dynamic scheduling model –  Context-dependent energy 3.  Data Processing : –  Probe Person data with GPS technologies –  Detection of pedestrian activity paths 4.  Case study : –  Model Estimation and Results 5.  Conclusions * Part 2
  • 17. Data | Probe Person survey 13 Methods : GPS (automatic) + Web diary •  Latitude / Longitude (a coordinate) •  Timestamp (at the interval of 5~30 s) •  Trip purpose •  Transportation mode + personal information ˆm = ( ˆx, ˆt ) a = (x,t− ,t+ ) ˆmji d = ( ˆxji d , ˆtji d ) ari d = (x,t− ,t+ ) Personal day-to-day data Measurements : Reported activity episodes : ( ji d =1,..., Ji d ) (ri d =1,..., Ri d ) i : an individual, d : a daywhere,
  • 18. Data | Probe Person survey 14 Sequential activity (moving and staying) data : S S 2 2 2 3 3 4 4 1 11 E E 1st & 2nd trip Final trip3rd & 4th trip time12:32:24 12:39:07 12:48:33 reported (shopping) inferred as stay reported (shopping) 13:39:24 13:44:05 14:18:29 14:31:12 14:43:13 14:48:51 2 3 4 4 N 150m reported (eating) •  Not only staying, moving activities are also observed sequentially. •  Day-to-day data of the same person is collected. a1:Mi d = (a1,...,ami d ,...,aMi d ), s = {n,l} ∈ S : a space ami d = (s(x),t− ,t+ ) Using PP data, we get ‘real’ activity sequence with spaces
  • 19. Data | Probe Person survey 15 Reported path (  ) : Time Space ˆm1 ˆm2 ˆm10 ˆm11 ˆm19 ˆm20 ˆm30 ˆm38 a1 r x1 r x t = ˆmJi d ˆmji d = ( ˆxji d , ˆtji d ) ari d = (x,t− ,t+ ) •  There can be dropped (non- reported) staying activity. •  Measurements have not connected with ‘space’ yet. (and it has measurement error) 1.  Label measurements (‘moving’ or ‘staying’) 2.  Connect measurements with ‘space’ (node / link) We need to
  • 20. Data | Detection of activity paths 16 Step1: Classification of moving or staying Labeling : ‘move’ Step1-1: Comparison travel time Step1-2: i = 1 i = J i =: i+1 p =: p+1 Yes No k =: k+1 Step1-3: j = i~p and and No Yes No No (ttk,k+1 ttk,k+1 min ) > Tmin ˆm1:J k,k+1 Labeling : ‘stay’ Yes ˆmi k,k+1 Labeling : ‘move’ˆmi k,k+1 Labeling : ‘stay’ Yes ˆmi:p k,k+1 ˆti+1 ˆti > Tmin d( ˆxi, ˆxi+1) / (ˆti+1 ˆti ) < vmin ˆti ˆtp > Tmin d( ˆx j [i,p],g) < r ttk,k+1 = tk+1 − −tk + ttk,k+1 min = d(xk, xk+1) / vw : Reported travel time : Shortest path travel time gi:p = 1 p−i+1 ( ˆxjlat j=i p ∑ , ˆxjlon j=i p ∑ ) Centroid of ˆmi:p k,k+1 *Tmin =180s, vw =1.4m / s, r = 50m (8) (9)
  • 21. Time Space ˆm1 ˆm2 ˆm10 ˆm11 ˆm19 ˆm20 ˆm30 ˆm38 a1 r x1 r x t = ˆmJi d a1 e Time Space ˆm1 ˆm2 ˆm10 ˆm11 ˆm19 ˆm20 ˆm30 ˆm38 a1 r x1 r x t = ˆmJi d Data | Detection of activity paths 17 Step1: Classification of moving or staying × ×ˆmji d = ( ˆxji d , ˆtji d ,'move') ˆmji d = ( ˆxji d , ˆtji d ,'stay') Next: Connect activities with ‘space’ (move - link / stay - node)
  • 22. Data | Detection of activity paths 18 Step2: Estimation of activity space for ‘stay’ data Step2-1: Candidate set generation UN = {n :n ∈ S} Vin = βnj Xnj j ∑ + w1 fni + w2 fn fni = δk,n i,d k ∑ d ∑ , Universal set: Space frequency score from day-to-day data: CiN ⊂ UN fn = δk,n i,d k ∑ d ∑ i ∑ Importance Sampling using MCMC method ri = Pi / Pj = exp(Vin ) / exp(Vjn ), : 1 if individual i stay n for activity k on day d, otherwise 0.δk,n i,d Finally we get a subset: Adoption rate of i : (10) (11)
  • 23. Data | Detection of activity paths 19 Step2: Estimation of activity space for ‘stay’ data Step2-2: Probability calculation Pi (n) = exp(Vin ) / exp(Vim ) m∈CiN ∑Prior probability: Measurement probability: P( ˆmp:q | n) = P( ˆxp:q | xn ) = Πj=p q P( ˆxj | xn ) P( ˆxj | xn ) = 1 2πσ exp − ( ˆxj − xn )2 2σ 2 " # $$ % & '' P(n | ˆmp:q ) = a⋅ P( ˆmp:q | n)⋅ Pi (n) Probability of space n for ‘stay’ measurement set   :ˆmp:q * We assume that measurement error is only localization σ (12) (13) (14) e.g.; Danalet et al. (2014)
  • 24. Data | Detection of activity paths 20 Detected activity path: Space Time Step2: Estimation of ‘stay’ space ˆm = ( ˆx, ˆt,'stay') Space Time link1 link2 link3 link4 link5 node5tl2 tl3 tl4 tl5 tl1 tn5 a1 a2 a3 a4 a5 a6 Activity sequence with space a1:Mi d = (a1,...,ami d ,...,aMi d ) a = (n,t− ,t+ ) Lon. Lat. Step3: Estimation of ‘move’ space ˆm = ( ˆx, ˆt,'move') (Map-matching) a = (l,t− ,t+ )
  • 25. Part 3 : Case study in Matsuyama city 1.  Introduction : –  City Center Sojourn of pedestrians 2.  Modeling : –  Pedestrian dynamic scheduling model –  Context-dependent energy 3.  Data Processing : –  Probe Person data with GPS technologies –  Detection of pedestrian activity paths 4.  Case study : –  Model Estimation and Results 5.  Conclusions * Part 3
  • 26. Case study | City center of Matsuyama 21 Ehime, Japan Tokyo Matsuyama city Korea D.P.R. Korea China Russia N 200km Matsuyama city : •  Ehime prefecture, Shikoku region •  Population: 516,637 (December 1, 2010) •  Area: 428.86 sq. km •  Density: 1,204.68/sq. km Data
  • 27. City hall Department store Department store MallStation Yokogawara line Ishite river Mall Tram Museum Library Prefectural office Matsuyama castle Park Case study | City center of Matsuyama 22 •  2 department stores / 2 malls •  Various retails and restaurants are located around the streets. About 1.5 km square City center of Matsuyama :
  • 28. Case study | PP survey in Matsuyama 23 Survey Period Weeks No. of monitors Data (trip) CityCenterPP2007 2007/02/19~2007/03/22 4 84 7,810 PP survey 2007A 2007/10/29~2008/01/21 12 508 17,697 PP survey 2007B 2007/10/29~2008/01/21 12 205 14,706 Bike sharing PP 2009/02/21~2009/03/07 2 15 668 Elderly PP 2010 2010/11/18~2011/01/31 12 30 1.380 Total 42 842 42,261 -> 414 sojourn tours (non-mandatory) were observed Data collection :
  • 29. Case study | PP survey in Matsuyama 24 Activity generation: Reported : Total (report + estimates):
  • 30. Estimation | Variables 25 variable Explanation Mean Min. Max. 【Initial stock :  】 Female dummy - - 0 1 Elderly dummy Age: over 60 - 0 1 Car inflow dummy Entry by car - 0 1 EP-Main distance Distance between EP and Main of the tour (m) 281.9 0 1138 【Consumption:    】 Spent time Elapsed time since entry (min./10) 114.74 3.20 484 Walking distance 【Activity history : 】 Cumulative trips Number of cumulative trips 1.7 1 12 Cumulative shopping trips - 0.79 0 9 Cumulative recreational trips - 0.17 0 5 Previous trip : eating 1 if previous trip purpose is eating, otherwise 0 - 0 1 Previous trip : shopping - - 0 1 Previous trip : Main - - 0 1 Previous activity duration Duration of previous activity (min.) 81.11 2.32 484 【Spatial attributes :  】 EP-distance Distance from Entry point (m) 200.35 0 1138 Shopping street 1 if decision making at shopping street, otherwise 0 - 0 1 Department store 1 if decision making at department store, otherwise 0 - 0 1 E(n+1) = E + βc ec (t, x) k=1 n ∑ + γkiIki i ∑ + δn+1, jsn+1, j j ∑ k=1 n+1 ∑ Remaining energy (1) E = αk xk k ∑Initial stock (8) U(tk ) = 1 αk exp ψkzk +ε'k( ) tk αk −1( ) (9)Duration x t,x I s
  • 31. ・Female has larger initial energy ・Elderly’s is limited ・Dist. between Entry point and Main facility indicates positive ・Spent time and walking distance decrease energy ・Energy gain by eating trip ・If main activity is conducted, sojourn tour will be likely to finish and next trip will be short. ・Shopping street motivates the next activity Energy gain Energy loss Initial stock Energy consumption Energy gain (context-dependent) Activity duration Estimation | Results 26 Variable Parameter t-value Discrete choice α1 Constant -0.382 -0.63 α2 Female dummy 0.560 1.88* α3 Elderly dummy -0.931 -1.95* α4 Log(EP-Main dist.(km) + 1) 0.369 5.12** α5 Car inflow dummy -0.356 -1.30 βtime1 Basic parameter of time (min./10) -0.011 -3.23** βtime2 A Number of trips 0.002 1.14 βtime3 Shopping dummy -0.014 -2.70** βwalk Cumulative walking dist. (m/100) 2.985 3.77** βwalk2 (Cumulative walking dist.)^2 -1.673 -3.66** γ1 Cumulative trips -0.773 -3.86** γ2 Cumulative shopping trips 0.689 3.32** γ4 Previous activity : eating 0.922 2.58** γ5 Previous activity : Main -1.285 -4.25** γ6 Shopping street 0.625 1.87 Continuous choice βtime1 Constant 6.004 2.87** βtime2 Previous activity time (min./10) 0.017 4.67** βtime3 Previous activity: shopping -0.705 -2.49* βtime4 Previous activity: Main -1.304 -3.35** βtime5 Log(EP-dist. (km)) -0.151 -3.38** Log(σ) Std. deviation of error term 1.000 - ρ Correlation 0.665 2.27* αj Satiation Parameter of activity j -0.773 -7.85** αc Satiation Parameter of activity c 0.880 0.83 Observations 482 Initial Likelihood -1173.584 Final Likelihood -935.792 Rho square (adj.) 0.183
  • 32. Conclusions 27 •  To capture context-dependent activity generation and scheduling process in pedestrian behavior, •  we incorporated “energy” into the scheduling model and described a sequential time-allocation behavior to spaces. •  And using PP data, we detected activity paths with space. •  As a result, it was clarified that the energy consumption and gain process are dependent on some behavioral and spatial context variables.
  • 33. Thank you for your attentions!! Questions? Contact: oyama@bin.t.u-tokyo.ac.jp or oymyk.dom@gmail.com