Building Software Agents for Building Software Agents for Planning - - PowerPoint PPT Presentation

building software agents for building software agents for
SMART_READER_LITE
LIVE PREVIEW

Building Software Agents for Building Software Agents for Planning - - PowerPoint PPT Presentation

Building Software Agents for Building Software Agents for Planning Monitoring, and Planning Monitoring, and Optimizing Travel Optimizing Travel Craig A. Knoblock Knoblock Craig A. University of Southern California University of Southern


slide-1
SLIDE 1

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 1 1

Building Software Agents for Building Software Agents for Planning Monitoring, and Planning Monitoring, and Optimizing Travel Optimizing Travel

Craig A. Craig A. Knoblock Knoblock University of Southern California University of Southern California

slide-2
SLIDE 2

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 2 2

Acknowledgements Acknowledgements

! ! Jose Luis Ambite, USC

Jose Luis Ambite, USC

! ! Greg

Greg Barish Barish, Fetch Technologies , Fetch Technologies

! ! Oren

Oren Etzioni Etzioni, University of Washington , University of Washington

! ! Kristina

Kristina Lerman Lerman, USC , USC

! ! Martin

Martin Michalowski Michalowski, USC , USC

! ! Steve Minton, Fetch Technologies

Steve Minton, Fetch Technologies

! ! Ion

Ion Muslea Muslea, SRI , SRI

! ! Maria

Maria Muslea Muslea, USC , USC

! ! Jean Oh, CMU

Jean Oh, CMU

! ! Snehal

Snehal Thakkar, USC Thakkar, USC

! ! Rattapoom

Rattapoom Tuchinda Tuchinda, USC , USC

! ! Alexander Yates, University of Washington

Alexander Yates, University of Washington

slide-3
SLIDE 3

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 3 3

Introduction Introduction

! ! Wealth of travel

Wealth of travel-

  • related data available online

related data available online

! ! Web provides unprecedented access to

Web provides unprecedented access to information to end users information to end users

! ! Abundance of computing power available

Abundance of computing power available

! ! We can exploit these three factors to:

We can exploit these three factors to:

! ! Support better planning of travel

Support better planning of travel

! ! Provide real

Provide real-

  • time monitoring of travel plans

time monitoring of travel plans

! ! Exploit data mining techniques to minimize problems

Exploit data mining techniques to minimize problems and cost and cost

slide-4
SLIDE 4

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 4 4

Outline Outline

! ! Agent Access to Online Sources

Agent Access to Online Sources

! ! Interactive Planning of a Trip

Interactive Planning of a Trip

! ! Building Agents for Monitoring Travel

Building Agents for Monitoring Travel

! ! Mining Online Sources to Optimize Travel

Mining Online Sources to Optimize Travel

! ! Conclusions

Conclusions

slide-5
SLIDE 5

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 5 5

Outline Outline

! ! Agent Access to Online Sources

Agent Access to Online Sources

! ! Interactive Planning of a Trip

Interactive Planning of a Trip

! ! Building Agents for Monitoring Travel

Building Agents for Monitoring Travel

! ! Mining Online Sources to Optimize Travel

Mining Online Sources to Optimize Travel

! ! Conclusions

Conclusions

slide-6
SLIDE 6

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 6 6

Agent Access to Online Sources Agent Access to Online Sources

slide-7
SLIDE 7

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 7 7

Problem: Problem: Information Not in a Usable Format Information Not in a Usable Format

! ! Web pages are intended for human consumption

Web pages are intended for human consumption

! ! Web services and XML are designed to solve this

Web services and XML are designed to solve this problem, but not available for most data problem, but not available for most data

! ! Need to turn these online sources into ‘agent

Need to turn these online sources into ‘agent-

  • enabled’ sources

enabled’ sources

! ! Support database like querying by a software agent

Support database like querying by a software agent

! ! Return information in a structured format, such as

Return information in a structured format, such as XML XML

slide-8
SLIDE 8

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 8 8

Wrappers for Live Access Wrappers for Live Access to Online Sources to Online Sources

<YAHOO_WEATHER>

  • <ROW>

