Welcome to PlanSIG 2011, December 2011

The 29th Workshop of the UK Planning and Scheduling Special Interest Group


THURSDAY 8th December

Session 1: Path Planning

  • 10.00: Munir Naveed, Diane Kitchin and Andrew Crampton
    A Monte-Carlo Policy Rollout Planner for Real-Time Strategy (RTS) Games

  • 10.35: Thuy Truong, Kenneth Brown and Cormac Sreenan
    Integration of Node Deployment and Path Planning in Restoring Network Connectivity

  • 11.10: COFFEE

Session 2: Applications

  • 11.40: Simon Parkinson, Andrew Longstaff, Gary Allen, Andrew Crampton, Simon Fletcher and Allan Myers
    Hierarchical Task Based Process Planning For Machine Tool Calibration

  • 12.15: Roman Barták, Filip Dvořák, Jakub Gemrot, Cyril Brom and Daniel Toropila
    When Planning Should Be Easy: On Solving Relaxed Planning Problems

  • 12.50: LUNCH

Session 3: Extensions to Classical Planning

  • 14.00: Tomáš Balyo, Daniel Toropila and Roman Barták
    Two Semantics for Step-Parallel Planning: Which One to Choose?

  • 14.35: Derek Long, Maria Fox, Peter Gregory and J Chris Beck
    Planning Modulo Theories: Extending the Planning Paradigm

  • 15.10: TEA

Session 4: Posters and Demos

  • 15.40: 4 x 5 minute poster talks

    • Filip Dvořák and Daniel Toropila
      On Finding and Exploiting Mutual Exclusion in Domain Independent Planning

    • Tim Grant
      Planning in Offensive Cyber Operations: a new domain?

    • Salihin Shoeeb and Lee McCluskey
      Comparing Domain Models

    • Ali Fanan and Lee McCluskey
      Learning operator schema from free & semi-structured text

  • 16.00 - 17.00: Poster / Demo Sessions

FRIDAY 9th December

Session 5: Constraints and Satisfiability

  • 09.15: Ot Ten Thije, Léon Planken and Mathijs De Weerdt
    Maintaining Partial Path Consistency in STNs under Event-Incremental Updates

  • 09.50: Mark Judge and Derek Long
    Heuristically Guided Constraint Satisfaction for Planning

  • 10.25: Michael Cashmore, Maria Fox and Enrico Giunchiglia
    Planning as Quantified Boolean Formula

  • 11.00: COFFEE

Session 6: Domain Analysis

  • 11.30: Bram Ridder and Maria Fox
    Performing a lifted Reachability Analysis as a first step towards lifted Partial Ordered Planning

  • 12.05: Lukas Chrpa
    Theoretical Aspects of Using Learning Techniques for Problem Reformulation in Classical Planning

  • 12.40 LUNCH and Close


Papers Submission:
October 7th, 2011

Notification of Paper's Acceptance:
November 4th, 2011

Camera Ready Manuscript:
November 18th, 2011

December 8th & 9th, 2011

Important dates/deadlines