Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Artificial Intelligence
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
Symbolic Heuristic Search Using Decision Diagrams
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Efficient BDDs for bounded arithmetic constraints
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
State-set branching: Leveraging BDDs for heuristic search
Artificial Intelligence
Cost-Optimal Symbolic Planning with State Trajectory and Preference Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Effective approaches for partial satisfaction (over-subscription) planning
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Constraint Based Planning with Composable Substate Graphs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Implicit abstraction heuristics
Journal of Artificial Intelligence Research
Multi-objective AI planning: comparing aggregation and pareto approaches
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Planning as satisfiability with IPC simple preferences and action costs
AI Communications
| Hi-index | 0.00 |
This paper studies the solving of finite-domain action planning problems with discrete action costs and soft constraints. For sequential optimal planning, a symbolic perimeter database heuristic is addressed in a bucket implementation of A*. For computing net-benefits, we propose symbolic branch-and-bound search together with some search refinements. The net-benefit we optimize is the total benefit of satisfying the goals, minus the total action cost to achieve them. This results in an objective function to be minimized that is a linear expression over the violation of the preferences added to the action cost total.