Search

This paper considers fusion of dimension-reduced estimates in a decentralized sensor network. The benefits of a decentralized sensor network include modularity, robustness and flexibility. Moreover, since preprocessed data is exchanged between the agents it allows for reduced communication. Nevertheless, in certain applications the communication load is required to be reduced even further. One way to decrease the communication load is to exchange dimension-reduced estimates instead of full estimates. Previous work on this topic assumes global availability of covariance matrices, an assumption which is not realistic in decentralized applications. Hence, in this paper we consider the problem of deriving dimension-reduced estimates using only local information. The proposed solution is based on an estimate of the information common to the network. This common information estimate is computed locally at each agent by fusion of all information that is either received or transmitted by that agent. It is shown how the common information estimate is utilized for fusion of dimension-reduced estimates using two well-known fusion methods: the Kalman fuser which is optimal under the assumption of uncorrelated estimates, and covariance intersection. One main theoretical result is that the common information estimate allows for a decorrelation procedure such that uncorrelated estimates can be maintained. This property is crucial to be able to use the Kalman fuser without double counting of information. A numerical comparison suggests that the performance degradation of using the common information estimate, compared to having local access to the actual covariance matrices computed by other agents, is relatively small., Funding: Industry Excellence Center LINK-SIC - Swedish Governmental Agency for Innovation Systems (VINNOVA); Saab AB

This paper considers fusion of dimension-reduced estimates in a decentralized sensor network. The benefits of a decentralized sensor network include modularity, robustness and flexibility. Moreover, since preprocessed data is exchanged between the agents it allows for reduced communication. Nevertheless, in certain applications the communication load is required to be reduced even further. One way to decrease the communication load is to exchange dimension-reduced estimates instead of full estimates. Previous work on this topic assumes global availability of covariance matrices, an assumption which is not realistic in decentralized applications. Hence, in this paper we consider the problem of deriving dimension-reduced estimates using only local information. The proposed solution is based on an estimate of the information common to the network. This common information estimate is computed locally at each agent by fusion of all information that is either received or transmitted by that agent. It is shown how the common information estimate is utilized for fusion of dimension-reduced estimates using two well-known fusion methods: the Kalman fuser which is optimal under the assumption of uncorrelated estimates, and covariance intersection. One main theoretical result is that the common information estimate allows for a decorrelation procedure such that uncorrelated estimates can be maintained. This property is crucial to be able to use the Kalman fuser without double counting of information. A numerical comparison suggests that the performance degradation of using the common information estimate, compared to having local access to the actual covariance matrices computed by other agents, is relatively small., Funding: Industry Excellence Center LINK-SIC - Swedish Governmental Agency for Innovation Systems (VINNOVA); Saab AB

This paper considers fusion of dimension-reduced estimates in a decentralized sensor network. The benefits of a decentralized sensor network include modularity, robustness and flexibility. Moreover, since preprocessed data is exchanged between the agents it allows for reduced communication. Nevertheless, in certain applications the communication load is required to be reduced even further. One way to decrease the communication load is to exchange dimension-reduced estimates instead of full estimates. Previous work on this topic assumes global availability of covariance matrices, an assumption which is not realistic in decentralized applications. Hence, in this paper we consider the problem of deriving dimension-reduced estimates using only local information. The proposed solution is based on an estimate of the information common to the network. This common information estimate is computed locally at each agent by fusion of all information that is either received or transmitted by that agent. It is shown how the common information estimate is utilized for fusion of dimension-reduced estimates using two well-known fusion methods: the Kalman fuser which is optimal under the assumption of uncorrelated estimates, and covariance intersection. One main theoretical result is that the common information estimate allows for a decorrelation procedure such that uncorrelated estimates can be maintained. This property is crucial to be able to use the Kalman fuser without double counting of information. A numerical comparison suggests that the performance degradation of using the common information estimate, compared to having local access to the actual covariance matrices computed by other agents, is relatively small., Funding: Industry Excellence Center LINK-SIC - Swedish Governmental Agency for Innovation Systems (VINNOVA); Saab AB

This paper considers fusion of dimension-reduced estimates in a decentralized sensor network. The benefits of a decentralized sensor network include modularity, robustness and flexibility. Moreover, since preprocessed data is exchanged between the agents it allows for reduced communication. Nevertheless, in certain applications the communication load is required to be reduced even further. One way to decrease the communication load is to exchange dimension-reduced estimates instead of full estimates. Previous work on this topic assumes global availability of covariance matrices, an assumption which is not realistic in decentralized applications. Hence, in this paper we consider the problem of deriving dimension-reduced estimates using only local information. The proposed solution is based on an estimate of the information common to the network. This common information estimate is computed locally at each agent by fusion of all information that is either received or transmitted by that agent. It is shown how the common information estimate is utilized for fusion of dimension-reduced estimates using two well-known fusion methods: the Kalman fuser which is optimal under the assumption of uncorrelated estimates, and covariance intersection. One main theoretical result is that the common information estimate allows for a decorrelation procedure such that uncorrelated estimates can be maintained. This property is crucial to be able to use the Kalman fuser without double counting of information. A numerical comparison suggests that the performance degradation of using the common information estimate, compared to having local access to the actual covariance matrices computed by other agents, is relatively small., Funding: Industry Excellence Center LINK-SIC - Swedish Governmental Agency for Innovation Systems (VINNOVA); Saab AB

Underwater surveillance using passive sonar and track-before-detect technology requires accurate models of the tracked signal and the background noise. However, in an underwater environment, the signal channel is time-varying and prior knowledge about the spatial distribution of the background noise is unavailable. In this paper, an autoregressive model that captures a time-varying signal level caused by multi-path propagation is presented. In addition, a multi-source model is proposed to describe spatially distributed background noise. The models are used in a Bernoulli filter track-before-detect framework and evaluated using both simulated and sea trial data. The simulations demonstrate clear improvements in terms of target loss and improved ability to discern the target from the noisy background. An evaluation of the track-before-detect algorithm on the sea trial data indicates a performance gain when incorporating the proposed models in underwater surveillance and tracking problems.

This paper proposes the modeling and analysis of multi-energy systems as multilayer networks. The aim is to assess the interdependence between different energy infrastructures. Multilayer network modeling enhances the one-dimensional graph-based approach employed to study the vulnerability and the topological characteristics of power grids. The centrality indices defined for one-dimensional networks are extended to multilayer networks, highlighting the differences emerging when interdependence is considered. The proposed multilayer framework is demonstrated on the 24-bus IEEE power grid coupled with a gas network with 7 nodes.

Hegselmann-Krause (HK) models exhibit complex behaviors which are not easily tractable through mathematical analysis. In this paper, a characterization of the steady-state behaviors of homogeneous HK models and sensitivity to confidence thresholds is discussed by commenting on existing and new numerical results. The typical decreasing of number of clusters and convergence time by increasing the confidence thresholds are discussed and motivations for the behavior of some counterexamples are provided. A tighter upper bound for the dependence of the number of clusters with respect to the confidence thresholds is proposed. Differences and analogies between the opinions evolution for symmetric and asymmetric HK models are commented.

Recent studies of selective auditory attention have demonstrated that neural responses recorded with electroencephalogram (EEG) can be decoded to classify the attended talker in everyday multitalker cocktail-party environments. This is generally referred to as the auditory attention decoding (AAD) and could lead to a breakthrough for the next-generation of hearing aids (HAs) to have the ability to be cognitively controlled. The aim of this paper is to investigate whether cepstral analysis can be used as a more robust mapping between speech and EEG. Our preliminary analysis revealed an average AAD accuracy of 96%. Moreover, we observed a significant increase in auditory attention classification accuracies with our approach over the use of traditional AAD methods (7% absolute increase). Overall, our exploratory study could open a new avenue for developing new AAD methods to further advance hearing technology. We recognize that additional research is needed to elucidate the full potential of cepstral analysis for AAD.

An autonomous underwater vehicle (AUV) is a crewless robotic vehicle that dives into the water and performs without human assistance. This paper focuses on developing trajectory tracking control for bio-mimetic AUV system under uncertain environments. Therefore, a relatively new control technique called time delay-based estimation control is proposed for trajectory tracking under multiple uncertainties. This algorithm estimates the total disturbance in the system using immediate past information of input and output of feedback state and control variables. The benefit of this scheme is that it avoids assumptions about a priori upper bound information of disturbance. Further, the control structure is simple and does not require any high-frequency switching or high gain to nullify the effects of disturbance. The theoretical analysis of the proposed scheme guarantees the uniformly ultimate bounded stability of the closed-loop system. The numerical analysis is also carried out to validate the control performance of the given algorithm for lemniscate reference path tracking.

