1. CS4244 Group 6

2. Weekend Planner IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo Introduction

3.  Nitin’s Part IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

4. Weekend Planner IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo Itinerary Planning

5.  Itinerary – sequence of events and travels  From start-time to end-time start-location to end-location  Constraints: budget, time and location  Try to find the best combination of events given the above constraints IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

6.  Divide and conquer  Recursive tree-search approach  Basic idea: Divide an itinerary into left and right children and plan these itineraries recursively. Merge them to form a complete itinerary IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

7.  Start with root node  Query event-selection interface (defined later) to get n (<=5) best events  Form n child itineraries with one event each  Start recursive itinerary generation IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

8.  Select an event for an itinerary  Divide it into left and right children with new constraints  Plan them recursively  Leaf node: no more events possible (run out of money or time)  Start merging up IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

9.  Generate all combinations of left + right + parent to form new “complete” itineraries  Only complete itineraries take part in merging up process  Stop when merged up to root  Display 5 best itineraries (more on itinerary evaluation later) IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

10.  Class Itinerary:  (slot parent) (slot child)  (slot complete (default FALSE))  (multislot event-list)  (multislot travel-list)  (slot preference-rating (default 0))  (slot total-cost)  (slot start-time)  (slot end-time)  (slot start-location)  (slot end-location)  (slot budget) ;;Some other flags required for processing IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo  Class EVENTS_SELECTED  (slot id)  (slot ready)  (slot start_time)  (slot end_time)  (slot start_location)  (slot end_location)  (slot budget)  (multislot already-chosen)  (multislot event-list)

11.  Rules: The search process is mainly guided by the following rules:  EVENT_QUERY  CREATE_CHILD_NODES  MERGE  MARK_READY IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

12.  EVENT_QUERY  LHS: new itinerary is formed  RHS: ▪ create EVENTS_SELECTED object ▪ Set the start-end time, location, budget etc. ▪ Set “ready” flag to false IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

13.  CREATE_CHILD_NODES  LHS: EVENTS_SELECTED object with “ready” attribute = TRUE  RHS: ▪ For each event in the event-list create a child node ▪ If event list is empty then this is a leaf itinerary hence add travel IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

14.  MERGE  LHS: left and right child itineraries with the same parent  RHS: ▪ Merge the left and the right child with the parent to form a “complete” itinerary ▪ Compute preference rating (more on this later) IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

15. Weekend Planner IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo Events Selection

16.  Component  Receive the request from itinerary ▪ Budget, time slot, start location, end location  Make event instances involving selection mechanism  Sort and return IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

17.  Make Event Instances  Event types  Event instance IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo (defclass EVENT_INSTANCE (is-a USER) (role concrete) (slot start_time (default [start])) (slot end_time (default [end])) (slot duration) (slot event_type) (slot description) (slot location (default [nus])) (slot expense (default 0)) (slot preference(default 0)

18.  Selection Mechanism  Hard constraints ▪ Weather for parks ▪ Adult certification for movies  Temporal and budget possibility ▪ Fix-time events ▪ Non-fix-time events IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

19.  Probability-Based Preferences  Events type preference ▪ Classified based on age and gender ▪ Example: shopping for females  Temporal preference ▪ Example: ordinary lunch / dinner time  Event instance preference IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

20.  Event Instance Preference  Place preference ▪ Based on public comments  Content preference ▪ Preference type: Movie: genre ▪ Preference instance: (Action, Comedy, Animation) ▪ Preference value: (0.5, 0.8, 0.5) IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

21. IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo Preference typePreference instance Movie: genreDramaActionComedyHorrorAnimationSF Movie: languageEnglishMandarin Brand: itemClothesCosmeticsComputerCDBook Park: natural_feature HillRiverSeaWoods Museum: exhibition ArtsHistoryCombinationCivilization Restaurant: cuisine JapaneseCantoneseChineseWesternIndia Thai ItalianSingaporean

22.  Preference Combination  Event instance preference combination (geometric mean)  Client’s event preference (product) IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo P instance = pow ( ∏ p i * P place, 1/n+1) P event = P instance * P type * P temporal

23.  Sort And Return  Sort all the event instances based on P instance  Return the best five ones for making itineraries IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

24. Weekend Planner Travel Mode Selection

25.  Requirenments  Check Possibility of Event  Travel Mode Selection

26.  Classes  Location  Mode  Travel

27.  Possibility checking  During Event Selection  First case: Time is fixed  Second case: Time is not fixed

28.  Travel mode selection  Leaf Case of Itinerary Planning  Optimize for Cost

29. Weekend Planner Itinerary Selection

30.  Requirenments on Preference Rating  Containing Events  Travel Time  Waiting Time

31.  Final Preference Rating  Weighted Average over time  Travelling and Waiting have a Negative Preference Rating  Waiting has a Lower Rating than Travelling

32. Weekend Planner IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo User Interface

33.  Amit’s part IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo

34. Weekend Planner IntroductionItineraryEventsTravel Itinerary Selection User Interface Demo