An algorithm is presented for generating trajectories for efficient exploration that takes into account a probabilistic representation of information density over a sampling region. The problem is cast as a continuous-time trajectory optimization problem, where the objective function directly involves the relationship between the probability density functions representing the spatial distribution and the statistical representation of the time-averaged trajectory. The difference is expressed using ergodicity. It is shown that the trajectory optimization problem can be solved using descent directions that are solutions to linear quadratic optimal control problems. The proposed method generates continuous-time optimal feedback controllers, demonstrated in simulation for a nonlinear sensor model.
Description
IEEE Xplore Abstract - Trajectory optimization for continuous ergodic exploration
%0 Conference Paper
%1 miller2013trajectory
%A Miller, L.M.
%A Murphey, T.D.
%B American Control Conference (ACC), 2013
%D 2013
%K ergodicity exploration network
%P 4196-4201
%R 10.1109/ACC.2013.6580484
%T Trajectory optimization for continuous ergodic exploration
%U http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6580484&url=http%3A%2F%2Fieeexplore.ieee.org%2Fstamp%2Fstamp.jsp%3Ftp%3D%26arnumber%3D6580484
%X An algorithm is presented for generating trajectories for efficient exploration that takes into account a probabilistic representation of information density over a sampling region. The problem is cast as a continuous-time trajectory optimization problem, where the objective function directly involves the relationship between the probability density functions representing the spatial distribution and the statistical representation of the time-averaged trajectory. The difference is expressed using ergodicity. It is shown that the trajectory optimization problem can be solved using descent directions that are solutions to linear quadratic optimal control problems. The proposed method generates continuous-time optimal feedback controllers, demonstrated in simulation for a nonlinear sensor model.
@inproceedings{miller2013trajectory,
abstract = {An algorithm is presented for generating trajectories for efficient exploration that takes into account a probabilistic representation of information density over a sampling region. The problem is cast as a continuous-time trajectory optimization problem, where the objective function directly involves the relationship between the probability density functions representing the spatial distribution and the statistical representation of the time-averaged trajectory. The difference is expressed using ergodicity. It is shown that the trajectory optimization problem can be solved using descent directions that are solutions to linear quadratic optimal control problems. The proposed method generates continuous-time optimal feedback controllers, demonstrated in simulation for a nonlinear sensor model.},
added-at = {2015-11-23T19:56:26.000+0100},
author = {Miller, L.M. and Murphey, T.D.},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/20ecdff18859d4fba0c71fd1f721855a9/mariusoei},
booktitle = {American Control Conference (ACC), 2013},
description = {IEEE Xplore Abstract - Trajectory optimization for continuous ergodic exploration},
doi = {10.1109/ACC.2013.6580484},
interhash = {6111d48ba6f6880e2bbf54f9cc164834},
intrahash = {0ecdff18859d4fba0c71fd1f721855a9},
issn = {0743-1619},
keywords = {ergodicity exploration network},
month = {June},
pages = {4196-4201},
timestamp = {2016-03-10T22:25:12.000+0100},
title = {Trajectory optimization for continuous ergodic exploration},
url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6580484&url=http%3A%2F%2Fieeexplore.ieee.org%2Fstamp%2Fstamp.jsp%3Ftp%3D%26arnumber%3D6580484},
year = 2013
}
