Journal of the ACM (JACM)
Learning by analogical reasoning in general problem-solving
Learning by analogical reasoning in general problem-solving
Multiobjective heuristic search in AND/OR graphs
Journal of Algorithms
Searching game trees under a partial order
Artificial Intelligence
Fast planning through planning graph analysis
Artificial Intelligence
Using regression-match graphs to control search in planning
Artificial Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Beyond the Plan-Length Criterion
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
The LPSAT Engine & Its Application to Resource Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
On Determining and Completeing Incomplete States in STRIPS Domains
ICIIS '99 Proceedings of the 1999 International Conference on Information Intelligence and Systems
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
The GRT planning system: backward heuristic construction in forward state-space planning
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
A robust and fast action selection mechanism for planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Artificial Intelligence
Flow shop scheduling for separation model of set-up and net process based on Branch-and-Bound method
Computers and Industrial Engineering
Contingent planning with goal preferences
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A multiobjective frontier search algorithm
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Planning with partial preference models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A New Approach to Iterative Deepening Multiobjective A*
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Multiobjective A* search with consistent heuristics
Journal of the ACM (JACM)
On-line planning and scheduling: an application to controlling modular printers
Journal of Artificial Intelligence Research
Generating diverse plans to handle unknown and partially known user preferences
Artificial Intelligence
Multi-objective AI planning: comparing aggregation and pareto approaches
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Pareto-based multiobjective AI planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A case of pathology in multiobjective heuristic search
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Modern domain-independent heuristic planners evaluate their plans on the single basis of their length. However, in real-world problems, there are other criteria that also play an important role, e.g., resource consumption, profit, safety, etc. This paper enhances the GRT planner, an efficient domain-independent heuristic state-space planner, with the ability to consider multiple criteria. The GRT heuristic is based on the estimation of the distances between each fact of a problem and the goals. The new planner, called MO-GRT, uses a weighted A strategy and a multiobjective heuristic function, computed over a weighted hierarchy of user-defined criteria. Its computation is based on sets of non-dominated cost-vectors assigned to the problem facts, which estimate the total cost of achieving the facts from the goals, using alternative paths. Experiments show that a change in the criteria weights or scales affects both the quality of the resulting plan and the planning time. The proposed approach can easily be adapted to other modern heuristic state-space planners.