Situation Calculus Logical Agents Reasoning [Ch 6] Propositional - - PDF document

situation calculus logical agents
SMART_READER_LITE
LIVE PREVIEW

Situation Calculus Logical Agents Reasoning [Ch 6] Propositional - - PDF document

1 RN, Chapter 10.3 Situation Calculus Logical Agents Reasoning [Ch 6] Propositional Logic [Ch 7] Predicate Calculus Representation [Ch 8] Inference [Ch 9] Implemented Systems [Ch 10] Situation Calculus [Ch


slide-1
SLIDE 1

1

Situation Calculus

RN, Chapter 10.3

slide-2
SLIDE 2

2

Logical Agents

  • Reasoning [Ch 6]
  • Propositional Logic [Ch 7]
  • Predicate Calculus
  • Representation [Ch 8]
  • Inference [Ch 9]
  • Implemented Systems [Ch 10]

Situation Calculus [Ch 10.3]

  • Planning [Ch 11]
slide-3
SLIDE 3

3

Typical Wumpus World

slide-4
SLIDE 4

4

Simple Reflex Agent

Rep'n: At time = t, specify

Percept([s,b,g,u,c], t) where s ∈ { Stench, –} , b ∈ { Breeze, –} , …

Eg

Tell(KB, Percept( [Stench, –,Glitter, –, –], 3) )

Connect percepts directly to actions:

s, b, u, c, t Percept([s, b, Glitter, u, c], t)

Action( Grab; t )

Or, more indirectly:

s, b, u, c, t Percept([s, b, Glitter, u, c], t) ⇒

AtGold(t)

t AtGold(t) ⇒ Action(Grab, t)

Q1: Which is more flexible? Q2: Limitations of reflex approach?

slide-5
SLIDE 5

5

Problem with Reflex Agents

slide-6
SLIDE 6

6

Tracking a Changing World

slide-7
SLIDE 7

7

Single-Time Knowledge Base

slide-8
SLIDE 8

8

Problems with Single-Time KBs

slide-9
SLIDE 9

9

Situation Calculus

slide-10
SLIDE 10

10

Updating State, Based on Action

slide-11
SLIDE 11

11

Computing Location

slide-12
SLIDE 12

12

Interpreting Percepts

slide-13
SLIDE 13

13

Deducing Hidden Properties

slide-14
SLIDE 14

14

Using Information

slide-15
SLIDE 15

15

Connecting Inferences to Actions

Rate Each Action

r1 , s WumpusAt(r1 ) & LocationAhead(Agent, s) = r1

Deadly( Forward, s)

r1 , s OK(r1 s) & LocationAhead(Agent,s) = r1 & ¬Visited(r1 ,s)

Good(Forward, s)

r1 , s Gold(r1 ,s ) ⇒ Great( Grab, s )

Choose Best Action

a, s Great(a, s) ⇒ Action(a, s)

a, s Good(a, s) & (¬∃ b Great(b, s)) ⇒ Action(a, s)

Now, for each situation S,

Ask( KB, ∃a Action( a, S) ) . . . find a s.t. KB ⊨ Action( a, S )

slide-16
SLIDE 16

16

Propagating Information

slide-17
SLIDE 17

17

Frame Axioms

slide-18
SLIDE 18

18

Frame, and Related, Problems

Representational Frame Problem

Encoding what doesn't change, as actions take place Solved via “success-state axioms”

Inferential Frame Problem

... deal with long sequences of actions, ..

  • Qualification Problem

dealing with all qualifications ... gold brick is not slippery, not screwed to table, ...

Ramification

When picking up the gold brick, also pick up the

associated dust . . .

slide-19
SLIDE 19

19

Goal-Based Agent

These rules sufficient to FIND gold

Then what?

Need to change strategies:

Was “Find gold” Now: “Get out!”

∀s Holding(Gold, s) ⇒

GoalLocation( [ 1, 1 ], s )

Need to incorporate... How?

slide-20
SLIDE 20

20

How to Plan?

Planning agents seek

plan ≡ sequence of actions that achieve agent's goals.

Inference: Let logical reasoning system perform search:

Ask(KB, ∃ a1 , a2 , a3 , a4 , a5 , t t = Result(a5 ;Result(a4 ;Result(a3 ;Result(a2 ;Result(a1 ; S0 ))))) & Holding(Agent; Gold; t) & At(Agent;Outside; t) )

Problematic, as

not easy to heuristically guide reasoning system. . . What if > 5 actions required? ...

Search: View actions as operations on KB,

Goal = “KB includes Holding(Agent, Gold, t), At(Agent, Outside, t) )"

Planning: Special purpose reasoning systems…

slide-21
SLIDE 21

21

Logical Agents

React to what it perceives Extract abstract descriptions of current state from percepts Maintain internal model of relevant aspects of world

… even those not directly observable

Express and use info about desirability of

actions in circumstances

Use goals in conjunction with knowledge

about actions to construct plans

As all domain-specific knowledge is encoded as logical

formulae, agent is completely generic!

slide-22
SLIDE 22

22

Logic, Uncertainty, and Utility

Advantages of Logic-Based Agents

High-level language for tracking environments. Permits modular decomposition of state

representation.

Limitations of Simple Logic-Based Agents

Cannot track stochastic environments. Cannot represent and reason with utilities –

can't make tradeoffs

slide-23
SLIDE 23

23

Limitations of Situation Calculus

Situation Calculus works well for Wumpus World

But...

“Discrete Actions”

Can't handle continuous actions

Flow of Electrons Control of factory . . .

Action at an “instant”

What if actions have duration?

One action at a time

What if multiple agents? What if world changes spontaneously?

slide-24
SLIDE 24

24

Time and First-Order Logic

Representing & reasoning

with dynamic / changing world is not strong point of first-order logic

Work on different logics:

Eg dynamic logic / nonmonotonic logic

Nonmon: long struggle

Yale shooting problem:

Actions:

load gun / point gun / wait 5 seconds / fire gun

Question:

Is target dead? (was gun loaded when fired)

> 100 research papers since 1986; still not fully resolved

  • First-order Logic better at “static” information