The classical SIR model is a fundamental building block in most epidemiological models. Despite its widespread use, its properties in filtering and estimation applications are much less well explored. Independently of how the basic SIR model is integrated into more complex models, the fundamental question is whether the states and parameters can be estimated from a fusion of available numeric measurements. The problem studied in this paper focuses on the parameter and state estimation of a stochastic SIR model from assumed direct measurements of the number of infected people in the population, and the generalisation to other measurements is left for future research. In terms of parameter estimation, two components are discussed separately. The first component is model parameter estimation assuming that the all states are measured directly. The second component is state estimation assuming known parameters. These two components are combined into an iterative state and parameter estimator. This iterative method is compared to a straightforward approach based on state augmentation of the unknown parameters. Feasibility of the problem is studied from an information-theoretic point of view using the Cramer Rao Lower Bound (CRLB). Using simulated data resembling the first wave of Covid-19 in Sweden, the iterative method outperforms the state augmentation approach., Scalable Kalman Filters funded by the Swedish Research Council

This paper presents a variant of the Traveling Salesman Problem (TSP) with nonholonomic constraints and dynamic obstacles, with optimal control applications in the mining industry. The problem is discretized and an approach for solving the discretized problem to optimality is proposed. The proposed approach solves the three subproblems (waypoint ordering, heading at each waypoint and motion planning between waypoints) simultaneously using two nested graph-search planners. The higher-level planner solves the waypoint ordering and heading subproblems while making calls to the lower-level planner that solves the motion planning subproblem using a lattice-based motion planner. For the higher-level motion planner A* search is used and two different heuristics, a minimal spanning tree heuristic and a nearest insertion heuristic, are proposed and optimality bounds are proven. The proposed planner is evaluated on numerical examples and compared to Dijkstras algorithm. Furthermore, the performance and observed suboptimality are investigated when the minimal spanning tree heuristic cost is inflated., Funding Agencies|Wallenberg AI, Autonomous Systems and Software Program (WASP) - Knut and Alice Wallenberg Foundation

Motion planning and decision-making while considering uncertainty is critical for an autonomous vehicle to safely and efficiently drive on a highway. This paper presents a new combined two-step approach for this problem, where a partially observable Markov decision process (POMDP) is tightly coupled with a scenario model predictive control (SCMPC) step. To generate the scenarios in the SCMPC step, the solution to the POMDP is used together with a novel scenario-reduction procedure, which selects a small representative subset of all scenarios considered in the POMDP. The resulting planner is evaluated in a simulation study where the impact of the two-step approach and the scenario-reduction method is shown., Funding Agencies|Swedens Innovation Agency

The classical SIR model is a fundamental building block in most epidemiological models. Despite its widespread use, its properties in filtering and estimation applications are much less well explored. Independently of how the basic SIR model is integrated into more complex models, the fundamental question is whether the states and parameters can be estimated from a fusion of available numeric measurements. The problem studied in this paper focuses on the parameter and state estimation of a stochastic SIR model from assumed direct measurements of the number of infected people in the population, and the generalisation to other measurements is left for future research. In terms of parameter estimation, two components are discussed separately. The first component is model parameter estimation assuming that the all states are measured directly. The second component is state estimation assuming known parameters. These two components are combined into an iterative state and parameter estimator. This iterative method is compared to a straightforward approach based on state augmentation of the unknown parameters. Feasibility of the problem is studied from an information-theoretic point of view using the Cramer Rao Lower Bound (CRLB). Using simulated data resembling the first wave of Covid-19 in Sweden, the iterative method outperforms the state augmentation approach., Scalable Kalman Filters funded by the Swedish Research Council

Motion planning and decision-making while considering uncertainty is critical for an autonomous vehicle to safely and efficiently drive on a highway. This paper presents a new combined two-step approach for this problem, where a partially observable Markov decision process (POMDP) is tightly coupled with a scenario model predictive control (SCMPC) step. To generate the scenarios in the SCMPC step, the solution to the POMDP is used together with a novel scenario-reduction procedure, which selects a small representative subset of all scenarios considered in the POMDP. The resulting planner is evaluated in a simulation study where the impact of the two-step approach and the scenario-reduction method is shown., Funding Agencies|Swedens Innovation Agency

This paper presents a variant of the Traveling Salesman Problem (TSP) with nonholonomic constraints and dynamic obstacles, with optimal control applications in the mining industry. The problem is discretized and an approach for solving the discretized problem to optimality is proposed. The proposed approach solves the three subproblems (waypoint ordering, heading at each waypoint and motion planning between waypoints) simultaneously using two nested graph-search planners. The higher-level planner solves the waypoint ordering and heading subproblems while making calls to the lower-level planner that solves the motion planning subproblem using a lattice-based motion planner. For the higher-level motion planner A* search is used and two different heuristics, a minimal spanning tree heuristic and a nearest insertion heuristic, are proposed and optimality bounds are proven. The proposed planner is evaluated on numerical examples and compared to Dijkstras algorithm. Furthermore, the performance and observed suboptimality are investigated when the minimal spanning tree heuristic cost is inflated., Funding Agencies|Wallenberg AI, Autonomous Systems and Software Program (WASP) - Knut and Alice Wallenberg Foundation

The classical SIR model is a fundamental building block in most epidemiological models. Despite its widespread use, its properties in filtering and estimation applications are much less well explored. Independently of how the basic SIR model is integrated into more complex models, the fundamental question is whether the states and parameters can be estimated from a fusion of available numeric measurements. The problem studied in this paper focuses on the parameter and state estimation of a stochastic SIR model from assumed direct measurements of the number of infected people in the population, and the generalisation to other measurements is left for future research. In terms of parameter estimation, two components are discussed separately. The first component is model parameter estimation assuming that the all states are measured directly. The second component is state estimation assuming known parameters. These two components are combined into an iterative state and parameter estimator. This iterative method is compared to a straightforward approach based on state augmentation of the unknown parameters. Feasibility of the problem is studied from an information-theoretic point of view using the Cramer Rao Lower Bound (CRLB). Using simulated data resembling the first wave of Covid-19 in Sweden, the iterative method outperforms the state augmentation approach., Scalable Kalman Filters funded by the Swedish Research Council

Asymptotic theory for the regularized system identification has received increasing interests in recent years. In this paper, for the finite impulse response (FIR) model and filtered white noise inputs, we show the convergence in distribution of the Steins unbiased risk estimator (SURE) based hyper-parameter estimator and find factors that influence its convergence properties. In particular, we consider the ridge regression case to obtain closed-form expressions of the limit of the regression matrix and the variance of the limiting distribution of the SURE based hyper-parameter estimator, and then demonstrate their relation numerically., Funding Agencies|Thousand Youth Talents Plan funded by the central government of China - NSFC [61773329]; Shenzhen Science and Technology Innovation Council [Ji-20170189, JCY20170411102101881]; Robotic Discipline Development Fund from Shenzhen Government [2016-1418]; CUHKSZ [PF. 01.000249, 2014.0003.23]; Swedish Research Council [2019-04956]; Vinnovas center LINKSIC

If a concatenated Friedkin-Johnsen model is used to describe the evolution of the opinions of stubborn agents in a sequence of discussion events, then the social power achieved by the agents at the end of the discussions depends from the stubbornness coefficients adopted by the agents through the sequence of events. In this paper we assume that the agents are free to choose their stubbornness profiles, and ask ourselves what strategy should an agent follow in order to maximize its social power. Formulating the problem as a strategic game, we show that choosing the highest possible values of stubbornness in the early discussions leads to the highest possible social power., Funding Agencies|Swedish Research Council [2020-03701]; China Scholarship Council CSC [202004910739]; Shanghai Municipal Science and Technology Major Project [2021SHZDZX0100]; National Natural Science Foundation of China [61733018]

This paper presents a variant of the Traveling Salesman Problem (TSP) with nonholonomic constraints and dynamic obstacles, with optimal control applications in the mining industry. The problem is discretized and an approach for solving the discretized problem to optimality is proposed. The proposed approach solves the three subproblems (waypoint ordering, heading at each waypoint and motion planning between waypoints) simultaneously using two nested graph-search planners. The higher-level planner solves the waypoint ordering and heading subproblems while making calls to the lower-level planner that solves the motion planning subproblem using a lattice-based motion planner. For the higher-level motion planner A* search is used and two different heuristics, a minimal spanning tree heuristic and a nearest insertion heuristic, are proposed and optimality bounds are proven. The proposed planner is evaluated on numerical examples and compared to Dijkstras algorithm. Furthermore, the performance and observed suboptimality are investigated when the minimal spanning tree heuristic cost is inflated., Funding Agencies|Wallenberg AI, Autonomous Systems and Software Program (WASP) - Knut and Alice Wallenberg Foundation

The classical SIR model is a fundamental building block in most epidemiological models. Despite its widespread use, its properties in filtering and estimation applications are much less well explored. Independently of how the basic SIR model is integrated into more complex models, the fundamental question is whether the states and parameters can be estimated from a fusion of available numeric measurements. The problem studied in this paper focuses on the parameter and state estimation of a stochastic SIR model from assumed direct measurements of the number of infected people in the population, and the generalisation to other measurements is left for future research. In terms of parameter estimation, two components are discussed separately. The first component is model parameter estimation assuming that the all states are measured directly. The second component is state estimation assuming known parameters. These two components are combined into an iterative state and parameter estimator. This iterative method is compared to a straightforward approach based on state augmentation of the unknown parameters. Feasibility of the problem is studied from an information-theoretic point of view using the Cramer Rao Lower Bound (CRLB). Using simulated data resembling the first wave of Covid-19 in Sweden, the iterative method outperforms the state augmentation approach., Scalable Kalman Filters funded by the Swedish Research Council

The classical SIR model is a fundamental building block in most epidemiological models. Despite its widespread use, its properties in filtering and estimation applications are much less well explored. Independently of how the basic SIR model is integrated into more complex models, the fundamental question is whether the states and parameters can be estimated from a fusion of available numeric measurements. The problem studied in this paper focuses on the parameter and state estimation of a stochastic SIR model from assumed direct measurements of the number of infected people in the population, and the generalisation to other measurements is left for future research. In terms of parameter estimation, two components are discussed separately. The first component is model parameter estimation assuming that the all states are measured directly. The second component is state estimation assuming known parameters. These two components are combined into an iterative state and parameter estimator. This iterative method is compared to a straightforward approach based on state augmentation of the unknown parameters. Feasibility of the problem is studied from an information-theoretic point of view using the Cramer Rao Lower Bound (CRLB). Using simulated data resembling the first wave of Covid-19 in Sweden, the iterative method outperforms the state augmentation approach., Scalable Kalman Filters funded by the Swedish Research Council

Motion planning and decision-making while considering uncertainty is critical for an autonomous vehicle to safely and efficiently drive on a highway. This paper presents a new combined two-step approach for this problem, where a partially observable Markov decision process (POMDP) is tightly coupled with a scenario model predictive control (SCMPC) step. To generate the scenarios in the SCMPC step, the solution to the POMDP is used together with a novel scenario-reduction procedure, which selects a small representative subset of all scenarios considered in the POMDP. The resulting planner is evaluated in a simulation study where the impact of the two-step approach and the scenario-reduction method is shown., Funding Agencies|Swedens Innovation Agency

This paper presents a variant of the Traveling Salesman Problem (TSP) with nonholonomic constraints and dynamic obstacles, with optimal control applications in the mining industry. The problem is discretized and an approach for solving the discretized problem to optimality is proposed. The proposed approach solves the three subproblems (waypoint ordering, heading at each waypoint and motion planning between waypoints) simultaneously using two nested graph-search planners. The higher-level planner solves the waypoint ordering and heading subproblems while making calls to the lower-level planner that solves the motion planning subproblem using a lattice-based motion planner. For the higher-level motion planner A* search is used and two different heuristics, a minimal spanning tree heuristic and a nearest insertion heuristic, are proposed and optimality bounds are proven. The proposed planner is evaluated on numerical examples and compared to Dijkstras algorithm. Furthermore, the performance and observed suboptimality are investigated when the minimal spanning tree heuristic cost is inflated., Funding Agencies|Wallenberg AI, Autonomous Systems and Software Program (WASP) - Knut and Alice Wallenberg Foundation

Laplacian dynamics on signed graphs have a richer behavior than those on nonnegative graphs. In particular, their stability is not guaranteed a priori. Consequently, also the time-varying case must be treated with care. In particular, instabilities can occur also when switching in a family of systems each of which corresponds to a stable signed Laplacian. In the paper we obtain sufficient conditions for such a family of signed Laplacians to form a consensus set, i.e., to be stable and converging to consensus for any possible switching pattern. The conditions are that all signed Laplacian matrices are eventually exponentially positive (a Perron-Frobenius type of property) and normal., Funding Agencies|Swedish Research Council [2020-03701]; Shanghai Municipal Science and Technology Major Project [2021SHZDZX0100]; National Natural Science Foundation of China [61733018]

Motion planning and decision-making while considering uncertainty is critical for an autonomous vehicle to safely and efficiently drive on a highway. This paper presents a new combined two-step approach for this problem, where a partially observable Markov decision process (POMDP) is tightly coupled with a scenario model predictive control (SCMPC) step. To generate the scenarios in the SCMPC step, the solution to the POMDP is used together with a novel scenario-reduction procedure, which selects a small representative subset of all scenarios considered in the POMDP. The resulting planner is evaluated in a simulation study where the impact of the two-step approach and the scenario-reduction method is shown., Funding Agencies|Swedens Innovation Agency

Raman spectroscopy in conjunction with a Coded Aperture Snapshot Spectral Imaging (CASSI) system allows for detection of small amounts of explosives from stand-off distances. The obtained Compressed Sensing (CS) measurements from CASSI consists of mixed spatial and spectral information, from which a HyperSpectral Image (HSI) can be reconstructed. The HSI contains Raman spectra for all spatial locations in the scene, revealing the existence of substances. In this paper we present the possibility of utilizing a learned prior in the form of a conditional generative model for HSI reconstruction using CS. A Generative Adversarial Network (GAN) is trained using simulated samples of HSI, and conditioning on their respective CASSI measurements to refine the prior. Two different types of simulated HSI were investigated, where spatial overlap of substances was either allowed or disallowed. The results show that the developed method produces precise reconstructions of HSI from their CASSI measurements in a matter of seconds., Funding Agencies|Security Link project "Compressive Sensing for spektral detektion av explosivamnen"

Motion planning and decision-making while considering uncertainty is critical for an autonomous vehicle to safely and efficiently drive on a highway. This paper presents a new combined two-step approach for this problem, where a partially observable Markov decision process (POMDP) is tightly coupled with a scenario model predictive control (SCMPC) step. To generate the scenarios in the SCMPC step, the solution to the POMDP is used together with a novel scenario-reduction procedure, which selects a small representative subset of all scenarios considered in the POMDP. The resulting planner is evaluated in a simulation study where the impact of the two-step approach and the scenario-reduction method is shown., Funding Agencies|Swedens Innovation Agency

This paper presents a variant of the Traveling Salesman Problem (TSP) with nonholonomic constraints and dynamic obstacles, with optimal control applications in the mining industry. The problem is discretized and an approach for solving the discretized problem to optimality is proposed. The proposed approach solves the three subproblems (waypoint ordering, heading at each waypoint and motion planning between waypoints) simultaneously using two nested graph-search planners. The higher-level planner solves the waypoint ordering and heading subproblems while making calls to the lower-level planner that solves the motion planning subproblem using a lattice-based motion planner. For the higher-level motion planner A* search is used and two different heuristics, a minimal spanning tree heuristic and a nearest insertion heuristic, are proposed and optimality bounds are proven. The proposed planner is evaluated on numerical examples and compared to Dijkstras algorithm. Furthermore, the performance and observed suboptimality are investigated when the minimal spanning tree heuristic cost is inflated., Funding Agencies|Wallenberg AI, Autonomous Systems and Software Program (WASP) - Knut and Alice Wallenberg Foundation

The control system of industrial robots is often model-based, and the quality of the model of high importance. Therefore, a fast and easy-to-use process for finding the model parameters from a combination of prior knowledge and measurement data is required. It has been shown that the experiment design can be improved in terms of short experiment times and an accurate parameter estimate if the robot configurations for the identification experiments are selected carefully. Estimates of the information matrix can be generated based on simulations for a number of candidate configurations, and an optimization problem can be solved for finding the optimal configurations. This work shows that the proposed method for improved experiment design works with a real manipulator, i.e. it is demonstrated that the experiment time is reduced significantly and the accuracy of the parameter estimate can be maintained or reduced if experiments are conducted only in the optimal manipulator configurations. It is also shown that the model improvement is relevant for realizing accurate control. Finally, the experimental data reveals that, in order to further improve the model accuracy, a more advanced model structure is needed for taking into account the commonly present nonlinear transmission stiffness of the robotic joints., Funding: Vinnova competence center LINK-SIC

A theoretically sound likelihood function for passive sonar surveillance using a hydrophone array is presented. The likelihood is derived from first order principles along with the assumption that the source signal can be approximated as white Gaussian noise within the considered frequency band. The resulting likelihood is a nonlinear function of the delay-and-sum beamformer response and signal-to-noise ratio (SNR). Evaluation of the proposed likelihood function is done by using it in a Bernoulli filter based track-before-detect (TkBD) framework. As a reference, the same TkBD framework, but with another beamforming response based likelihood, is used. Results from Monte-Carlo simulations of two bearings-only tracking scenarios are presented. The results show that the TkBD framework with the proposed likelihood yields an approx. 10 seconds faster target detection for a target at an SNR of -27 dB, and a lower bearing tracking error. Compared to a classical detect-and-track target tracker, the TkBD framework with the proposed likelihood yields 4 dB to 5 dB detection gain., Funding Agencies|CENIIT project "Complex Acoustic Serveillance and Tracking (COAST)"; Security-Link, COAST

