We propose an approach to configuration planning for robotic systems in which plans are represented as constraint networks and planning is defined as search in the space of such networks. The approach supports reasoning about time, resources, and information dependencies between actions. In addition, the system can leverage the flexibility of such networks at execution time to support dynamic goal posting and re-planning.