Multi-objective AI planning: comparing aggregation and pareto approaches
Most real-world Planning problems are multi-objective, trying to minimize both the
makespan of the solution plan, and some cost of the actions involved in the plan. But most, if
not all existing approaches are based on single-objective planners, and use an aggregation
of the objectives to remain in the single-objective context. Divide-and-Evolve is an
evolutionary planner that won the temporal deterministic satisficing track at the last
International Planning Competitions (IPC). Like all Evolutionary Algorithms (EA), it can easily …
makespan of the solution plan, and some cost of the actions involved in the plan. But most, if
not all existing approaches are based on single-objective planners, and use an aggregation
of the objectives to remain in the single-objective context. Divide-and-Evolve is an
evolutionary planner that won the temporal deterministic satisficing track at the last
International Planning Competitions (IPC). Like all Evolutionary Algorithms (EA), it can easily …
Multi-Objective AI Planning: Comparing Aggregation and Pareto Approaches
M Redouane Khouadjia, M Schoenauer… - arXiv e …, 2013 - ui.adsabs.harvard.edu
Most real-world Planning problems are multi-objective, trying to minimize both the
makespan of the solution plan, and some cost of the actions involved in the plan. But most, if
not all existing approaches are based on single-objective planners, and use an aggregation
of the objectives to remain in the single-objective context. Divide and Evolve (DaE) is an
evolutionary planner that won the temporal deterministic satisficing track at the last
International Planning Competitions (IPC). Like all Evolutionary Algorithms (EA), it can easily …
makespan of the solution plan, and some cost of the actions involved in the plan. But most, if
not all existing approaches are based on single-objective planners, and use an aggregation
of the objectives to remain in the single-objective context. Divide and Evolve (DaE) is an
evolutionary planner that won the temporal deterministic satisficing track at the last
International Planning Competitions (IPC). Like all Evolutionary Algorithms (EA), it can easily …
Showing the best results for this search. See all results