CS6680 - Planning and Constraint Satisfaction

Course Data :

Constraint Satisfaction Problems : Introdcution, Algorithms, Complexity, modeling problems using CSP, Satisfiability ? Introduction, complexity, algorithms ? local search and global search. Satisfiability encoding iemma. Planning ? introduction, complexity, PDDL (syntax). Domain Independent planning, domain description, PDDL (syntax), reduction to satisfiability, reduction to graph search. Heuristic search planners, forward vs. backward search, planning graph. Durative and temporal actions. Planning under uncertainity. GraphPlan, SatPlan, HSP, SAPA.




Credits Type Date of Introduction
3-1-0-4 Elective Oct 2007

Previous Instances of the Course

© 2016 - All Rights Reserved - Dept of CSE, IIT Madras
Website Credits