A receding horizon algorithm for informative path planning with temporal logic constraints

@inproceedings{jones_receding_2013,
  address = {Karlsruhe, Germany},
  title = {A receding horizon algorithm for informative path planning with temporal logic constraints},
  isbn = {978-1-4673-5643-5 978-1-4673-5641-1},
  url = {http://ieeexplore.ieee.org/document/6631294/},
  abstract = {This paper considers the problem of ﬁnding the most informative path for a sensing robot under temporal logic constraints, a richer set of constraints than have previously been considered in information gathering. An algorithm for informative path planning is presented that leverages tools from information theory and formal control synthesis, and is proven to give a path that satisﬁes the given temporal logic constraints. The algorithm uses a receding horizon approach in order to provide a reactive, on-line solution while mitigating computational complexity. Statistics compiled from multiple simulation studies indicate that this algorithm performs better than a baseline exhaustive search approach.},
  language = {en},
  urldate = {2020-09-15},
  booktitle = {2013 {IEEE} {International} {Conference} on {Robotics} and {Automation}},
  publisher = {IEEE},
  author = {Jones, Austin and Schwager, Mac and Belta, Calin},
  month = may,
  year = {2013},
  keywords = {signal\_temporal\_logic},
  pages = {5019--5024},
  month_numeric = {5}
}