control and optimization for
play

Control, and Optimization for Urban Mobility Anuradha Annaswamy - PowerPoint PPT Presentation

Socio-Technical Modeling, Control, and Optimization for Urban Mobility Anuradha Annaswamy Active-adaptive Control Laboratory Massachusetts Institute of Technology Joint Work with Thao Phan, Yue Guan, Eric Tseng, Eric Wingfield, Ling Zhu, and


  1. Socio-Technical Modeling, Control, and Optimization for Urban Mobility Anuradha Annaswamy Active-adaptive Control Laboratory Massachusetts Institute of Technology Joint Work with Thao Phan, Yue Guan, Eric Tseng, Eric Wingfield, Ling Zhu, and Crystal Wang Sponsor: Ford-MIT Alliance

  2. Empowered Consumers + Urban Mobility ? Transactive Control β‰₯ Strategies Consumers Assets (Prices and Fees) Empowered Highway Occupancy Drivers/Riders Shuttle Occupancy Parking spaces Efficient Resource Utilization Taxis Example 1: Dynamic Toll-pricing for congestion reduction Example 2: Shared Mobility on Demand using Dynamic Routing and Pricing CNTS Workshop, July 8-9, 2019

  3. EXAMPLE 1: DYNAMIC TOLL PRICING CNTS Workshop, July 8-9, 2019

  4. Motivation: Alleviate Traffic Congestion Virginia London average speeds of 60 mph 33% reduction in inbound car Stockholm maintained traffic, 30% decrease in minutes of time spent in traffic dropped by 33% delay experienced (morning peak) and 50% (evening peak) Minneapolis San Diego Florida average speeds of 50 mph maintained 95% of the time, with drivers save up to 20 minutes avoiding 8.8 to 13.3% reduction in travel 85% driver satisfaction delay in the worst congestion times Varying toll prices aids Urban Mobility! CNTS Workshop, July 8-9, 2019

  5. Empowered Consumers and Urban Mobility (MnPass, Minneapolis, MN) Transactive Control Varying Toll Price Empowered Drivers Congestion Dynamics Traffic Density CNTS Workshop, July 8-9, 2019

  6. A Socio-Technical Model Driver Probability of evaluation acceptance Infrastructure D U (𝜈, Ξ», πœ„) π‘ž 𝑏 response Driver Preference + Traffic Model Decision Making D U = 𝛽 βˆ— 𝑒𝑗𝑛𝑓 π‘‘π‘π‘€π‘—π‘œπ‘•π‘‘ + 𝛾 βˆ— 𝑄𝑠𝑗𝑑𝑓 + 𝛿 β€’ Traffic model: Accumulator based π‘ž 𝑏 Low 1 β€’ Utility function: Cost and time savings Probability of Risk averse β€’ Probability of Acceptance – population acceptance model High 0 D U Value function 1 π‘ž 𝒃 = 1 + 𝑓 βˆ’π‡βˆ†π‘½ CNTS Workshop, July 8-9, 2019

  7. Toll-pricing controller: Nonlinear PI π‘”π‘šπ‘π‘₯ 𝑝𝑣𝑒 dynamic toll lanes zero toll lanes π‘”π‘šπ‘π‘₯ π‘—π‘œ actual desired dynamic dynamic lane $$$ lane density density road Transactive driver behavior dynamics Controller β€’ Logistic Function probability of consumer purcha 1 β€’ Identify parameters X: 2.525 Y: 0.5126 0.5 β€’ Use inverse nonlinearity in the price-controller 0 0 5 10 15 20 price CNTS Workshop, July 8-9, 2019

  8. Response to High Input Flow High input flow is introduced in the middle of the operating period to test the systems’ ability to prevent congestion. Our model-based control (blue) is successful in keeping the HOT density low compared to MnPASS (red). Dynamic Toll Lane: PID Dynamic Toll Pricing in the Morning Peak 45 (Veh/mile/lane) 8 MnPASS Pricing Ford-MIT Pricing Critical density 7 40 6 35 5 Density Price 30 4 3 25 2 20 1 15 6 6.5 7 7.5 8 8.5 9 0 6 6.5 7 7.5 8 8.5 9 Time by hour Time by hour Dynamic Toll Pricing in the Morning Peak Dynamic Toll Pricing in the Morning Peak 1600 65 1550 60 1500 55 1450 Flow (cars/hr) 50 1400 Speed 1350 45 1300 40 1250 35 1200 1150 30 6 6.5 7 7.5 8 8.5 9 6 6.5 7 7.5 8 8.5 9 Time by hour Time by hour CNTS Workshop, July 8-9, 2019

  9. EXAMPLE 2: SHARED MOBILITY ON DEMAND CNTS Workshop, July 8-9, 2019

  10. A Shared Mobility on Demand (SMoDS) Solution 1. Request: passengers request shuttle rides with 2. Offer: the shuttle server distributes offers to specified pickup/drop-off locations, maximum passengers with ride details including pickup locations, distances willing to walk. walking distances, pickup times, drop-off locations, drop-off times, and prices. 4. Operate : the shuttle server sends out ride details to 3. Decide: passengers decide whether to accept or passengers. decline the offers. Leads to a Constrained Optimization Problem CNTS Workshop, July 8-9, 2019

  11. Dynamic Routing Determine optimal sequence 𝑇 of routing points 𝑆 𝑻,𝑺 βˆˆπ‘» π’ˆ ×𝑺 π’ˆ 𝑫(𝑻, 𝑺) min CNTS Workshop, July 8-9, 2019

  12. Numerical Results (Dynamic Routing; all passengers accept the ride-offer ) new requests received (a) 1 st batch (b) 2 nd batch (c) Original route of the 1 nd batch Clustering pattern Clustering pattern 1 st batch: Before update new requests received new requests received 𝑫 = 𝑫 = , , , , , , 𝑫 = 𝑫 = 𝑫 = 𝑫 = , , 𝑫 = 𝑫 = , , 𝑫 = 𝑫 = , , 𝑫 = 𝑫 = 2 nd batch After update , , , 𝑫 = 𝑫 = , , , , , , , , 𝑫 = 𝑫 = , , , , 𝑫 = 𝑫 = , 𝑫 = 𝑫 = 𝑫 = 𝑫 = 𝑫 = 𝑫 = 𝑫 = 𝑫 = (e) Dynamic routing (d) Static routing CNTS Workshop, July 8-9, 2019

  13. A Schematic of the SMoDS Solution Alternative Transportation Options Reference R travel times Dynamic Routing via Desired AltMin Algorithm Probability Passenger of Behavioral Model Acceptance 𝑑 π‘ž 𝑆 π‘Š(βˆ™) and 𝜌(βˆ™) π‘ž βˆ— tariff 𝛿 Dynamic Pricing via CPT 𝑆 𝑔 π‘Œ (𝑦) tari 𝑑 : subjective probability of acceptance framed by 𝑆 π‘ž 𝑆 CNTS Workshop, July 8-9, 2019 47

  14. Conventional Utility Theory β€’ Several alternatives with utilities 𝑉 𝑏 1 , …, 𝑉 𝑏 π‘œ β€’ Corresponding probabilities π‘ž 1 , …, π‘ž π‘œ 𝑛 Utility function of ride-sharing π‘˜ π‘ž π‘—π‘˜ 𝑣 𝑗 = ෍ 𝑉 𝑏𝑗 π‘˜=1 2 𝑒 π‘ž 1 , 𝑒 π‘ž 2 ] 𝑣 𝑗 = ΰΆ± 𝑉 𝑏 𝜐 π‘ž 𝑗 𝜐 π‘’πœ 𝑉 𝑏𝑙 = 𝑔 𝜐 , 𝜐 ∈ [𝑒 π‘ž 1 𝑒 π‘ž 𝑣 1 : Utility function of taking a private car; 𝑣 π‘œ : Utility function of taking a bus β€’ Not adequate if uncertainty is large CNTS Workshop, July 8-9, 2019

  15. Behavioral Dynamics of Human Beings: Prospect Theory In prospect theory*, the utility of the 𝑗 π‘’β„Ž option β€’ 𝑛 π‘˜ )𝜌(π‘ž π‘—π‘˜ ) 𝑣 𝑗 = ෍ π‘Š(𝑣 𝑗 π‘˜=1 β€’ Human beings are irrational in two ways: π‘˜ ) : loss aversion - losses hurt more than 1. How do we perceive utility π‘Š(𝑣 𝑗 the benefit of gains 2. How do we assess probability 𝜌(π‘ž π‘—π‘˜ ) : overreact to small probability events and underreact to large probability events * Kahneman and Tversky, 1992 CNTS Workshop, July 8-9, 2019

  16. Irrationality – Loss Aversion β€’ Loss aversion: losses hurt more than gains feel good 𝛾 + 𝑣 π‘—π‘˜ βˆ’ 𝑆 if 𝑣 π‘—π‘˜ > 𝑆 , π‘˜ ) = ቐ π‘Š(𝑣 𝑗 βˆ’πœ‡ 𝑆 βˆ’ 𝑣 π‘—π‘˜ 𝛾 βˆ’ if 𝑣 π‘—π‘˜ < 𝑆 , β€’ Framing effects: 𝑆 is the reference point of the framing, where people feel neutral, differentiate gain from loss (πœ‡ > 1) β€’ Example: it is better to not have a $5 loss than to gain $5. π’Œ ) 𝑾(𝒗 𝒋 𝜸 + 𝒗 𝒋 π’Œ βˆ’ 𝑺 El Rahi et al., Prospect 𝑺 Theory for Smart Grid, 2017. 𝒗 π’‹π’Œ βˆ’π 𝑺 βˆ’ 𝒗 𝒋 π’Œ 𝜸 βˆ’ CNTS Workshop, July 8-9, 2019

  17. Irrationality – Overreact to Small Probability β€’ Overreact to small probability events and underreact to large probability events 𝜌 π‘ž π‘—π‘˜ = exp βˆ’(βˆ’π‘šπ‘œπ‘ž π‘—π‘˜ ) 𝛽 , 𝛽 < 1 El Rahi et al., Prospect Theory for Smart Grid, 2017. β€’ Example: people would not play a lottery with a 1% chance to win $100K and a 99% chance to lose $1K CNTS Workshop, July 8-9, 2019

  18. Prospect Theory for Shared Mobility β€’ The utility function is a combination of time and price: 𝑣 = 𝑏 + 𝑐 π‘ž π‘ˆ π‘₯π‘π‘šπ‘™ + 𝑐 π‘₯ π‘ˆ π‘₯𝑏𝑗𝑒 + 𝑐 𝑠 π‘ˆ 𝑠𝑗𝑒𝑓 + π›Ώπœ 2 , 𝑣: 𝑣(𝜐) β€’ 𝜐 ∈ 𝑒 π‘ž 1 , 𝑒 π‘ž 𝑆 ∞ π‘Š(𝑣) 𝑒 π‘Š(𝑣) 𝑒 𝑑 = ΰΆ± 𝑉 𝑆 𝑒𝑣 𝜌 𝐺 𝑉 (𝑣) 𝑒𝑣 + ΰΆ± 𝑒𝑣 βˆ’πœŒ 1 βˆ’ 𝐺 𝑉 (𝑉) 𝑒𝑣 βˆ’βˆž 𝑆 β€’ 𝑆: reference 𝜐 𝑒𝑔(𝜐) - Cumulative Distribution Function (CDF) β€’ 𝐺 𝜐 = Χ¬ βˆ’βˆž – Extract from demand pattern and historical data – 𝐺 𝜐 exists but unknown Objective probability of acceptance Subjective probability of acceptance 𝑓 𝑉 𝑝 𝑑 𝑓 𝑉 𝑆 π‘ž 𝑝 = 𝑑 = π‘ž 𝑆 𝑓 𝑉 𝑝 + 𝑓 𝐡 𝑝 𝑑 + 𝑓 𝐡 𝑆 𝑑 𝑓 𝑉 𝑆 𝑉 𝑝 and 𝐡 𝑝 : objective utility of the SMoDS 𝑑 and 𝐡 𝑆 𝑑 : subjective utility of the SMoDS 𝑉 𝑆 and the alternative and the alternative CNTS Workshop, July 8-9, 2019

  19. Implication 1 – Fourfold Pattern of Risk Attitudes Example: Two outcomes, probabilities of 0.95,0.05 Fourfold pattern of risk attitudes (a) 𝑺 = + and π’ˆ = (c) 𝑺 = + and π’ˆ = a) Risk averse over high probability gains Gains ) βˆ’ 𝑺 b) Risk seeking over high probability losses = 𝑽 βˆ’ βˆ’ (𝑽 𝑺 CPT Non-CPT c) Risk seeking over low probability gains CPT Non-CPT (b) 𝑺 = + and π’ˆ = (d) 𝑺 = + and π’ˆ = d) Risk averse over low probability losses Losses Conclusions: CPT Non-CPT CPT Non-CPT Tariff [$] Tariff [$] High Probability Low Probability Quantification of the qualitative β€’ statements Truncated Poisson distribution with two outcomes 𝑦 + 𝑐𝛿 and 𝑦 + 𝑐𝛿 1. the presence of risk seeking passengers gives flexibility in β€’ Relative Attractiveness increasing tariffs; RA = 𝑉 𝑝 βˆ’ 𝐡 𝑝 βˆ’ (𝑉 𝑆 𝑑 βˆ’ 𝐡 𝑆 𝑑 ) 2. the presence of risk averse passengers requires additional constraints on tariffs. CNTS Workshop, July 8-9, 2019 47

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend