Refine
Year of publication
- 1998 (147) (remove)
Document Type
- Preprint (109)
- Article (21)
- Doctoral Thesis (7)
- Lecture (3)
- Report (3)
- Diploma Thesis (1)
- Master's Thesis (1)
- Periodical Part (1)
- Working Paper (1)
Keywords
- AG-RESY (13)
- PARO (12)
- SKALP (9)
- Case Based Reasoning (4)
- industrial robots (4)
- motion planning (3)
- parallel processing (3)
- CIM-OSA (2)
- HANDFLEX (2)
- Kalman filtering (2)
- TOVE (2)
- coset enumeration (2)
- on-line algorithms (2)
- particle methods (2)
- path planning (2)
- search algorithms (2)
- subgroup problem (2)
- Analysis (1)
- Boltzmann Equation (1)
- C5H3(SiMe3)2-Liganden (1)
- CFD (1)
- Chirale Induktion (1)
- Cobalt-Halbsandwichkomplexe (1)
- Complexity (1)
- Correspondence with other notations (1)
- Dependency Factors (1)
- Dirichlet series (1)
- Distributed Software Development (1)
- EXPRESS-G (1)
- Electron states in low-dimensional structures (1)
- Enterprise modeling (1)
- Enterprise modelling (1)
- Funktionalanalysis (1)
- Grid Graphs (1)
- Gröbner base (1)
- Gröbner bases (1)
- Gröbner bases in monoid and group rings (1)
- HOT (1)
- Hilbert transform (1)
- Ill-Posed Problems (1)
- Indexierung (1)
- Inhaltserschließung (1)
- Integral (1)
- Integration (1)
- Internet Based Software Process Management Environment (1)
- Kallianpur-Robbins law (1)
- Koordinationschemie (1)
- Kristallographie (1)
- LCSH (1)
- Learning systems (1)
- Lebesque-Integral (1)
- Linear Integral Equations (1)
- MEGI (1)
- MILOS (1)
- Monoid and group rings (1)
- Monotone dynamical systems (1)
- Navier-Stokes (1)
- Nonlinear dynamics (1)
- Numerical Simulation (1)
- Ontolingua (1)
- Ontology (1)
- PC-based robot control (1)
- PERA (1)
- Phosphor (1)
- Pn (1)
- Quantum mechanics (1)
- RSWK (1)
- Rarefied Gas Flows (1)
- Rayleigh Number (1)
- Recurrent neural networks (1)
- Riemann-Siegel formula (1)
- Riemannsche Summen (1)
- Robust reliability (1)
- SWEEPING (1)
- Simultaneous quantifier elimination (1)
- Singularity theory (1)
- Treppenfunktionen (1)
- Tunneling (1)
- UML (1)
- Vorlesungsskript (1)
- WETICE 98 (1)
- Wannier-Bloch resonance states (1)
- Wannier-Stark systems (1)
- adaptive grid generation (1)
- area loss (1)
- automated proof planner (1)
- bi-directional search (1)
- center and median problems (1)
- chaos (1)
- cholesterische Phasen (1)
- client/server-architecture (1)
- confluence (1)
- convex models (1)
- crack diagnosis (1)
- cusp forms (1)
- da (1)
- damage diagnosis (1)
- discretization (1)
- distributed and parallel processing (1)
- distributed control system (1)
- distributed processing (1)
- domain decomposition (1)
- exact fully discrete vectorial wavelet transform (1)
- fixpoint theorem (1)
- fluid dynamic equations (1)
- graph search (1)
- higher order (1)
- higher order tableau (1)
- initial value representation (1)
- kinetic equations (1)
- kinetic models (1)
- konvexe Analysis (1)
- level set method (1)
- lifetime statistics (1)
- lifetimes (1)
- locational analysis (1)
- log averaging methods (1)
- molekularer Chiralitätswechselwirkungstensor (1)
- monoid- and group-presentations (1)
- moving contact line (1)
- multi-hypothesis diagnosis (1)
- natural language semantics (1)
- non-linear dynamics (1)
- numerics for pdes (1)
- occupation measure (1)
- off-line programming (1)
- planar Brownian motion (1)
- prefix reduction (1)
- prefix string rewriting (1)
- prefix-rewriting (1)
- proof presentation (1)
- pyramid scheme (1)
- quantum chaos (1)
- quantum mechanics (1)
- quasienergy (1)
- rarefied gas flows (1)
- ratio ergodic theorem (1)
- reinitialization (1)
- resonances (1)
- robot calibration (1)
- robot control architectures (1)
- robot motion planning (1)
- rotating machinery (1)
- scale discrete spherical vector wavelets (1)
- search algorithm (1)
- search alogorithms (1)
- semiclassical (1)
- sequent calculus (1)
- skolemization (1)
- stationary solutions (1)
- steady Boltzmann equation (1)
- strong theorems (1)
- subgroup presentation problem (1)
- theorem prover (1)
- trajectory optimization (1)
- variable cardinality case (1)
- vectorial multiresolution analysis (1)
- vehicular traffic (1)
Faculty / Organisational entity
- Kaiserslautern - Fachbereich Informatik (38)
- Kaiserslautern - Fachbereich Mathematik (35)
- Kaiserslautern - Fachbereich Physik (35)
- Fraunhofer (ITWM) (12)
- Kaiserslautern - Fachbereich Wirtschaftswissenschaften (9)
- Kaiserslautern - Fachbereich Elektrotechnik und Informationstechnik (6)
- Kaiserslautern - Fachbereich Maschinenbau und Verfahrenstechnik (6)
- Kaiserslautern - Fachbereich Biologie (3)
- Kaiserslautern - Fachbereich Chemie (2)
- Universitätsbibliothek (1)
Vorgestellt wird ein System basierend auf einem 3D-Scanner nach dem Licht- schnitt-Prinzip mit dem es möglich ist, einen Menschen innerhalb von 1,5 Sekun- den dreidimensional zu erfassen. Mit Hilfe von Evolutionären Algorithmen wird über eine modellbasierte Dateninterpretation die Auswertung der Meßdaten betrie- ben, so daß beliebige Körpermaße ermittelt werden können. Das Ergebnis ist ein individualisiertes CAD-Modells der Person im Rechner. Ein derartiges Modell kann als virtuelle Kleiderpuppe zur Produktion von Maßbekleidung dienen.
This paper presents a new approach to parallel path planning for industrial robot arms with six degrees of freedom in an on-line given 3D environment. The method is based a best-first search algorithm and needs no essential off-line computations. The algorithm works in an implicitly discrete configuration space. Collisions are detected in the Cartesian workspace by hierarchical distance computation based on polyhedral models of the robot and the obstacles. By decomposing the 6D configuration space into hypercubes and cyclically mapping them onto multiple processing units, a good load distribution can be achieved. We have implemented the parallel path planner on a workstation cluster with 9 PCs and tested the planner for several benchmark environments. With optimal discretisation, the new approach usually shows very good speedups. In on-line provided environments with static obstacles, the parallel planning times are only a few seconds.
The World Wide Web is a medium through which a manufacturer may allow Internet visitors to customize or compose his products. Due to missing or rapidly changing standards these applications are often restricted to relatively simple CGI or JAVA based scripts. Usually, results like images or movies are stored in a database and are transferred on demand to the web-user. Viper (Visualisierung parametrisch editierbarer Raumkomponenten) is a Toolkit [VIP96] written in C++ and JAVA which provides 3D-modeling and visualization methodsfor developing complex web-based applications. The Toolkit has been designed to built a prototype, which can be used to construct and visualize prefabricated homes on the Internet. Alternative applications are outlined in this paper. Within Viper, all objects are stored in a scene graph (VSSG ), which is the basic data structure of the Toolkit. To show the concept and structure of the Toolkit, functionality, and implementation of the prototype are described.
A practical distributed planning and control system for industrial robots is presented. The hierarchical concept consists of three independent levels. Each level is modularly implemented and supplies an application interface (API) to the next higher level. At the top level, we propose an automatic motion planner. The motion planner is based on a best-first search algorithm and needs no essential off-line computations. At the middle level, we propose a PC-based robot control architecture, which can easily be adapted to any industrial kinematics and application. Based on a client/server-principle, the control unit estab-lishes an open user interface for including application specific programs. At the bottom level, we propose a flexible and modular concept for the integration of the distributed motion control units based on the CAN bus. The concept allows an on-line adaptation of the control parameters according to the robot's configuration. This implies high accuracy for the path execution and improves the overall system performance.
We derive a new class of particle methods for conservation laws, which are based on numerical flux functions to model the interactions between moving particles. The derivation is similar to that of classical Finite-Volume methods; except that the fixed grid structure in the Finite-Volume method is substituted by so-called mass packets of particles. We give some numerical results on a shock wave solution for Burgers equation as well as the well-known one-dimensional shock tube problem.
In the present paper multilane models for vehicular traffic are considered. A microscopic multilane model based on reaction thresholds is developed. Based on this model an Enskog like kinetic model is developed. In particular, care is taken to incorporate the correlations between the vehicles. From the kinetic model a fluid dynamic model is derived. The macroscopic coefficients are deduced from the underlying kinetic model. Numerical simulations are presented for all three levels of description in [10]. Moreover, a comparison of the results is given there.
In this paper the work presented in [6] is continued. The present paper contains detailed numerical investigations of the models developed there. A numerical method to treat the kinetic equations obtained in [6] are presented and results of the simulations are shown. Moreover, the stochastic correlation model used in [6] is described and investigated in more detail.
In this paper the kinetic model for vehicular traffic developed in [3,4] is considered and theoretical results for the space homogeneous kinetic equation are presented. Existence and uniqueness results for the time dependent equation are stated. An investigation of the stationary equation leads to a boundary value problem for an ordinary differential equation. Existence of the solution and some properties are proved. A numerical investigation of the stationary equation is included.
Groups can be studied using methods from different fields such as combinatorial group theory or string rewriting. Recently techniques from Gröbner basis theory for free monoid rings (non-commutative polynomial rings) respectively free group rings have been added to the set of methods due to the fact that monoid and group presentations (in terms of string rewriting systems) can be linked to special polynomials called binomials. In the same mood, the aim of this paper is to discuss the relation between Nielsen reduced sets of generators and the Todd-Coxeter coset enumeration procedure on the one side and the Gröbner basis theory for free group rings on the other. While it is well-known that there is a strong relationship between Buchberger's algorithm and the Knuth-Bendix completion procedure, and there are interpretations of the Todd-Coxeter coset enumeration procedure using the Knuth-Bendix procedure for special cases, our aim is to show how a verbatim interpretation of the Todd-Coxeter procedure can be obtained by linking recent Gröbner techniques like prefix Gröbner bases and the FGLM algorithm as a tool to study the duality of ideals. As a side product our procedure computes Nielsen reduced generating sets for subgroups in finitely generated free groups.
We present a parallel control architecture for industrial robot cells. It is based on closed functional components arranged in a flat communication hierarchy. The components may be executed by different processing elements, and each component itself may run on multiple processing elements. The system is driven by the instructions of a central cell control component. We set up necessary requirements for industrial robot cells and possible parallelization levels. These are met by the suggested robot control architecture. As an example we present a robot work cell and a component for motion planning, which fits well in this concept.
The term enterprise modelling, synonymous with enterprise engineering, refers to methodologies developed for modelling activities, states, time, and cost within an enterprise architecture. They serve as a vehicle for evaluating and modelling activities resources etc. CIM - OSA (Computer Integrated Manufacturing Open Systems Architecture) is a methodology for modelling computer integrated environments, and its major objective is the appropriate integration of enterprise operations by means of efficient information exchange within the enterprise. PERA is another methodology for developing models of computer integrated manufacturing environments. The department of industrial engineering in Toronto proposed the development of ontologies as a vehicle for enterprise integration. The paper reviews the work carried out by various researchers and computing departments on the area of enterprise modelling and points out other modelling problems related to enterprise integration.
We present a particle method for the numerical simulation of boundary value problems for the steady-state Boltzmann equation. Referring to some recent results concerning steady-state schemes, the current approach may be used for multi-dimensional problems, where the collision scattering kernel is not restricted to Maxwellian molecules. The efficiency of the new approach is demonstrated by some numerical results obtained from simulations for the (two-dimensional) BEnard's instability in a rarefied gas flow.
In this paper we present a domain decomposition approach for the coupling of Boltzmann and Euler equations. Particle methods are used for both equations. This leads to a simple implementation of the coupling procedure and to natural interface conditions between the two domains. Adaptive time and space discretizations and a direct coupling procedure leads to considerable gains in CPU time compared to a solution of the full Boltzmann equation. Several test cases involving a large range of Knudsen numbers are numerically investigated.
For the determination of the earth" s gravity field many types of observations are available nowadays, e.g., terrestrial gravimetry, airborne gravimetry, satellite-to-satellite tracking, satellite gradiometry etc. The mathematical connection between these observables on the one hand and gravity field and shape of the earth on the other hand, is called the integrated concept of physical geodesy. In this paper harmonic wavelets are introduced by which the gravitational part of the gravity field can be approximated progressively better and better, reflecting an increasing flow of observations. An integrated concept of physical geodesy in terms of harmonic wavelets is presented. Essential tools for approximation are integration formulas relating an integral over an internal sphere to suitable linear combinations of observation functionals, i.e., linear functionals representing the geodetic observables. A scale discrete version of multiresolution is described for approximating the gravitational potential outside and on the earth" s surface. Furthermore, an exact fully discrete wavelet approximation is developed for the case of band-limited wavelets. A method for combined global outer harmonic and local harmonic wavelet modelling is proposed corresponding to realistic earth" s models. As examples, the role of wavelets is discussed for the classical Stokes problem, the oblique derivative problem, satellite-to-satellite tracking, satellite gravity gradiometry, and combined satellite-to-satellite tracking and gradiometry.
The paper presents a process-oriented view on knowledge management in software development. We describe requirements on knowledge management systems from a process-oriented perspective, introduce a process modeling language MILOS and its use for knowledge management. Then we explain how a process-oriented knowledge management system can be implemented using advanced but available information technologies.
A natural extension of SLD-resolution is introduced as a goal directed proof procedure
for the full first order implicational fragment of intuitionistic logic. Its intuitionistic semantic fits a procedural interpretation of logic programming. By allowing arbitrary nested implications it can be used for implementing modularity in logic programs. With adequate negation axioms it gives an alternative to negation as failure and leads to a proof procedure for full first order predicate logic.
Annual Report 1997
(1998)