Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constraint Processing
Efficient interactive configuration of unbounded modular systems
Proceedings of the 2006 ACM symposium on Applied computing
A BDD-based polytime algorithm for cost-bounded interactive configuration
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Distributed constraint optimization with structured resource constraints
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Planning with MIP for supply restoration in power distribution systems
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Recovering from power outages is an essential task in distribution of electricity. Our industrial partner postulates that the recovery should be interactive rather than automatic: supporting the operator by preventing choices that destabilize the network. Interactive configurators, successfully used in specifying products and services, support users in selecting logically constrained parameters in a sound, complete and backtrack-free manner. Interactive restoration algorithms based on reduced ordered binary decision diagrams (BDDs) had been developed also for power distribution networks, however they did not scale to the large instances, as BDDs representing these could not be compiled. We discuss the theoretical hardness of the interactive configuration and then provide techniques used to compile two classes of networks. We handle the largest industrial instances available. Our techniques rely on symbolic reachability computation, early variable quantification, domain specific ordering heuristics and conjunctive decomposition.