Near-optimal probabilistic search via submodularity and sparse regression

Title
Near-optimal probabilistic search via submodularity and sparse regression
Authors
Keywords
Probabilistic search, Coverage problem, Receding horizon control, Submodularity, Overlapping group LASSO
Journal
AUTONOMOUS ROBOTS
Volume 41, Issue 1, Pages 205-229
Publisher
Springer Nature
Online
2015-12-29
DOI
10.1007/s10514-015-9521-5

Ask authors/readers for more resources

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now