The optimal searcher path problem with a visibility criterion in discrete time and space

Michael Morin, Irène Abi-Zeid, Jonathan P. Lang, Luc Lamontagne, Patrick Maupin. The optimal searcher path problem with a visibility criterion in discrete time and space. In 12th International Conference on Information Fusion, FUSION '09, Seattle, Washington, USA, July 6-9, 2009. pages 2217-2224, IEEE, 2009. [doi]

@inproceedings{MorinALLM09,
  title = {The optimal searcher path problem with a visibility criterion in discrete time and space},
  author = {Michael Morin and Irène Abi-Zeid and Jonathan P. Lang and Luc Lamontagne and Patrick Maupin},
  year = {2009},
  url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5203767},
  researchr = {https://researchr.org/publication/MorinALLM09},
  cites = {0},
  citedby = {0},
  pages = {2217-2224},
  booktitle = {12th International Conference on Information Fusion, FUSION '09, Seattle, Washington, USA, July 6-9, 2009},
  publisher = {IEEE},
  isbn = {978-0-9824438-0-4},
}