Extended Object Tracking (EOT) plays a crucial role in various applications within robotics, signal processing, and control, especially with advancements in sensing technology enabling multiple measurements per target. This paper proposes a novel EOT method based on Gaussian Processes (GPs), incorporating an extension for range measurements and explicitly accounting for uncertainties in Cartesian coordinates. We introduce an efficient method for the integration of uncertainty propagation. Empirical evaluations using Root Mean Square Error (RMSE), Chamfer Distance (CD), and mean Intersection-over-Union (mIoU) demonstrate the superior performance of our method compared to existing GP-based techniques. Additionally, we assess model credibility by comparing the Average Normalized Estimation Error Squared (ANEES) of the existing approach with our proposed method.

With the growing availability of high-resolution sensors, processing more than one detection per target becomes increasingly critical when tracking multiple extended objects. However, contemporary sensors often generate spurious detections that need to be considered. Naively employing standard multitarget trackers may result in poor tracking performance for multitarget–multidetection tracking in cluttered environments, and the relevant extensions are nontrivial. This paper introduces a version of the kernel symmetric measurement equation (SME) filter that considers both multidetections and clutter. For a simulated scenario, our novel filter achieved a higher accuracy than the global nearest neighbor (GNN) and a fast variant of the joint probabilistic data association filter (JPDAF).

We aim to approximate the distribution of the first-passage time of a particle moving according to a Gaussian process with increasing trend, i. e., the distribution of the first time a particle described, e.g., by a state-space model such as a constant-velocity or constant-acceleration model, arrives at a fixed location. Since the known approaches from the literature either consider processes from different families or lead to highly complex approximations, we seek a fast-to-compute method for the problem. Motivated by an engineering particle transport task for which we can assume that once a particle has arrived at this 10-cation it cannot move back, we derive an analytic approximation for the first-passage time probabilities and calculate its inverse cumulative distribution function analytically and the moments numerically. Furthermore, we propose a Gaussian approximation based on a linearization approach. The strengths and limitations of our methods are discussed and by comparison with Monte Carlo simulations, we show that in particular, the first one satisfies the requirements of engineering problems in terms of accuracy and computation time.

We present a novel sample reduction scheme for random variables belonging to the SE(2) group by means of Dirac mixture approximation. For this, dual quaternions are employed to represent uncertain planar transformations. The Cramér-von Mises distance is modified as a smooth metric to measure the statistical distance between Dirac mixtures on the manifold of planar dual quaternions. Samples of reduced size are then obtained by minimizing the probability divergence via Riemannian optimization while interpreting the correlation between rotation and translation. We further deploy the proposed scheme for nonparametric modeling of estimates for nonlinear SE(2) estimation. Simulations show superior tracking performance of the sample reduction-based filter compared with Monte Carlo-based as well as parametric model-based planar dual quaternion filters.

Estimating orientations of objects in Euclidean space is an omnipresent challenge in robotics and autonomous systems. A useful representation of orientations involves unit quaternions. While the space of all unit quaternions forms a three-dimensional unit hypersphere, inverting the sign of a quaternion does not change the orientation described by it. Therefore, all possible orientations can be described by considering only a hemisphere of the unit hypersphere. In this paper, we propose a grid filter for arbitrary-dimensional unit hyperhemispheres and apply it to an orientation estimation task and another evaluation scenario. Our approach outperforms previous approaches that consider densities on the entire hypersphere.

Estimation of periodic quantities such as angles or phase values is a common problem. However, standard approaches, for example the Kalman filter and extensions thereof, have difficulties when estimating periodic quantities. To address this problem, circular filtering algorithms have been proposed but they are limited to just a single angle. In order to deal with multiple, possibly correlated angles, toroidal filtering algorithms are necessary. We have previously proposed a bivariate filtering algorithm on the torus [1] that is limited to identity system and measurement models. In this paper, we show how the algorithm can be extended to handle nonlinear system and measurement models. The novel approach relies on the bivariate wrapped normal distribution for representing the uncertainty and it makes use of a deterministic sampling scheme for the torus. We provide a thorough evaluation of the proposed method using simulations.

For distributed estimation, algorithms have to be specifically crafted to minimize communication between the sensor nodes. As an adjusted version of the regular Kalman filter, the distributed Kalman filter (DKF) allows for deriving optimal results while not requiring regular communication. To achieve this, the DKF requires that each node has full knowledge about the system model and measurement models of all nodes. However, the DKF is not sufficient if the characteristics of the errors in the system and measurement models are not purely stochastic. In this paper, we present a distributed version of a combined stochastic and set-membership Kalman filter. The proposed filter optimizes the approximations of the set-membership uncertainties and can even yield better results than the regular centralized filter.

With the ubiquity of information distributed in networks, performing recursive Bayesian estimation using distributed calculations is becoming more and more important. There are a wide variety of algorithms catering to different applications and requiring different degrees of knowledge about the other nodes involved. One recently developed algorithm is the distributed Kalman filter (DKF), which assumes that all knowledge about the measurements, except the measurements themselves, are known to all nodes. If this condition is met, the DKF allows deriving the optimal estimate if all information is combined in one node at an arbitrary time step. In this paper, we present an information form of the distributed Kalman filter (IDKF) that allows the use of explicit system inputs at the individual nodes while still yielding the same results as a centralized Kalman filter.