9,007 research outputs found
Tracking moving optima using Kalman-based predictions
The dynamic optimization problem concerns finding an optimum in a changing environment. In the field of evolutionary algorithms, this implies dealing with a timechanging fitness landscape. In this paper we compare different techniques for integrating motion information into an evolutionary algorithm, in the case it has to follow a time-changing optimum, under the assumption that the changes follow a nonrandom law. Such a law can be estimated in order to improve the optimum tracking capabilities of the algorithm. In particular, we will focus on first order dynamical laws to track moving objects. A vision-based tracking robotic application is used as testbed for experimental comparison
Recommended from our members
High-speed multi-dimensional relative navigation for uncooperative space objects
This work proposes a high-speed Light Detection and Ranging (LIDAR) based navigation architecture that is appropriate for uncooperative relative space navigation applications. In contrast to current solutions that exploit 3D LIDAR data, our architecture transforms the odometry problem from the 3D space into multiple 2.5D ones and completes the odometry problem by utilizing a recursive filtering scheme. Trials evaluate several current state-of-the-art 2D keypoint detection and local feature description methods as well as recursive filtering techniques on a number of simulated but credible scenarios that involve a satellite model developed by Thales Alenia Space (France). Most appealing performance is attained by the 2D keypoint detector Good Features to Track (GFFT) combined with the feature descriptor KAZE, that are further combined with either the Hâ or the Kalman recursive filter. Experimental results demonstrate that compared to current algorithms, the GFTT/KAZE combination is highly appealing affording one order of magnitude more accurate odometry and a very low processing burden, which depending on the competitor method, may exceed one order of magnitude faster computation
Invariant EKF Design for Scan Matching-aided Localization
Localization in indoor environments is a technique which estimates the
robot's pose by fusing data from onboard motion sensors with readings of the
environment, in our case obtained by scan matching point clouds captured by a
low-cost Kinect depth camera. We develop both an Invariant Extended Kalman
Filter (IEKF)-based and a Multiplicative Extended Kalman Filter (MEKF)-based
solution to this problem. The two designs are successfully validated in
experiments and demonstrate the advantage of the IEKF design
AUV SLAM and experiments using a mechanical scanning forward-looking sonar
Navigation technology is one of the most important challenges in the applications of autonomous underwater vehicles (AUVs) which navigate in the complex undersea environment. The ability of localizing a robot and accurately mapping its surroundings simultaneously, namely the simultaneous localization and mapping (SLAM) problem, is a key prerequisite of truly autonomous robots. In this paper, a modified-FastSLAM algorithm is proposed and used in the navigation for our C-Ranger research platform, an open-frame AUV. A mechanical scanning imaging sonar is chosen as the active sensor for the AUV. The modified-FastSLAM implements the update relying on the on-board sensors of C-Ranger. On the other hand, the algorithm employs the data association which combines the single particle maximum likelihood method with modified negative evidence method, and uses the rank-based resampling to overcome the particle depletion problem. In order to verify the feasibility of the proposed methods, both simulation experiments and sea trials for C-Ranger are conducted. The experimental results show the modified-FastSLAM employed for the navigation of the C-Ranger AUV is much more effective and accurate compared with the traditional methods
Accurate 3D maps from depth images and motion sensors via nonlinear Kalman filtering
This paper investigates the use of depth images as localisation sensors for
3D map building. The localisation information is derived from the 3D data
thanks to the ICP (Iterative Closest Point) algorithm. The covariance of the
ICP, and thus of the localization error, is analysed, and described by a Fisher
Information Matrix. It is advocated this error can be much reduced if the data
is fused with measurements from other motion sensors, or even with prior
knowledge on the motion. The data fusion is performed by a recently introduced
specific extended Kalman filter, the so-called Invariant EKF, and is directly
based on the estimated covariance of the ICP. The resulting filter is very
natural, and is proved to possess strong properties. Experiments with a Kinect
sensor and a three-axis gyroscope prove clear improvement in the accuracy of
the localization, and thus in the accuracy of the built 3D map.Comment: Submitted to IROS 2012. 8 page
Cooperative localization for mobile agents: a recursive decentralized algorithm based on Kalman filter decoupling
We consider cooperative localization technique for mobile agents with
communication and computation capabilities. We start by provide and overview of
different decentralization strategies in the literature, with special focus on
how these algorithms maintain an account of intrinsic correlations between
state estimate of team members. Then, we present a novel decentralized
cooperative localization algorithm that is a decentralized implementation of a
centralized Extended Kalman Filter for cooperative localization. In this
algorithm, instead of propagating cross-covariance terms, each agent propagates
new intermediate local variables that can be used in an update stage to create
the required propagated cross-covariance terms. Whenever there is a relative
measurement in the network, the algorithm declares the agent making this
measurement as the interim master. By acquiring information from the interim
landmark, the agent the relative measurement is taken from, the interim master
can calculate and broadcast a set of intermediate variables which each robot
can then use to update its estimates to match that of a centralized Extended
Kalman Filter for cooperative localization. Once an update is done, no further
communication is needed until the next relative measurement
- âŚ