A theoretically sound likelihood function for passive sonar surveillance using a hydrophone array is presented. The likelihood is derived from first order principles along with the assumption that the source signal can be approximated as white Gaussian noise within the considered frequency band. The resulting likelihood is a nonlinear function of the delay-and-sum beamformer response and signal-to-noise ratio (SNR). Evaluation of the proposed likelihood function is done by using it in a Bernoulli filter based track-before-detect (TkBD) framework. As a reference, the same TkBD framework, but with another beamforming response based likelihood, is used. Results from Monte-Carlo simulations of two bearings-only tracking scenarios are presented. The results show that the TkBD framework with the proposed likelihood yields an approx. 10 seconds faster target detection for a target at an SNR of -27 dB, and a lower bearing tracking error. Compared to a classical detect-and-track target tracker, the TkBD framework with the proposed likelihood yields 4 dB to 5 dB detection gain., Funding Agencies|CENIIT project "Complex Acoustic Serveillance and Tracking (COAST)"; Security-Link, COAST

A theoretically sound likelihood function for passive sonar surveillance using a hydrophone array is presented. The likelihood is derived from first order principles along with the assumption that the source signal can be approximated as white Gaussian noise within the considered frequency band. The resulting likelihood is a nonlinear function of the delay-and-sum beamformer response and signal-to-noise ratio (SNR). Evaluation of the proposed likelihood function is done by using it in a Bernoulli filter based track-before-detect (TkBD) framework. As a reference, the same TkBD framework, but with another beamforming response based likelihood, is used. Results from Monte-Carlo simulations of two bearings-only tracking scenarios are presented. The results show that the TkBD framework with the proposed likelihood yields an approx. 10 seconds faster target detection for a target at an SNR of -27 dB, and a lower bearing tracking error. Compared to a classical detect-and-track target tracker, the TkBD framework with the proposed likelihood yields 4 dB to 5 dB detection gain., Funding Agencies|CENIIT project "Complex Acoustic Serveillance and Tracking (COAST)"; Security-Link, COAST

The design of an adaptive controller with bounded L-2-gain from disturbances to errors for linear time-invariant systems with uncertain parameters restricted to a finite set is investigated. The synthesis of the controller requires finding matrices satisfying non-convex matrix inequalities. We propose an approach for finding these matrices based on repeatedly linearizing the terms that cause the non-convexity of the inequalities. Empirical evidence suggests that the approach leads to adaptive controllers with significantly smaller upper bound on the L-2-gain., Funding Agencies|Linkoping Center for Sensor Informatics and Control

A theoretically sound likelihood function for passive sonar surveillance using a hydrophone array is presented. The likelihood is derived from first order principles along with the assumption that the source signal can be approximated as white Gaussian noise within the considered frequency band. The resulting likelihood is a nonlinear function of the delay-and-sum beamformer response and signal-to-noise ratio (SNR). Evaluation of the proposed likelihood function is done by using it in a Bernoulli filter based track-before-detect (TkBD) framework. As a reference, the same TkBD framework, but with another beamforming response based likelihood, is used. Results from Monte-Carlo simulations of two bearings-only tracking scenarios are presented. The results show that the TkBD framework with the proposed likelihood yields an approx. 10 seconds faster target detection for a target at an SNR of -27 dB, and a lower bearing tracking error. Compared to a classical detect-and-track target tracker, the TkBD framework with the proposed likelihood yields 4 dB to 5 dB detection gain., Funding Agencies|CENIIT project "Complex Acoustic Serveillance and Tracking (COAST)"; Security-Link, COAST

A theoretically sound likelihood function for passive sonar surveillance using a hydrophone array is presented. The likelihood is derived from first order principles along with the assumption that the source signal can be approximated as white Gaussian noise within the considered frequency band. The resulting likelihood is a nonlinear function of the delay-and-sum beamformer response and signal-to-noise ratio (SNR). Evaluation of the proposed likelihood function is done by using it in a Bernoulli filter based track-before-detect (TkBD) framework. As a reference, the same TkBD framework, but with another beamforming response based likelihood, is used. Results from Monte-Carlo simulations of two bearings-only tracking scenarios are presented. The results show that the TkBD framework with the proposed likelihood yields an approx. 10 seconds faster target detection for a target at an SNR of -27 dB, and a lower bearing tracking error. Compared to a classical detect-and-track target tracker, the TkBD framework with the proposed likelihood yields 4 dB to 5 dB detection gain., Funding Agencies|CENIIT project "Complex Acoustic Serveillance and Tracking (COAST)"; Security-Link, COAST

