Refine
H-BRS Bibliography
- yes (45) (remove)
Departments, institutes and facilities
- Fachbereich Informatik (45) (remove)
Document Type
- Conference Object (45) (remove)
Year of publication
- 2017 (45) (remove)
Keywords
- Aerodynamics (2)
- Object recognition (2)
- Virtual Reality (2)
- surrogate modeling (2)
- 3D design (1)
- Active locomotion (1)
- Adaptation of Software (1)
- Alternatives (1)
- Architectural Patterns (1)
- Benchmarking (1)
- CPU (1)
- CSR5BC (1)
- Coloured pointclouds (1)
- Computer Graphics (1)
- Containerization (1)
- Cooperative Awareness Message (1)
- Distributed rendering (1)
- Docker (1)
- Domestic robotics (1)
- Domestic robots (1)
- Evolutionary algorithms (1)
- Eye Tracking (1)
- Fusion (1)
- GPU (1)
- Gaze Behavior (1)
- HCSS (1)
- Head-mounted Display (1)
- Illumination algorithms (1)
- Industrial robots (1)
- Intelligent virtual agents (1)
- Inventory (1)
- LGCSR (1)
- MAP-Elites (1)
- Machine learning (1)
- Modalities (1)
- Model-based fault detection and isolation (1)
- Model-driven Development (1)
- Multi-Tenant Application (1)
- Multimodal (1)
- Multiuser (1)
- NETCONF (1)
- OpenDaylight (1)
- OpenFlow (1)
- Optimisation 3D (1)
- Pseudonym Concept (1)
- Quality Diversity (1)
- RGB-D data (1)
- Ray Tracing (1)
- Requirements analysis (1)
- Robot competitions (1)
- SDN (1)
- Serious Games (1)
- Service-Oriented Architecture (1)
- Social Virtual Reality (1)
- Software and Architecture (1)
- SpMV (1)
- Sparse matrix format (1)
- Surrogate Modelling (1)
- Synthetic perception (1)
- Textureless objects (1)
- Tiled-display walls (1)
- Touchscreen interaction (1)
- Transparency (1)
- UAV teleoperation (1)
- Usability (1)
- User Interface Design (1)
- VR system design (1)
- Variability Management (1)
- Vehicle-to-Vehicle Communication (1)
- Virtual Environments (1)
- Virtual attention (1)
- WiFi-based Long Distance (WiLD) (1)
- Xeon Phi knights landing (1)
- YANG (1)
- activation function (1)
- bagging (1)
- bloat (1)
- diagnostic bond graphs (1)
- directional antennas (1)
- evolutionary illumination (1)
- exploration (1)
- eye-tracking (1)
- foveated rendering (1)
- generation of ARRs (1)
- generative design (1)
- haptics (1)
- heterogeneous networks (1)
- ideal switches (1)
- interference (1)
- mode switching LTI models (1)
- motion cueing (1)
- natural user interface (1)
- neuroevolution (1)
- parallel difference visualization (1)
- regression (1)
- remote-controlled robots (1)
- virtual locomotion (1)
- virtual reality (1)
- visuohaptic feedback (1)
This paper presents the b-it-bots RoboCup@Work team and its current hardware and functional architecture for the KUKA youBot robot. We describe the underlying software framework and the developed capabilities required for operating in industrial environments including features such as reliable and precise navigation, flexible manipulation and robust object recognition.
This paper proposes a novel approach to the generation of state equations from a bond graph (BG) of a mode switching linear time invariant model. Fast state transitions are modelled by ideal or non-ideal switches. Fixed causalities are assigned following the Standard Causality Assignment Procedure such that the number of storage elements in integral causality is maximised. A system of differential and algebraic equations (DAEs) is derived from the BG that holds for all system modes. It is distinguished between storage elements with mode independent causality and those that change causality due to switch state changes.
Wo Laborexperimente zu aufwendig, zu teuer, zu langsam oder zu gefährlich oder Stoffeigenschaften gar nicht erst experimentell zugänglich sind, können Computersimulationen von Atomen und Molekülen diese ersetzen oder ergänzen. Sie ermöglichen dadurch Reduktion von Kosten, Entwicklungszeit und Materialeinsatz. Die für diese Simulationen benötigten Molekülmodelle beinhalten zahlreiche Parameter, die der Simulant einstellen oder auswählen muss. Eine passende Parametrierung ist nur bei entsprechenden Kenntnissen über die Auswirkungen der Parameter auf die zu berechnenden Größen und Eigenschaften möglich. Eine Gruppe von Standardparametern in molekularen Simulationen sind die Partialladungen der einzelnen Atome innerhalb eines Moleküls. Die räumliche Ladungsverteilung innerhalb des Moleküls wird durch Punktladungen auf den Atomzentren angenähert. Für diese Annäherung existieren diverse Ansätze für verschiedene Molekülklassen und Anwendungen. In diesem Teilprojekt des Promotionsvorhabens wurde systematisch der Einfluss der Wahl des Partialladungssatzes auf potentielle Energien und ausgewählte makroskopische Eigenschaften aus Molekulardynamik-Simulationen evaluiert. Es konnte gezeigt werden, dass insbesondere bei stark polaren Molekülen die Auswahl des geeigneten Partialladungssatzes entscheidenden Einfluss auf die Simulationsergebnisse hat und daher nicht naiv, sondern nur ganz gezielt getroffen werden darf.
In diesem Artikel wird darüber berichtet, ob die Glaubwürdigkeit von Avataren als mögliches Modulationskriterium für die virtuelle Expositionstherapie von Agoraphobie in Frage kommt. Dafür werden mehrere Glaubwürdigkeitsstufen für Avatare, die hypothetisch einen Einfluss auf die virtuelle Expositionstherapie von Agoraphobie haben könnten sowie ein potentielles Expositionsszenario entwickelt. Die Arbeit kann innerhalb einer Studie einen signifikanten Einfluss der Glaubwürdigkeitsstufen auf Präsenz, Kopräsenz und Realismus aufzeigen.
In order to achieve the highest possible performance, the ray traversal and intersection routines at the core of every high-performance ray tracer are usually hand-coded, heavily optimized, and implemented separately for each hardware platform—even though they share most of their algorithmic core. The results are implementations that heavily mix algorithmic aspects with hardware and implementation details, making the code non-portable and difficult to change and maintain.
In this paper, we present a new approach that offers the ability to define in a functional language a set of conceptual, high-level language abstractions that are optimized away by a special compiler in order to maximize performance. Using this abstraction mechanism we separate a generic ray traversal and intersection algorithm from its low-level aspects that are specific to the target hardware. We demonstrate that our code is not only significantly more flexible, simpler to write, and more concise but also that the compiled results perform as well as state-of-the-art implementations on any of the tested CPU and GPU platforms.
Real-World Performance of current Mesh Protocols in a small-scale Dual-Radio Multi-Link Environment
(2017)
Two key questions motivated the work in this paper: What is the impact of different usage schemes for multiple channels in a dual-radio Wireless Mesh Network (WMN), and what is the impact of some popular WMN routing protocols on its performance. These two questions were evaluated in a small and simple real-world scenario. A major concern was reproducibility of the results. We show that it is beneficial to use both radios on different frequencies in a fully meshed environment with four routers. The routing protocols Babel, B.A.T.M.A.N. V, BMX7 and OLSRv2 recognize a saturated channel and prefer the other one. We show that in our scenario all of the protocols perform equally well since the protocol overhead is comparably low not influencing the overall performance of the network.
We present a new interface for interactive comparisons of more than two alternative documents in the context of a generative design system that uses generative data-flow networks defined via directed acyclic graphs. To better show differences between such networks, we emphasize added, deleted, (un)changed nodes and edges. We emphasize differences in the output as well as parameters using highlighting and enable post-hoc merging of the state of a parameter across a selected set of alternatives. To minimize visual clutter, we introduce new difference visualizations for selected nodes and alternatives using additive and subtractive encodings, which improve readability and keep visual clutter low. We analyzed similarities in networks from a set of alternative designs produced by architecture students and found that the number of similarities outweighs the differences, which motivates use of subtractive encoding. We ran a user study to evaluate the two main proposed difference visualization encodings and found that they are equally effective.
Simulating eye movements for virtual humans or avatars can improve social experiences in virtual reality (VR) games, especially when wearing head mounted displays. While other researchers have already demonstrated the importance of simulating meaningful eye movements, we compare three gaze models with different levels of fidelity regarding realism: (1) a base model with static fixation and saccadic movements, (2) a proposed simulation model that extends the saccadic model with gaze shifts based on a neural network, and (3) a user's real eye movements recorded by a proprietary eye tracker. Our between-groups design study with 42 subjects evaluates impact of eye movements on social VR user experience regarding perceived quality of communication and presence. The tasks include free conversation and two guessing games in a co-located setting. Results indicate that a high quality of communication in co-located VR can be achieved without using extended gaze behavior models besides saccadic simulation. Users might have to gain more experience with VR technology before being able to notice subtle details in gaze animation. In the future, remote VR collaboration involving different tasks requires further investigation.
Populating virtual worlds with intelligent agents can drastically improve a user's sense of presence. Applying these worlds to virtual training, simulations, or (serious) games, often requires multiple agents to be simulated in real time. The process of generating believable agent behavior starts with providing a plausible perception and attention process that is both efficient and controllable. We describe a conceptual framework for synthetic perception that specifically considers the mentioned requirements: plausibility, real-time performance, and controllability. A sample implementation will focus on sensing, attention, and memory to demonstrate the framework's capabilities in a real-time game engine scenario. A combination of dynamic geometric sensing and false coloring with static saliency information is provided to exemplify the collection of environmental stimuli. The subsequent attention process handles both bottom-up processing and task-oriented, top-down factors. Behavioral results can be influenced by controlling memory and attention The example case is demonstrated and discussed alongside future extensions.
Integration of Multi-modal Cues in Synthetic Attention Processes to Drive Virtual Agent Behavior
(2017)
OpenDaylight (ODL) is a commercial, collaborative, open-source platform to accelerate the adoption and innovation of Software Defined Networking (SDN) and Network Function Visualization. This paper describes the novel ODL architecture in a simplified way to grasp a better understanding of such architecture. ODL architecture intends to foster new innovation and accelerate adoption of programming the network. The innovation of Model-Driven Service Abstraction Layer (MD-SAL) in the architecture leads to developing models for automatic management and configuration of the networks. MD-SAL provides ODL with the ability to support any protocol talking to the network elements as well as any network application. The flexibility inherent in ODL architecture could enable ODL to shape the next generation networks.
The MAP-Elites algorithm produces a set of high-performing solutions that vary according to features defined by the user. This technique to 'illuminate' the problem space through the lens of chosen features has the potential to be a powerful tool for exploring design spaces, but is limited by the need for numerous evaluations. The Surrogate-Assisted Illumination (SAIL) algorithm, introduced here, integrates approximative models and intelligent sampling of the objective function to minimize the number of evaluations required by MAP-Elites.
The ability of SAIL to efficiently produce both accurate models and diverse high-performing solutions is illustrated on a 2D airfoil design problem. The search space is divided into bins, each holding a design with a different combination of features. In each bin SAIL produces a better performing solution than MAP-Elites, and requires several orders of magnitude fewer evaluations. The CMA-ES algorithm was used to produce an optimal design in each bin: with the same number of evaluations required by CMA-ES to find a near-optimal solution in a single bin, SAIL finds solutions of similar quality in every bin.
A new method for design space exploration and optimization, Surrogate-Assisted Illumination (SAIL), is presented. Inspired by robotics techniques designed to produce diverse repertoires of behaviors for use in damage recovery, SAIL produces diverse designs that vary according to features specified by the designer. By producing high-performing designs with varied combinations of user-defined features a map of the design space is created. This map illuminates the relationship between the chosen features and performance, and can aid designers in identifying promising design concepts. SAIL is designed for use with compu-tationally expensive design problems, such as fluid or structural dynamics, and integrates approximative models and intelligent sampling of the objective function to minimize the number of function evaluations required. On a 2D airfoil optimization problem SAIL is shown to produce hundreds of diverse designs which perform competitively with those found by state-of-the-art black box optimization. Its capabilities are further illustrated in a more expensive 3D aerodynamic optimization task.
WiFi-based Long Distance (WiLD) networks have emerged as a promising alternative approach for Internet in rural areas. The main hardware components of these networks are commercial off-the-shelf WiFi radios and directional antennas. During our experiences with real-world WiLD networks, we encountered that interference among long-distance links is a major issue even with high gain directional antennas. In this work, we are providing an in-depth analysis of these interference effects by conducting simulations in ns-3. To closely match the real-world interference effects, we implemented a module to load radiation pattern of commonly used antennas. We analyze two different interference scenarios typically present as a part of larger networks. The results show that side-lobes of directional antennas significantly influence the throughput of long-distance WiFi links depending on the orientation. This work emphasizes that the usage of simple directional antenna models needs to be considered carefully.
Evolutionary illumination is a recent technique that allows producing many diverse, optimal solutions in a map of manually defined features. To support the large amount of objective function evaluations, surrogate model assistance was recently introduced. Illumination models need to represent many more, diverse optimal regions than classical surrogate models. In this PhD thesis, we propose to decompose the sample set, decreasing model complexity, by hierarchically segmenting the training set according to their coordinates in feature space. An ensemble of diverse models can then be trained to serve as a surrogate to illumination.
Neuroevolution methods evolve the weights of a neural network, and in some cases the topology, but little work has been done to analyze the effect of evolving the activation functions of individual nodes on network size, an important factor when training networks with a small number of samples. In this work we extend the neuroevolution algorithm NEAT to evolve the activation function of neurons in addition to the topology and weights of the network. The size and performance of networks produced using NEAT with uniform activation in all nodes, or homogenous networks, is compared to networks which contain a mixture of activation functions, or heterogenous networks. For a number of regression and classification benchmarks it is shown that, (1) qualitatively different activation functions lead to different results in homogeneous networks, (2) the heterogeneous version of NEAT is able to select well performing activation functions, (3) the produced heterogeneous networks are significantly smaller than homogeneous networks.
While executing actions, service robots may experience external faults because of insufficient knowledge about the actions' preconditions. The possibility of encountering such faults can be minimised if symbolic and geometric precondition models are combined into a representation that specifies how and where actions should be executed. This work investigates the problem of learning such action execution models and the manner in which those models can be generalised. In particular, we develop a template-based representation of execution models, which we call delta models, and describe how symbolic template representations and geometric success probability distributions can be combined for generalising the templates beyond the problem instances on which they are created. Our experimental analysis, which is performed with two physical robot platforms, shows that delta models can describe execution-specific knowledge reliably, thus serving as a viable model for avoiding the occurrence of external faults.
Exploring Gridmap-based Interfaces for the Remote Control of UAVs under Bandwidth Limitations
(2017)
RPSL meets lightning: A model-based approach to design space exploration of robot perception systems
(2017)
A plethora of architectural patterns and elements for developing service-oriented applications can be gathered from the state-of-the-art. Most of these approaches are merely applicable for single-tenant applications. However, less methodical support is provided for scenarios, in which multiple different tenants with varying requirements access the same application stack concurrently. In order to fill this gap, both novel and existing architectural patterns, architectural elements, as well as fundamental design decisions must be considered and integrated into a framework that leverages the devel- opment of multi-tenant application. This paper addresses this demand and presents the SOAdapt framework. It promotes the development of adaptable multi-tenant applications based on a service-oriented architecture that is capable of incorporating specific requirements of new tenants in a flexible manner.