Three Myths and One Question Myth II Myth III on Optimal Planning - - PowerPoint PPT Presentation

three myths and one question
SMART_READER_LITE
LIVE PREVIEW

Three Myths and One Question Myth II Myth III on Optimal Planning - - PowerPoint PPT Presentation

Why me? Myth I Three Myths and One Question Myth II Myth III on Optimal Planning Research Question Summary Carmel Domshlak Festivus 2008 Raos call to invite yourself to the panel of plaintiffs Rao Since the last two editions have


slide-1
SLIDE 1

Why me? Myth I Myth II Myth III Question Summary

Three Myths and One Question

  • n Optimal Planning Research

Carmel Domshlak Festivus 2008

slide-2
SLIDE 2

Why me? Myth I Myth II Myth III Question Summary

Rao’s call to invite yourself to the panel of plaintiffs

Rao Since the last two editions have focused a bit much on the old people venting, we are particularly interested in hearing from the up-and-coming members of the community

slide-3
SLIDE 3

Why me? Myth I Myth II Myth III Question Summary

Rao’s call to invite yourself to the panel of plaintiffs

Rao Since the last two editions have focused a bit much on the old people venting, we are particularly interested in hearing from the up-and-coming members of the community me to Rao May I speak?

slide-4
SLIDE 4

Why me? Myth I Myth II Myth III Question Summary

Rao’s call to invite yourself to the panel of plaintiffs

Rao Since the last two editions have focused a bit much on the old people venting, we are particularly interested in hearing from the up-and-coming members of the community me to Rao May I speak? Rao to me OK ...

slide-5
SLIDE 5

Why me? Myth I Myth II Myth III Question Summary

Rao’s call to invite yourself to the panel of plaintiffs

Rao Since the last two editions have focused a bit much on the old people venting, we are particularly interested in hearing from the up-and-coming members of the community me to Rao May I speak? Rao to me OK ... me to my wife whauu, I am “up-and-coming”!!!

slide-6
SLIDE 6

Why me? Myth I Myth II Myth III Question Summary

Rao’s call to invite yourself to the panel of plaintiffs

my wife looked at me ... and suggested to re-read Rao’s call

slide-7
SLIDE 7

Why me? Myth I Myth II Myth III Question Summary

Rao’s call to invite yourself to the panel of plaintiffs

Rao Since the last two editions have focused a bit much on the old people venting, we are particularly interested in hearing from the up-and-coming (or at least only-recently-balding) members of the community

slide-8
SLIDE 8

Why me? Myth I Myth II Myth III Question Summary

Heuristic-Search Workshop ICAPS’07

Some claims Malte & Gabi In planning, good admissible heuristics are insufficient for efficient optimal planning Audience Why should we care in AI about optimal planning? I looked for the roots of that question, and distilled for you some urban myths

slide-9
SLIDE 9

Why me? Myth I Myth II Myth III Question Summary

Myth n. 1

In many papers: If you do optimal heuristic-search planning, then you need an admissible heuristic Problem: Usually interpreted as If you do optimal heuristic-search planning, then and only then you need an admissible heuristic

slide-10
SLIDE 10

Why me? Myth I Myth II Myth III Question Summary

Myth n. 1

In many papers: If you do optimal heuristic-search planning, then you need an admissible heuristic Problem: Usually interpreted as If you do optimal heuristic-search planning, then and only then you need an admissible heuristic For me, “admissible” ≈ “can say something concrete about” clear notion of improving heuristics (empirical/formal) clear sense of composing heuristics (max/add/opt-add) usability in search-space learning (a la LRTA⋆) ...

slide-11
SLIDE 11

Why me? Myth I Myth II Myth III Question Summary

Myth n. 2

In many papers: If no optimality is required, then better go with inadmissible heuristics because they are more informative Problem: Where this really comes from? no theoretical justification (to say the least) no (real) empirical justification based on (???)

1

HSP’s hadd vs. hmax

2

the glory of FF

3

slow progress in admissible heuristics until very recently

slide-12
SLIDE 12

Why me? Myth I Myth II Myth III Question Summary

Myth n. 2

In many papers: If no optimality is required, then better go with inadmissible heuristics because they are more informative Problem: Where this really comes from? no theoretical justification (to say the least) no (real) empirical justification based on (???)

1

HSP’s hadd vs. hmax

2

the glory of FF

3

slow progress in admissible heuristics until very recently

slide-13
SLIDE 13

Why me? Myth I Myth II Myth III Question Summary

Myth n. 2

In many papers: If no optimality is required, then better go with inadmissible heuristics because they are more informative Problem: Where this really comes from? no theoretical justification (to say the least) no (real) empirical justification based on (???)

1

HSP’s hadd vs. hmax

2

the glory of FF

3

slow progress in admissible heuristics until very recently

slide-14
SLIDE 14

Why me? Myth I Myth II Myth III Question Summary

Myth n. 3

In many papers: Heuristic computation should be of low polynomial time (because it is evaluated at every visited state)

slide-15
SLIDE 15

Why me? Myth I Myth II Myth III Question Summary

Myth n. 3

In many papers: Heuristic computation should be of low polynomial time (because it is evaluated at every visited state) Heretic question: Why?

slide-16
SLIDE 16

Why me? Myth I Myth II Myth III Question Summary

Myth n. 3

In many papers: Heuristic computation should be of low polynomial time (because it is evaluated at every visited state) Heretic question: Why? what is “low”? (papers: consensus around O(n2)?) hmm ... some of the basic algorithms in CS should be announced “inefficient” if exponential number of open nodes, then who cares if the heuristic computation is fast? lets focus on informativeness (and pay for it!) pray for hardware technology guys :)

slide-17
SLIDE 17

Why me? Myth I Myth II Myth III Question Summary

Myth n. 3

In many papers: Heuristic computation should be of low polynomial time (because it is evaluated at every visited state) Heretic question: Why? what is “low”? (papers: consensus around O(n2)?) hmm ... some of the basic algorithms in CS should be announced “inefficient” if exponential number of open nodes, then who cares if the heuristic computation is fast? lets focus on informativeness (and pay for it!) pray for hardware technology guys :)

slide-18
SLIDE 18

Why me? Myth I Myth II Myth III Question Summary

What kind of planning is (more) important?

Candidates

1 Optimal 2 Fast 3 Satisficing

slide-19
SLIDE 19

Why me? Myth I Myth II Myth III Question Summary

What kind of planning is (more) important?

Candidates

1 Optimal 2 Fast 3 Satisficing

My answer to myself ALL because all help to develop new mathematical and engineering ideas NONE because our customers (remember Rao’s talk last year?) need something else (where {NASA, Turing-Test} ⊂ Customers)

slide-20
SLIDE 20

Why me? Myth I Myth II Myth III Question Summary

What kind of planning is (more) important?

Candidates

1 Optimal 2 Fast 3 Satisficing

My answer to myself ALL because all help to develop new mathematical and engineering ideas NONE because our customers (remember Rao’s talk last year?) need something else (where {NASA, Turing-Test} ⊂ Customers) Want to know why? Buy me a beer!

slide-21
SLIDE 21

Why me? Myth I Myth II Myth III Question Summary

Three Myths and One Question

Myth I admissible heuristics are only for optimal planning Myth II inadmissible heuristics are more informative Myth III heuristic computation should be of low polynomial time Question what kind of planning is most important?