<TEMP>25</TEMP> <OUTLOOK>Sunny</OUTLOOK> <HI>32</HI> <LO>19</LO> <APPARTEMP>25</ APPARTEMP > <HUMIDITY>35%</HUMIDITY> <WIND>E/10 km/h</WIND> <VISIBILITY>20 km</VISIBILITY> <DEWPOINT>9</DEWPOINT> <BAROMETER>959 mb</BAROMETER> </ROW> </YAHOO_WEATHER>

Wrapper

slide-9
SLIDE 9

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 9 9

Learning a Wrapper Learning a Wrapper

Inductive Learning System

Wrapper

EC Tree Labeled Pages

GUI

Inductive Learning System

EC Tree EC Tree Labeled Pages

GUI

slide-10
SLIDE 10

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 10 10

Status Status

! ! Almost any source on the Web can be turned

Almost any source on the Web can be turned into an agent into an agent-

  • enabled source

enabled source

! ! Time to construct a wrapper ranges from a few

Time to construct a wrapper ranges from a few minutes to a few hours minutes to a few hours

! ! Tools are easy to learn

Tools are easy to learn

! ! Makes it possible to exploit the huge amount of

Makes it possible to exploit the huge amount of information available online information available online

! ! Wrapper learning technology has been licensed

Wrapper learning technology has been licensed to Fetch Technologies, which has a commercial to Fetch Technologies, which has a commercial product available product available

slide-11
SLIDE 11

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 11 11

Outline Outline

! ! Agent Access to Online Sources

Agent Access to Online Sources

! ! Interactive Planning of a Trip

Interactive Planning of a Trip

! ! Building Agents for Monitoring Travel

Building Agents for Monitoring Travel

! ! Mining Online Sources to Optimize Travel

Mining Online Sources to Optimize Travel

! ! Conclusions

Conclusions

slide-12
SLIDE 12

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 12 12

Interactive Trip Planning Interactive Trip Planning

! ! Current systems provide support to select flights, hotels

Current systems provide support to select flights, hotels and cars and cars

! ! Integrates the planning at the level of dates and locations

Integrates the planning at the level of dates and locations

! ! There are many more factors involved in planning a trip

There are many more factors involved in planning a trip

! ! Which airports to fly into and out of

Which airports to fly into and out of

! ! Whether to drive or take a taxi to the airport

Whether to drive or take a taxi to the airport

! ! How to get form the airport to the destination

How to get form the airport to the destination

! ! Proximity of hotel to meeting

Proximity of hotel to meeting

! ! Etc…

Etc…

! ! Ideally a system will

Ideally a system will

! ! Provide all of the data required to make these decisions

Provide all of the data required to make these decisions

! ! Provide a way to consider the tradeoffs of the various choices

Provide a way to consider the tradeoffs of the various choices

slide-13
SLIDE 13

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 13 13

Heracles Constraint Heracles Constraint-

  • based Planning

based Planning

! ! Framework for building integrated

Framework for building integrated applications applications

! ! Extract and integrate data for a given task

Extract and integrate data for a given task

! ! Live access to online sources using the

Live access to online sources using the wrappers wrappers

! ! Constraint

Constraint-

  • based decides what sources to

based decides what sources to query and how to integrate the results query and how to integrate the results

! ! Tight integration of user choices

Tight integration of user choices

slide-14
SLIDE 14

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 14 14

Travel Planner Travel Planner

slide-15
SLIDE 15

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 15 15

Dynamically Updates Slots as Dynamically Updates Slots as Information Becomes Available Information Becomes Available

BLACK GREEN GREEN GREEN GREEN GREEN GREEN GREEN GREEN GREEN GREEN GREEN BLACK GREEN GREEN GREEN BLUE BLUE RED RED RED RED RED RED RED RED RED RED

slide-16
SLIDE 16

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 16 16

Supports Informed Choices Supports Informed Choices

slide-17
SLIDE 17

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 17 17

Propagates Changes Propagates Changes

slide-18
SLIDE 18

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 18 18

User Can Specify User Can Specify High High-

  • Level Preferences

Level Preferences

slide-19
SLIDE 19

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 19 19

