Planning and Scheduling. 2 USC INFORMATION SCIENCES INSTITUTE Some background Many planning problems have a time-dependent component – actions happen

Planning and Scheduling

2USC INFORMATION SCIENCES INSTITUTE

Some background

Many planning problems have a time-dependent component – actions happen over time intervals, goals have time windows when they should be achieved Need to synchronize with other agents

Normal Situation calculus, STRIPS, etc. don’t support this very well

Planners choose actions to achieve goals. Picking a time line is typically seen as scheduling


Handling time in planners

How should we model temporal problems

Do we need new planning algorithms or will modifications on others be enough?

Can we plan first, then schedule? Should the two be merged?


Different time-related issues in planning

If actions take different time intervals, partial-order planners must account for this

Actions with continuous effects – e.g. drive truck from LA to San Francisco

Concurrent/simultaneous actions – may have different effects or preconditions


Actions with continuous effects

Drive from LA to SF takes 5 hours. Location changes continuously

If the action gets interrupted – e.g. need to recall the truck 1 hour later. Where is it?

Some approaches: situation calculus with differential equations for the state, event calculus.


Concurrent actions

Synergy: to open the door, hold handle down and pull simultaneously – neither action achieves anything alone

Interference: if two actions require the same resource (e.g. a spanner), cannot both take place simultaneously


Generalizing STRIPS

STRIPS action: if preconds hold in current situation, can apply action ‘now’, and effects hold in ‘next’ situation.

If action takes place over an interval – should preconds hold just when the action starts? Throughout the interval? When do the effects take place?


Temporal Graph Plan

Consider the question: can we use Graphplan ideas for temporal planning?

What are the problems, if actions have different durations?


TGP action model

STRIPS actions, plus start time, end time, duration

All preconds must hold at the start

Preconds not affected by the action must hold throughout execution

Effects are undefined during execution and only hold at the final time point


Temporal planning graph

Propositions and actions monotonically increasing

Mutexes monotonically decreasing

Nogoods are monotonically decreasing

So..


Cyclic planning graph

Earliest start time


Distinguishing mutex conditions

Some mutexes are always true – eternal

Some can become false – conditional

Action/Proposition mutex



Propagating mutexes

Can maintain which are conditional or eternal mutexes:

Note: these are temporal conditions, essentially on when instances of A and P can coexist


Solution extraction


Dealing with uncountable choices..

The algorithm makes every action take place as late as possible by using persistence ONLY when nothing else would work.


Approximating mutex conditions

Checking disjunctions can be expensive, so try to maintain a form like


Conclusions

Can extend mutex reasoning to temporal case

But it’s not easy!


ASPEN

Combine planning and scheduling steps as alternative ‘conflict repair’ operations

Activities have start time, end time, duration

Maintain ‘most-commitment’ approach – easier to reason about temporal dependencies with full information C.f. TLPlan


Temporal constraints


Activity decompositions


Conflict types


Contributors for a non-depletable resource violation


Contributors for a depletable resource violation


Domain-independent heuristics

Prefer to solve conflicts that require new activities, then timeline conflicts

To repair a conflict, prefer moving activities, then adding a new activity

Try to solve conflicts while introducing as few others as possible


Conclusions

Successfully integrates planning and scheduling

Does it do so in the most profitable way?

What can we say about guarantees for the algorithm?

Documents

Planning and Scheduling. 2 USC INFORMATION SCIENCES INSTITUTE Some background Many planning problems have a time-dependent component – actions happen