SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(Ögren Petter)
 

Search: WFRF:(Ögren Petter) > (2015-2019) > On Informative Path...

On Informative Path Planning for Tracking and Surveillance

Boström-Rost, Per, 1988- (author)
Linköpings universitet,Reglerteknik,Tekniska fakulteten
Hendeby, Gustaf, Associate professor, 1978- (thesis advisor)
Linköpings universitet,Reglerteknik,Tekniska fakulteten
Axehill, Daniel, Associate professor, 1978- (thesis advisor)
Linköpings universitet,Reglerteknik,Tekniska fakulteten
show more...
Ögren, Petter, Professor (opponent)
Division of Robotics, Perception and Learning, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology
show less...
 (creator_code:org_t)
ISBN 9789176850756
Linköping : Linköping University Electronic Press, 2019
English 86 s.
  • Licentiate thesis (other academic/artistic)
Abstract Subject headings
Close  
  • This thesis studies a class of sensor management problems called informative path planning (IPP). Sensor management refers to the problem of optimizing control inputs for sensor systems in dynamic environments in order to achieve operational objectives. The problems are commonly formulated as stochastic optimal control problems, where to objective is to maximize the information gained from future measurements. In IPP, the control inputs affect the movement of the sensor platforms, and the goal is to compute trajectories from where the sensors can obtain measurements that maximize the estimation performance. The core challenge lies in making decisions based on the predicted utility of future measurements.In linear Gaussian settings, the estimation performance is independent of the actual measurements. This means that IPP becomes a deterministic optimal control problem, for which standard numerical optimization techniques can be applied. This is exploited in the first part of this thesis. A surveillance application is considered, where a mobile sensor is gathering information about features of interest while avoiding being tracked by an adversarial observer. The problem is formulated as an optimization problem that allows for a trade-off between informativeness and stealth. We formulate a theorem that makes it possible to reformulate a class of nonconvex optimization problems with matrix-valued variables as convex optimization problems. This theorem is then used to prove that the seemingly intractable IPP problem can be solved to global optimality using off-the-shelf optimization tools.The second part of this thesis considers tracking of a maneuvering target using a mobile sensor with limited field of view. The problem is formulated as an IPP problem, where the goal is to generate a sensor trajectory that maximizes the expected tracking performance, captured by a measure of the covariance matrix of the target state estimate. When the measurements are nonlinear functions of the target state, the tracking performance depends on the actual measurements, which depend on the target’s trajectory. Since these are unavailable in the planning stage, the problem becomes a stochastic optimal control problem. An approximation of the problem based on deterministic sampling of the distribution of the predicted target trajectory is proposed. It is demonstrated in a simulation study that the proposed method significantly increases the tracking performance compared to a conventional approach that neglects the uncertainty in the future target trajectory.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)

Publication and Content Type

vet (subject category)
lic (subject category)

Find in a library

To the university's database

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view