Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Constraint-Based Search

  • Constrain the task by a time horizon, b

  • Formulate this as a constraint satisfaction problem and use backtracking methods to solve it: “do x at time t yes/no”, “do y at time t yes/no”,

  • If there is no solution, increment b

  • Inside backtracking : constraint propagation, conflict analysis are used

  • Constraint-Based Searcg is an “undirected” search i.e. there is no fixed time-order to the decisions done by backtracking

Speaker notes:

Content Tools


There are currently no sources for this slide.