Refine
H-BRS Bibliography
- yes (56) (remove)
Departments, institutes and facilities
- Fachbereich Informatik (42)
- Institute of Visual Computing (IVC) (17)
- Fachbereich Ingenieurwissenschaften und Kommunikation (12)
- Institut für Technik, Ressourcenschonung und Energieeffizienz (TREE) (11)
- Institut für Cyber Security & Privacy (ICSP) (7)
- Institut für funktionale Gen-Analytik (IFGA) (4)
- Fachbereich Angewandte Naturwissenschaften (2)
- Fachbereich Wirtschaftswissenschaften (2)
- Institut für Sicherheitsforschung (ISF) (1)
Document Type
- Conference Object (56) (remove)
Year of publication
- 2014 (56) (remove)
Language
- English (56) (remove)
Keywords
- education (2)
- path planning (2)
- Application Software (1)
- Applied and Practice-Oriented Research (1)
- Augmented reality (1)
- BFS (1)
- Business Sector (1)
- Control (1)
- Domain Expert (1)
- Eclipse Modeling Framework (1)
Robust Indoor Localization Using Optimal Fusion Filter For Sensors And Map Layout Information
(2014)
Adapting plans to changes in the environment by finding alternatives and taking advantage of opportunities is a common human behavior. The need for such behavior is often rooted in the uncertainty produced by our incomplete knowledge of the environment. While several existing planning approaches deal with such issues, artificial agents still lack the robustness that humans display in accomplishing their tasks. In this work, we address this brittleness by combining Hierarchical Task Network planning, Description Logics, and the notions of affordances and conceptual similarity. The approach allows a domestic service robot to find ways to get a job done by making substitutions. We show how knowledge is modeled, how the reasoning process is used to create a constrained planning problem, and how the system handles cases where plan generation fails due to missing/unavailable objects. The results of the evaluation for two tasks in a domestic service domain show the viability of the approach in finding and making the appropriate goal transformations.
Level-Synchronous Parallel Breadth-First Search Algorithms For Multicore and Multiprocessor Systems
(2014)
Breadth-First Search (BFS) is a graph traversal technique used in many applications as a building block, e.g.,~to systematically explore a search space. For modern multicore processors and as application graphs get larger, well-performing parallel algorithms are favourable. In this paper, we systematically evaluate an important class of parallel BFS algorithms and discuss programming optimization techniques for their implementation. We concentrate our discussion on level-synchronous algorithms for larger multicore and multiprocessor systems. In our results, we show that for small core counts many of these algorithms show rather similar behaviour. But, for large core counts and large graphs, there are considerable differences in performance and scalability influenced by several factors. This paper gives advice, which algorithm should be used under which circumstances.
The RoCKIn@Work Challenge
(2014)