computeDuration multiply getDistance getTaxiFare findClosestAirport getParkingRate selectModeToAirport DestinationAddress OriginAddress DepartureDate

Mar 15, 2001

ReturnDate

Mar 18, 2001

DepartureAirport

LAX

Distance

15.1 miles

Duration

4 days

parkingTotal

$64.00

parkingRate

$16.00/day

TaxiFare

$23.00

ModeToAirport

Taxi

computeDuration multiply getDistance getTaxiFare findClosestAirport getParkingRate selectModeToAirport DestinationAddress OriginAddress DepartureDate

Mar 15, 2001

ReturnDate

Mar 18, 2001

DepartureAirport

LAX

Distance

15.1 miles

Duration

4 days

parkingTotal

$64.00

parkingRate

$16.00/day

TaxiFare

$23.00

ModeToAirport

Taxi

Constraint Network: Drive or Taxi? Constraint Network: Drive or Taxi?

slide-20
SLIDE 20

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 20 20

Summary Summary

! ! Integration of wide range of data from

Integration of wide range of data from many different sources many different sources

! ! Tight integration of data using constraints

Tight integration of data using constraints to capture the dependencies to capture the dependencies

! ! Supports better decision making

Supports better decision making

! ! Easy to consider costs of specific choices

Easy to consider costs of specific choices

! ! Easy to compare tradeoffs

Easy to compare tradeoffs

slide-21
SLIDE 21

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 21 21

Outline Outline

! ! Agent Access to Online Sources

Agent Access to Online Sources

! ! Interactive Planning of a Trip

Interactive Planning of a Trip

! ! Building Agents for Monitoring Travel

Building Agents for Monitoring Travel

! ! Mining Online Sources to Optimize Travel

Mining Online Sources to Optimize Travel

! ! Conclusions

Conclusions

slide-22
SLIDE 22

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 22 22

Agents for Monitoring Travel Agents for Monitoring Travel

! ! Many opportunities and possible problems can arise

Many opportunities and possible problems can arise during travel during travel

! ! Current environment:

Current environment:

! ! Wide access to data

Wide access to data

! ! Abundance of computer resources

Abundance of computer resources

! ! Availability of cell phones and portable computers

Availability of cell phones and portable computers

! ! Makes it possible to monitor all aspects of a trip

Makes it possible to monitor all aspects of a trip

! ! Create personal assistants that monitor your travel plan

Create personal assistants that monitor your travel plan to to

! ! exploit opportunities

exploit opportunities

! ! avoid problems

avoid problems

slide-23
SLIDE 23

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 23 23

Automatically Configuring Agents Automatically Configuring Agents

slide-24
SLIDE 24

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 24 24

Agents Deployed to Agents Deployed to Monitor Travel Itinerary Monitor Travel Itinerary

Travel Itinerary

W W W A g e n t P r o x i e s F o r P e o p l e I n f o r m a t i o n A g e n t s O n t o l o g y - b a s e d M a t c h m a k e r s

GRID

Flight Prices & Schedules Weather Flight Status Restaurants

slide-25
SLIDE 25

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 25 25

Actual Messages Sent Actual Messages Sent

! ! Flight

Flight-

  • Status Agent:

Status Agent:

! ! Flight delayed message:

Flight delayed message:

Your United Airlines flight 190 has been delayed. Your United Airlines flight 190 has been delayed. It was originally scheduled to depart at 11:45 AM It was originally scheduled to depart at 11:45 AM and is now scheduled to depart at 12:30 PM. and is now scheduled to depart at 12:30 PM. The new arrival time is 7:59 PM. The new arrival time is 7:59 PM.

! ! Flight cancelled message:

Flight cancelled message:

Your Delta Air Lines flight 200 has been cancelled. Your Delta Air Lines flight 200 has been cancelled.

! ! Fax to hotel message:

Fax to hotel message:

Attention: Registration Desk Attention: Registration Desk I am sending this message on behalf of David I am sending this message on behalf of David Pynadath Pynadath, who has a reservation at your hotel. David , who has a reservation at your hotel. David Pynadath Pynadath is on United Airlines 190, which is now is on United Airlines 190, which is now scheduled to arrive at IAD at 7:59 PM. Since the scheduled to arrive at IAD at 7:59 PM. Since the flight will be arriving late, I would like to request flight will be arriving late, I would like to request that you indicate this in the reservation so that the that you indicate this in the reservation so that the room is not given away. room is not given away.

