Pareto analysis with uncertainty

M. Hendriks, M.C.W. Geilen, T. Basten

Research output: Book/ReportReportAcademic

7 Citations (Scopus)

Abstract

Pareto analysis is a broadly applicable method to model and analyze tradeoffs in multi-objective optimization problems. The set of Pareto optimal solutions is guaranteed to contain the best solution for any arbitrary cost function or selection procedure. This work introduces a method to explicitly take uncertainty into account during Pareto analysis. A solution is not modeled by a single point in the solution space, but rather by a set of such points. This is useful in settings with much uncertainty, such as during model-based design space exploration for embedded systems. A bounding-box abstraction is introduced as a finite representation of Pareto optimal solutions under uncertainty. It is shown that the set of Pareto optimal solutions in the proposed approach still captures exactly the potentially best solutions for any cost function as well as any way of reducing the amount of uncertainty. During model-based design space exploration, for instance, design and implementation choices that are made during the development process reduce the amount of uncertainty. Steps in such a refinement trajectory can render previously Pareto optimal solutions suboptimal. The presented results provide a way to ensure that early selections in the refinement process remain valid.
Original languageEnglish
Place of PublicationEindhoven
PublisherEindhoven University of Technology
Number of pages12
Publication statusPublished - 2011

Publication series

NameES reports
Volume2011-01
ISSN (Print)1574-9517

Fingerprint

Dive into the research topics of 'Pareto analysis with uncertainty'. Together they form a unique fingerprint.

Cite this