Intelligent Exploration of Solution Spaces Exemplified by Industrial
Reconfiguration Management
- URL: http://arxiv.org/abs/2207.01693v1
- Date: Mon, 4 Jul 2022 19:45:48 GMT
- Title: Intelligent Exploration of Solution Spaces Exemplified by Industrial
Reconfiguration Management
- Authors: Timo M\"uller, Benjamin Maschler, Daniel Dittler, Nasser Jazdi and
Michael Weyrich
- Abstract summary: We present a universal methodology for the intelligent exploration of solution spaces.
We derive a use-case specific example from the field of reconfiguration management in industry 4.0.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Many decision-making approaches rely on the exploration of solution spaces
with regards to specified criteria. However, in complex environments,
brute-force exploration strategies are usually not feasible. As an alternative,
we propose the combination of an exploration task's vertical sub-division into
layers representing different sequentially interdependent sub-problems of the
paramount problem and a horizontal sub-division into self-sustained solution
sub-spaces. In this paper, we present a universal methodology for the
intelligent exploration of solution spaces and derive a use-case specific
example from the field of reconfiguration management in industry 4.0.
Related papers
- Combinatorial Optimization with Policy Adaptation using Latent Space Search [44.12073954093942]
We present a novel approach for designing performant algorithms to solve complex, typically NP-hard, problems.
We show that our search strategy outperforms state-of-the-art approaches on 11 standard benchmarking tasks.
arXiv Detail & Related papers (2023-11-13T12:24:54Z) - Factorization of Multi-Agent Sampling-Based Motion Planning [72.42734061131569]
Modern robotics often involves multiple embodied agents operating within a shared environment.
Standard sampling-based algorithms can be used to search for solutions in the robots' joint space.
We integrate the concept of factorization into sampling-based algorithms, which requires only minimal modifications to existing methods.
We present a general implementation of a factorized SBA, derive an analytical gain in terms of sample complexity for PRM*, and showcase empirical results for RRG.
arXiv Detail & Related papers (2023-04-01T15:50:18Z) - A machine learning framework for neighbor generation in metaheuristic
search [4.521119623956821]
We propose a general machine learning framework for neighbor generation in metaheuristic search.
We validate our methodology on two metaheuristic applications.
arXiv Detail & Related papers (2022-12-22T01:58:04Z) - Rushing and Strolling among Answer Sets -- Navigation Made Easy [0.0]
We propose a framework for interactive navigation towards desired subsets of answer sets analogous to faceted browsing.
Our approach enables the user to explore the solution space by consciously zooming in or out of sub-spaces of solutions at a certain pace.
arXiv Detail & Related papers (2021-12-14T17:50:06Z) - Cooperative Exploration for Multi-Agent Deep Reinforcement Learning [127.4746863307944]
We propose cooperative multi-agent exploration (CMAE) for deep reinforcement learning.
The goal is selected from multiple projected state spaces via a normalized entropy-based technique.
We demonstrate that CMAE consistently outperforms baselines on various tasks.
arXiv Detail & Related papers (2021-07-23T20:06:32Z) - Discovering Diverse Solutions in Deep Reinforcement Learning [84.45686627019408]
Reinforcement learning algorithms are typically limited to learning a single solution of a specified task.
We propose an RL method that can learn infinitely many solutions by training a policy conditioned on a continuous or discrete low-dimensional latent variable.
arXiv Detail & Related papers (2021-03-12T04:54:31Z) - CoreDiag: Eliminating Redundancy in Constraint Sets [68.8204255655161]
We present a new algorithm which can be exploited for the determination of minimal cores (minimal non-redundant constraint sets)
The algorithm is especially useful for distributed knowledge engineering scenarios where the degree of redundancy can become high.
In order to show the applicability of our approach, we present an empirical study conducted with commercial configuration knowledge bases.
arXiv Detail & Related papers (2021-02-24T09:16:10Z) - Geometric Entropic Exploration [52.67987687712534]
We introduce a new algorithm that maximises the geometry-aware Shannon entropy of state-visits in both discrete and continuous domains.
Our key theoretical contribution is casting geometry-aware MSVE exploration as a tractable problem of optimising a simple and novel noise-contrastive objective function.
In our experiments, we show the efficiency of GEM in solving several RL problems with sparse rewards, compared against other deep RL exploration approaches.
arXiv Detail & Related papers (2021-01-06T14:15:07Z) - Specialization in Hierarchical Learning Systems [0.0]
We investigate in how far information constraints in hierarchies of experts not only provide a principled method for regularization but also to enforce specialization.
We devise an information-theoretically motivated on-line learning rule that allows partitioning of the problem space into multiple sub-problems that can be solved by the individual experts.
We show the broad applicability of our approach on a range of problems including classification, regression, density estimation, and reinforcement learning problems.
arXiv Detail & Related papers (2020-11-03T17:00:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.