Parking Tour Generator September 2018

Slides:



Advertisements
Similar presentations
ITS THE FINAL LECTURE! (SING IT, YOU KNOW YOU WANT TO) Operations Research.
Advertisements

Problem solving with graph search
Solving Problem by Searching
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Planning under Uncertainty
Shellsort. Review: Insertion sort The outer loop of insertion sort is: for (outer = 1; outer < a.length; outer++) {...} The invariant is that all the.
27-Jun-15 Profiling code, Timing Methods. Optimization Optimization is the process of making a program as fast (or as small) as possible Here’s what the.
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
Representing and Using Graphs
School Bus Safety Policy for Podar Jumbo Kids BUS STUDENT TRAINING.
Artificial Intelligence in Game Design Dynamic Path Planning Algorithms.
For Monday Read chapter 4, section 1 No homework..
Artificial Intelligence
Decision Theoretic Planning. Decisions Under Uncertainty  Some areas of AI (e.g., planning) focus on decision making in domains where the environment.
Final Version Olex Ponomarenko. Goals for the Project Create a fairly abstract map path-finding program Add more complex heuristics to account for things.
This is…. $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 LawsVH PolicySignsPotent Potables.
Solving problems by searching A I C h a p t e r 3.
Rhys Llywelyn Mountain Skills Summary. Rhys Llywelyn Mountain Navigation Reading the Map Always keep the map orientated, in good visibility use the features.
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
Network Problems A D O B T E C
Chapter 3 Solving problems by searching. Search We will consider the problem of designing goal-based agents in observable, deterministic, discrete, known.
What is it? Road Safety Week is the UK’s biggest road safety event. People all around the country get involved to learn and spread the word about road.

Decision Analysis Objective
Introduction to Machine Learning
Instructor: Vincent Conitzer
Monday 23 to Friday 27 November 2017
Shellsort.
Travelling to School.
Negotiating Intersections
What is it? Road Safety Week is the UK’s biggest road safety event. People all around the country get involved to learn and spread the word about road.
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Omnilore Standard Walks
What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.
For Monday Chapter 6 Homework: Chapter 3, exercise 7.
Heuristic Search Introduction to Artificial Intelligence
ROAD SAFETY WEEK.
O2 Travel Worry free roaming in Europe with calls, texts and data for £1.66 per day Key Features Use your phone as if at home while travelling in Europe.
ECE 448 Lecture 4: Search Intro
Week 11 - Friday CS221.
Artificial Intelligence Problem solving by searching CSC 361
Important Family Vacation Deals - Tips for Saving Money and Ideas.
Motion Planning for Multiple Autonomous Vehicles
Driving in City Traffic
2018 KS2 A*STARS Class Quiz A*STARS Key Stage 2.
Chapter 2: Business Efficiency Lesson Plan
CS330 Discussion 4 Spring 2017.
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
Motion Planning for Multiple Autonomous Vehicles
Decision Maths Dijkstra’s Algorithm.
Chapter 2: Business Efficiency Business Efficiency
Session 2: Giving directions
Decision Analysis Objective
Intro to CIT 594
Instructor: Vincent Conitzer
Artificial Intelligence
Artificial Intelligence
Decision Analysis Objective
Graph Theory I In today’s lesson we will look at:
Lecture 21 Logistics Last lecture Today HW7 due Wednesday
CO Games Development 1 Week 8 Depth-first search, Combinatorial Explosion, Heuristics, Hill-Climbing Gareth Bellaby.
COS 461: Computer Networks
Introducing Underestimates
CPSC 322 Introduction to Artificial Intelligence
Path Planning in Discrete Sampled Space
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
lesson 14.3 MANAGING SPACE IN CITY TRAFFIC
Time Complexity and the divide and conquer strategy
A few small differences between UK and Poland
Presentation transcript:

Parking Tour Generator September 2018

Parking Tour Generator Explores a sequence of roads like a parking expert would Guidance tells you when to park, or not park Parking Tour in vicinity of destination is constrained by max preferred walking time Link 1 is the first within max walking time (here it is 10 mins) Red means “don’t park yet” Black means “park if there is a space”. Map tiles and road data © OpenStreetMap contributors

Parking Tour Generator Tours differ from Routes in important ways There is no specific end point. The Tour does not know where available parking spaces are, it just knows parking probabilities. The same road may be visited multiple times if that is an easy way to explore the area. (No loops in Routes). A series of roads may be visited multiple times if enough time has elapsed for spaces to be vacated. The tour may recommend NOT parking in some places if it knows better opportunities are coming. There may also be areas bad for parking where the final walk is difficult, or parking time or cost restrictions apply.

Parking Tour Generator Cost Function The Parking Tour Generator is very different from a Router There is still a Cost Function though to model the trade-offs a driver makes Weighting includes: Driving Time Walking Time Parking Charge Parking Time Restictions Ease of Driving, e.g. left or right turns Ease of Walking, e.g. major road crossings

Parking Tour Generator Probabilistic Cost Function We do not know where parking spaces are available, only the probabilities of finding a space To find a Tour we do not minimise components such as Walking Distance, but rather Expected Walking Distance This approach is very flexible, e.g.: Less walking if it is raining, with a longer tour Faster parking if late, perhaps in a more expensive space If there is plenty of parking our Tour will head straight for destination area. When parking is rare the Tour will cover roads further from the destination, but in a pattern the covers the maximum area in the shortest time.

Parking Tour Generator Data Requirements Historical Parking Data The probabilility of parking on a given stretch of road at different times of the day and week Churn Interval How soon it might be worth re-visiting a stretch of road The algorithm gives useful results if only partial data or no data is know A default Churn Interval of a few minutes works well A default parking probability on appropriate roads generates useful Tours

Parking Tour Generator Example Tours Plentiful Parking A good Tour will search near the destination. The Tour will advise against parking until the destination is within easy walking distance. Here, a uniform parking probability of 0.1/100m advises parking from link 12 onwards. Map tiles and road data © OpenStreetMap contributors

Parking Tour Generator Example Tours Parking is rare Advice to park at an earlier stage. This will reduce the expected Tour time. A uniform parking probability of 0.03/100m advises parking from link 6 onwards. Map tiles and road data © OpenStreetMap contributors

Parking Tour Generator Example Tours High Churn Rate It is worth revisiting a road if enough time has elapsed for the parking probability to have recovered. Here, the Tour driving time has been increased to 600s, and more loops are generated. Map tiles and road data © OpenStreetMap contributors

Parking Tour Generator Example Tours Low Churn Rate It is now best to drive a larger circuit before revisiting roads. Here, links [17,44] and links [12,46] are revisited after 5 mins. Map tiles and road data © OpenStreetMap contributors

Parking Tour Generator Example Tours Dislike Walking We expect to see more time driving, but closer to the destination. Map tiles and road data © OpenStreetMap contributors

Parking Tour Generator Example Tours Emergent Behaviour The tour explores all the aisles sensibly, exploring the end ones first as they are closest to the walking paths (except for [57, 58] as that is one-way) Map tiles and road data © OpenStreetMap contributors

Parking Tour Generator Example Tours Turn Penalties The surprising behaviour when we applied an artificially high weighting was a tour that visited all the aisles while never turning right after link 24 (in the UK) Map tiles and road data © OpenStreetMap contributors

Parking Tour Generator Example Tours Extreme Tours How to optimally find a space in a Park and Ride Map tiles and road data © OpenStreetMap contributors