We propose a dual-resolution scheme to achieve time-efficient autonomous exploration with
one or many robots. The scheme maintains a high-resolution local map of the robot's …

This introductory chapter explains the motivation for develo** decision diagrams as a new
discrete optimization technology. It shows how decision diagrams implement the five main …

We present a method for autonomous exploration in complex three-dimensional (3D)
environments. Our method demonstrates exploration faster than the current state-of-the-art …

We propose a general branch-and-bound algorithm for discrete optimization in which binary
decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In …

In the last decade, decision diagrams (DDs) have been the basis for a large array of novel
approaches for modeling and solving optimization problems. Many techniques now use DDs …

This paper deals with controllability of dynamical networks. It is often unfeasible or
unnecessary to fully control large-scale networks, which motivates the control of a …

Abstract The Constructive Solid Geometry (CSG) tree, encoding the generative process of
an object by a recursive compositional structure of bounded primitives, constitutes an …

This tutorial provides an introduction to the use of decision diagrams for solving discrete
optimization problems. A decision diagram is a graphical representation of the solution …

In this paper we present a technique for solving multiobjective discrete optimization
problems using decision diagrams. The proposed methodology is related to an algorithm …

The branch-and-bound algorithm based on decision diagrams is a framework for solving
discrete optimization problems with a dynamic programming formulation. It works by …