slide-26
SLIDE 26

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 26 26

Actual Messages Sent (cont.) Actual Messages Sent (cont.)

! ! Airfare Agent: Airfare dropped message

Airfare Agent: Airfare dropped message

The airfare for your American Airlines itinerary The airfare for your American Airlines itinerary (IAD (IAD -

  • LAX) dropped to $281.

LAX) dropped to $281.

! ! Earlier

Earlier-

  • Flight Agent: Earlier flights message

Flight Agent: Earlier flights message

The status of your currently scheduled flight is: The status of your currently scheduled flight is: # 190 LAX (11:45 AM) # 190 LAX (11:45 AM) -

  • IAD (7:29 PM) 45 minutes Late

IAD (7:29 PM) 45 minutes Late If you would like to return earlier, the following If you would like to return earlier, the following United Airlines flights will arrive earlier than your United Airlines flights will arrive earlier than your scheduled flights: scheduled flights: # 946 LAX (8:31 AM) # 946 LAX (8:31 AM) -

  • IAD (3:35 PM) 11 minutes Late

IAD (3:35 PM) 11 minutes Late

  • # 388 LAX (9:25 AM)

# 388 LAX (9:25 AM) -

  • DEN (12:25 PM) 10 minutes Late

DEN (12:25 PM) 10 minutes Late # 1534 DEN (1:20 PM) # 1534 DEN (1:20 PM) -

  • IAD (6:06 PM) On Time

IAD (6:06 PM) On Time

slide-27
SLIDE 27

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 27 27

Challenges in Building Challenges in Building Monitoring Agents Monitoring Agents

! ! Problem

Problem

! ! Information gathering may involve accessing and

Information gathering may involve accessing and integrating data from many sources integrating data from many sources

! ! Total time to execute these plans may be large

Total time to execute these plans may be large

! ! Why?

Why?

! ! Slow remote sources

Slow remote sources

! ! Unpredictable network latencies

Unpredictable network latencies

! ! Binding patterns

Binding patterns

! ! Source cannot be queried until a previous query has been

Source cannot be queried until a previous query has been answered answered

! ! Result: execution is often I/O

Result: execution is often I/O-

  • bound

bound

slide-28
SLIDE 28

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 28 28

Theseus Agent Execution System Theseus Agent Execution System

! ! Plan language

Plan language and

and execution system

execution system for Web

for Web-

  • based

based information integration information integration

! ! Expressive enough for monitoring a variety of sources

Expressive enough for monitoring a variety of sources

! ! Efficient enough for real

Efficient enough for real-

  • time monitoring

time monitoring

Theseus

Executor

PLAN myplan { INPUT: x OUTPUT: y BODY { Op (x : y) } } 01010101010110 00011101101011 11010101010101

Plan Input Data

slide-29
SLIDE 29

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 29 29

Streaming Dataflow Streaming Dataflow

! ! Plans consist of a network of operators

Plans consist of a network of operators

! ! Examples

Examples: : Wrapper

Wrapper,

, Select

Select, etc.

, etc.

! ! Operators produce and consume data

Operators produce and consume data

! ! Operators “fire” upon any input data

Operators “fire” upon any input data

Wrapper Select Join Wrapper

Address 100 Main St., Santa Monica, 90292 520 4th St. Santa Monica, 90292 2 Ocean Blvd, Venice, 90292

City State Max Price Santa Monica CA 200000

Input relation Output r elation Plan

slide-30
SLIDE 30

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 30 30

Current Work Current Work

! ! Challenge: How to build monitoring agents without

Challenge: How to build monitoring agents without the need to program them? the need to program them?

! ! We are developing an agent wizard that leads the

We are developing an agent wizard that leads the user through a series of questions and then builds user through a series of questions and then builds the required agent the required agent

slide-31
SLIDE 31

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 31 31

Outline Outline

