Informed sampling-based trajectory planner for automated driving in dynamic urban environments

The urban environment is amongst the most difficult domains for autonomous vehicles. The vehicle must be able to plan a safe route on challenging road layouts, in the presence of various dynamic traffic participants such as vehicles, cyclists and pedestrians and in various environmental conditions. The challenge remains to have motion planners...

Distributed constraint optimization for continuous mobile sensor coordination

DCOP (Distributed Constraint optimization Problem) is a framework for representing distributed multi- agent problems. However, it only allows discrete values for the decision variables, which limits its application for real-world problems. In this paper, an extension of DCOP is investigated to handle variables with continuous domains....

Degree distribution and assortativity in line graphs of complex networks

Topological characteristics of links of complex networks influence the dynamical processes executed on networks triggered by links, such as cascading failures triggered by links in power grids and epidemic spread due to link infection. The line graph transforms links in the original graph into nodes. In this paper, we investigate how graph...

Fast multiprocessor scheduling with fixed task binding of large scale industrial cyber physical systems

Latest trends in embedded platform architectures show a steady shift from high frequency single core platforms to lower-frequency but highly-parallel execution platforms. Scheduling applications with stringent latency requirements on such multiprocessor platforms is challenging. Our work is motivated by the scheduling challenges faced by ASML,...

Computer-assisted tree taxonomy by automated image recognition

We present an algorithm that performs image-based queries within the domain of tree taxonomy. As such, it serves as an example relevant to many other potential applications within the field of biodiversity and photo-identification. Unsupervised matching results are produced through a chain of computer vision and image processing techniques,...

History matching using a multiscale Ensemble Kalman Filter

Since the first version of Kalman Filter was introduced in 1960 it received a lot of attention in mathematical and engineering world. There are many successful successors like for example Ensemble Kalman Filter (Evensen 1996) which has been applied also for reservoir engineering problems. The method proposed in [Zhou et al. 2007] draws together...

The relationship between information prioritization and visual distinctness in two progressive image transmission schemes

The goal of this paper is to analyze the relation between the visual distinctness and the priority assigned to the information in two di2erent progressive transmission schemes: the Set Partitioning in Hierarchical Trees (SPIHT) and the Rational Embedded Wavelet Image Coding (REWIC). SPIHT assigns priority based on the mean squared-error (MSE)...

An operational and denotational approach to non-context-freeness

The main result of this paper is a description of linguistically motivated non-context-free phenomena equivalently in terms of regular tree languages (to express the recursive properties) and both a logical and an operational perspective (to establish the intended linguistic relations). The result is exemplified with a particular non-context...