Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace applications, drug design, and protein folding. This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms. The treatment is centered on robot motion planning but integrates material on planning in discrete spaces. A major part of the book is devoted to planning under uncertainty, including decision theory, Markov decision processes, and information spaces, which are the “configuration spaces” of all sensor-based planning problems. The last part of the book delves into planning under differential constraints that arise when automating the motions of virtually any mechanical system. Developed from courses taught by the author, the book is intended for students, engineers, and researchers in robotics, artificial intelligence, and control theory as well as computer graphics, algorithms, and computational biology.

Planning Algorithms: Introductory Material

In the first part of this paper, we describe the main features of real-world problems for which the outranking approach is appropriate and we present the concept of outranking relations. The second part is devoted to basic ideas and concepts used for building outranking relations. The definition of such outranking relations is given for the main ELECTRE methods in Part 3. The final part of the paper is devoted to some practical considerations.

The outranking approach and the foundations of electre methods

Rough sets theory for multicriteria decision analysis

Real-life decisions are usually made in the state of uncertainty such as randomness and fuzziness. How do we model optimization problems in uncertain environments? How do we solve these models? In order to answer these questions, this book provides a self-contained, comprehensive and up-to-date presentation of uncertain programming theory, including numerous modeling ideas, hybrid intelligent algorithms, and applications in system reliability design, project scheduling problem, vehicle routing problem, facility location problem, and machine scheduling problem. Researchers, practitioners and students in operations research, management science, information science, system science, and engineering will find this work a stimulating and useful reference.

Theory and practice of uncertain programming

In multiple attribute decision analysis (MADA), one often needs to deal with both numerical data and qualitative information with uncertainty. It is essential to properly represent and use uncertain information to conduct rational decision analysis. Based on a multilevel evaluation framework, an evidential reasoning (ER) approach has been developed for supporting such decision analysis, the kernel of which is an ER algorithm developed on the basis of the framework and the evidence combination rule of the Dempster-Shafer (D-S) theory. The approach has been applied to engineering design selection, organizational self-assessment, safety and risk assessment, and supplier assessment. In this paper, the fundamental features of the ER approach are investigated. New schemes for weight normalization and basic probability assignments are proposed. The original ER approach is further developed to enhance the process of aggregating attributes with uncertainty. Utility intervals are proposed to describe the impact of ignorance on decision analysis. Several properties of the new ER approach are explored, which lay the theoretical foundation of the ER approach. A numerical example of a motorcycle evaluation problem is examined using the ER approach. Computation steps and analysis results are provided in order to demonstrate its implementation process.

/pdf/on-the-evidential-reasoning-algorithm-for-multiple-attribute-1d8pxvi4dl.pdf

On the evidential reasoning algorithm for multiple attribute decision analysis under uncertainty

This paper proposes new definitions of lower and upper approximations, which are basic concepts of the rough set theory. These definitions follow naturally from the concept of ambiguity introduced in this paper. The new definitions are compared to the classical definitions and are shown to be more general, in the sense that they are the only ones which can be used for any type of indiscernibility or similarity relation.

A generalized definition of rough approximations based on similarity

https://hal.archives-ouvertes.fr/hal-00158652/document

Min–max and min–max regret versions of combinatorial optimization problems: A survey

Multiple-criteria decision analysis has evolved considerably since its birth during the 1960s. As part of this evolution, several schools of thought have developed emphasizing different techniques and, more generally, different attitudes as to the way of supporting or aiding decision making. One of these schools is now commonly referred to as the ‘European School’, its members being part of a European Working Group entitled ‘Multicriteria Aid for Decisions’. In the first part of this paper (Section 1) we follow a historical perspective in order to trace the emergence of the European School. Its distinctive features and main ideas are then outlined in Section 2. Finally we provide a general review of the current major research topics developed within this framework (Section 3).

The European school of MCDA: Emergence, basic features and current works

Solving efficiently the 0-1 multi-objective knapsack problem

Research in Information Retrieval usually shows performanceimprovement when many sources of evidence are combined to produce a ranking of documents (e.g., texts, pictures, sounds, etc.). In this paper, we focus on the rank aggregation problem, also called data fusion problem, where rankings of documents, searched into the same collection and provided by multiple methods, are combined in order to produce a new ranking. In this context, we propose a rank aggregation method within a multiple criteria framework using aggregation mechanisms based on decision rules identifying positive and negative reasons for judging whether a document should get a better rank than another. We show that the proposed method deals well with the Information Retrieval distinctive features. Experimental results are reported showing that the suggested method performs better than the well-known CombSUM and CombMNZ operators.

/pdf/an-outranking-approach-for-rank-aggregation-in-information-3lzwzpbn7r.pdf

Daniel Vanderpooten

Papers

A generalized definition of rough approximations based on similarity

Min–max and min–max regret versions of combinatorial optimization problems: A survey

The European school of MCDA: Emergence, basic features and current works

Solving efficiently the 0-1 multi-objective knapsack problem

An outranking approach for rank aggregation in information retrieval