In this work, estimators for platform pose and landmark maps for visual-inertial data are analysed. It is shown that the full, non-linear, visual-inertial problem has a conditionally linear substructure in the 2D case which can be exploited for efficient solutions, e.g., Block Coordinate Descent (BCD). It is also shown that the measurement noise from the non-linear model becomes parameter dependent resulting in biased estimates if that fact is ignored. However, the bias can be accounted for using the Iteratively Reweighted Least Squares (IRLS) method. In the 3D case the conditionally linear substructure is not separable. However, it can be shown that the Jacobian of the non-linear substructure can be calculated recursively resulting in an efficient solution. A simulated 2D visual-inertial example is used to illustrate the theoretical results., Funding: Industry Excellence Center LINKSIC by The Swedish Governmental Agency for Innovation Systems (VINNOVA); Saab AB, Link-Sic

In this work, estimators for platform pose and landmark maps for visual-inertial data are analysed. It is shown that the full, non-linear, visual-inertial problem has a conditionally linear substructure in the 2D case which can be exploited for efficient solutions, e.g., Block Coordinate Descent (BCD). It is also shown that the measurement noise from the non-linear model becomes parameter dependent resulting in biased estimates if that fact is ignored. However, the bias can be accounted for using the Iteratively Reweighted Least Squares (IRLS) method. In the 3D case the conditionally linear substructure is not separable. However, it can be shown that the Jacobian of the non-linear substructure can be calculated recursively resulting in an efficient solution. A simulated 2D visual-inertial example is used to illustrate the theoretical results., Funding: Industry Excellence Center LINKSIC by The Swedish Governmental Agency for Innovation Systems (VINNOVA); Saab AB, Link-Sic

In this work, estimators for platform pose and landmark maps for visual-inertial data are analysed. It is shown that the full, non-linear, visual-inertial problem has a conditionally linear substructure in the 2D case which can be exploited for efficient solutions, e.g., Block Coordinate Descent (BCD). It is also shown that the measurement noise from the non-linear model becomes parameter dependent resulting in biased estimates if that fact is ignored. However, the bias can be accounted for using the Iteratively Reweighted Least Squares (IRLS) method. In the 3D case the conditionally linear substructure is not separable. However, it can be shown that the Jacobian of the non-linear substructure can be calculated recursively resulting in an efficient solution. A simulated 2D visual-inertial example is used to illustrate the theoretical results., Funding: Industry Excellence Center LINKSIC by The Swedish Governmental Agency for Innovation Systems (VINNOVA); Saab AB, Link-Sic

In this work, estimators for platform pose and landmark maps for visual-inertial data are analysed. It is shown that the full, non-linear, visual-inertial problem has a conditionally linear substructure in the 2D case which can be exploited for efficient solutions, e.g., Block Coordinate Descent (BCD). It is also shown that the measurement noise from the non-linear model becomes parameter dependent resulting in biased estimates if that fact is ignored. However, the bias can be accounted for using the Iteratively Reweighted Least Squares (IRLS) method. In the 3D case the conditionally linear substructure is not separable. However, it can be shown that the Jacobian of the non-linear substructure can be calculated recursively resulting in an efficient solution. A simulated 2D visual-inertial example is used to illustrate the theoretical results., Funding: Industry Excellence Center LINKSIC by The Swedish Governmental Agency for Innovation Systems (VINNOVA); Saab AB, Link-Sic

In this work, estimators for platform pose and landmark maps for visual-inertial data are analysed. It is shown that the full, non-linear, visual-inertial problem has a conditionally linear substructure in the 2D case which can be exploited for efficient solutions, e.g., Block Coordinate Descent (BCD). It is also shown that the measurement noise from the non-linear model becomes parameter dependent resulting in biased estimates if that fact is ignored. However, the bias can be accounted for using the Iteratively Reweighted Least Squares (IRLS) method. In the 3D case the conditionally linear substructure is not separable. However, it can be shown that the Jacobian of the non-linear substructure can be calculated recursively resulting in an efficient solution. A simulated 2D visual-inertial example is used to illustrate the theoretical results., Funding: Industry Excellence Center LINKSIC by The Swedish Governmental Agency for Innovation Systems (VINNOVA); Saab AB, Link-Sic