! ! Agent Access to Online Sources

Agent Access to Online Sources

! ! Interactive Planning of a Trip

Interactive Planning of a Trip

! ! Building Agents for Monitoring Travel

Building Agents for Monitoring Travel

! ! Mining Online Sources to Optimize Travel

Mining Online Sources to Optimize Travel

! ! Conclusions

Conclusions

slide-32
SLIDE 32

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 32 32

Mining Online Sources to Mining Online Sources to Optimize Travel Optimize Travel

! ! Wealth of online data provides many

Wealth of online data provides many

  • pportunities for data mining
  • pportunities for data mining

! ! Two examples:

Two examples:

! ! Predicting flight delays from historical flight

Predicting flight delays from historical flight delays and weather forecasts delays and weather forecasts

! ! Predicting airline prices to minimize cost

Predicting airline prices to minimize cost

slide-33
SLIDE 33

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 33 33

Predicting Weather Predicting Weather-

  • related

related Flight Delays Flight Delays

Historical Flight Data Historical Weather Data

Prediction

Agent

Learned Flight Delay Predictor Learned Flight Delay Predictor Learned Flight Delay Predictor

slide-34
SLIDE 34

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 34 34

Predicting Airline Prices Predicting Airline Prices

250 750 1250 1750 2250 12/8/2002 12/13/2002 12/18/2002 12/23/2002 12/28/2002 1/2/2003 1/7/2003

Date Price

Americ erican A an Airl rlin ines f es flight ghts1 s192 & & 223, 223, LA LAX-BOS, de depart parting on J

  • n Jan.
  • an. 2 &

2 & 9 9

slide-35
SLIDE 35

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 35 35

Hamlet: To Buy or Not to Buy Hamlet: To Buy or Not to Buy

! ! Collected airline flight data over several months

Collected airline flight data over several months

! ! Developed a learning algorithm to predict whether

Developed a learning algorithm to predict whether to buy immediately or wait to buy a ticket to buy immediately or wait to buy a ticket

! ! Exploits the fact that airline pricing is done with a

Exploits the fact that airline pricing is done with a relatively static, but unknown algorithm relatively static, but unknown algorithm

! ! Pricing can be learned by considering the pricing

Pricing can be learned by considering the pricing

  • n the same flight on previous days
  • n the same flight on previous days
slide-36
SLIDE 36

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 36 36

Data Set Data Set

! ! Extracted data from online sources using

Extracted data from online sources using wrappers wrappers

! ! Collected over 12,000 price observations:

Collected over 12,000 price observations:

! ! Lowest available fare for a one

Lowest available fare for a one-

  • week

week roundtrip roundtrip

! ! LAX

LAX-

  • BOS and SEA

BOS and SEA-

  • IAD

IAD

! ! 6 airlines including American, United, etc.

6 airlines including American, United, etc.

! ! 21 days before each flight, every 3 hours

21 days before each flight, every 3 hours

slide-37
SLIDE 37

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 37 37

Learning Algorithm Learning Algorithm

! !

Stacking with three base learners: Stacking with three base learners:

1. 1.

Rule learning (Ripper) (e.g., R= Rule learning (Ripper) (e.g., R= wait wait) )

2. 2.

Time series Time series

3. 3.

Q Q-

  • learning (e.g., Q=

learning (e.g., Q= buy buy) )

! !

Ripper used as the meta Ripper used as the meta-

  • level learner.

level learner.

! !

Output: classifies each decision point as Output: classifies each decision point as ‘buy’ ‘buy’ or

  • r ‘wait’

‘wait’. .

slide-38
SLIDE 38

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 38 38

Experimental Results Experimental Results

! ! Real

Real price data; Simulated passengers price data; Simulated passengers

! ! Learner run once per day on “past data”

Learner run once per day on “past data”

! ! Execution: label each purchase point until

Execution: label each purchase point until buy buy (or sell out) (or sell out)

! ! Compute savings (or loss)

Compute savings (or loss)

slide-39
SLIDE 39

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 39 39

Savings by Method Savings by Method

