This paper presents a meta-objective optimization approach, called Bi-Goal Evolution
(BiGE), to deal with multi-objective optimization problems with many objectives. In multi …

Planning problems of practical relevance commonly include multiple objectives that are
difficult to weight a priori. Several heuristic search algorithms computing the Pareto front of …

YAHSP3 (Vidal 2004) is a forward state-space heuristic search planner that embeds a
lookahead policy based on an analysis of relaxed plans. The core of the solver has nearly …

Cost-optimal planning is a variant of a general planning problem, where all actions have
non-negative costs, and the solution is a valid plan that minimizes the sum of the costs of all …

Heuristic search is a powerful approach that has successfully been applied to a broad class
of planning problems, including classical planning, multi-objective planning, and …

In this paper, we focus on how to generate the multi-objective optimal plan in hierarchical
task network (HTN) planning. Many practical HTN planning problems not only require …

Collaborative robots promise to transform work across many industries and promote human-
robot teaming as a novel paradigm. However, realizing this promise requires the …

With the evolution of Web technologies, various services have become available in a
pervasive network environment. Combining simple atomic services into sophisticated …

In at least one embodiment, a method and a system include receiving a trace into a
hypotheses generator from a source a trace, translating the trace and a state transition …

A mechanism is provided for identifying a set of top-m clusters from a set of top-k plans. A
planning problem and an integer value k indicating a number of top plans to be identified …