Method Savings Losses Upgrade Cost % Upgrades Net Savings % Savings % of Optimal Optimal $320,572 $0 $0 0% $320,572 7.0% 100.0% By hand $228,318 $35,329 $22,472 0.36% $170,517 3.8% 53.2% Ripper $211,031 $4,689 $33,340 0.45% $173,002 3.8% 54.0% Time Series $269,879 $6,138 $693,105 33.00%

  • $429,364
  • 9.5%
  • 134.0%

Q-learning $228,663 $46,873 $29,444 0.49% $152,364 3.4% 47.5% Hamlet $244,868 $8,051 $38,743 0.42% $198,074 4.4% 61.8%

  • Savings over “buy now”.
  • Penalty for sell out = upgrade cost.
  • Total ticket cost is $4,579,600.
slide-40
SLIDE 40

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 40 40

Savings by Method Savings by Method

Net Savings by Method

$0 $50,000 $100,000 $150,000 $200,000 $250,000 $300,000 $350,000

  • 9.5%

3.4% 3.8% 3.8% 4.4% 7.0%

Legend: Time Series Q-Learning By Hand Ripper Hamlet Optimal

slide-41
SLIDE 41

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 41 41

Upgrade Penalty Upgrade Penalty

Method Upgrade Cost % Upgrades Optimal $0 0% By hand $22,472 0.36% Ripper $33,340 0.45% Time Series $693,105 33.00% Q-learning $29,444 0.49% Hamlet $38,743 0.42%

slide-42
SLIDE 42

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 42 42

Savings on Savings on “Feasible” Flights “Feasible” Flights

Method Net Savings Optimal 30.6% By hand 21.8% Ripper 20.1% Time Series 25.8% Q-learning 21.8% Hamlet 23.8%

Comparison of Net Savings (as a percent

  • f total ticket price) on Feasible Flights

! ! 24% of the time savings possible

24% of the time savings possible

slide-43
SLIDE 43

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 43 43

Conclusions Conclusions

! ! The Web provides unprecedented access to data

The Web provides unprecedented access to data

! ! Build wrappers to turn these sources into agent

Build wrappers to turn these sources into agent-

  • enabled

enabled sources sources

! ! Combine these sources to build an integrated travel

Combine these sources to build an integrated travel planning system planning system

! ! Automatically generate a set of agents to monitor all

Automatically generate a set of agents to monitor all aspects of a travel plan aspects of a travel plan

! ! Mine the data sources to advise a traveler about prices,

Mine the data sources to advise a traveler about prices, chances of delays, etc. chances of delays, etc.

! ! There are many more uses of this widely available data…

There are many more uses of this widely available data…

slide-44
SLIDE 44

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 44 44

More Information More Information

! ! Email:

Email: knoblock@isi.edu knoblock@isi.edu

! ! Papers available from my homepage:

Papers available from my homepage: http:// http:// www.isi.edu/~ knoblock www.isi.edu/~ knoblock

slide-45
SLIDE 45

Backup Backup

slide-46
SLIDE 46

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 46 46

Ripper Ripper

wait THEN BOS

  • LAX

route AND 2223 price AND 252 takeoff

  • before
  • hours

IF = ≥ ≥

  • Features include price, airline, route, hours-

before-takeoff, etc.

  • Learned 20-30 rules…
slide-47
SLIDE 47

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 47 47

Simple Time Series Simple Time Series

! ! Predict price using a fixed window of

Predict price using a fixed window of k k price observations weighted by price observations weighted by α

α.

.

! ! We used a linearly increasing function for

We used a linearly increasing function for

α α

∑ ∑

= = + − + = k i k i i k t t

i p i p

1 1 1

) ( ) ( α α

slide-48
SLIDE 48

Craig Knoblock Craig Knoblock University of Southern California University of Southern California 48 48

Q Q-

  • learning

learning

Natural fit to problem Natural fit to problem

( ) ( ) ( ) ( )

s a Q s a R s a Q

a

′ ′ ⋅ + =

, max , , γ

( ) ( ) ( ) ( ) ( ) ( )

   ′ ′ − = − =

  • therwise.

, , , max . after

  • ut

sells flight if 300000 , , s w Q s b Q s s w Q s price s b Q