{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/29605"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/29605","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Probabilistic search: a Bayesian approach in a continuous workspace","abstract":"This thesis considers the problem of modeling search for a single, non-moving target in a continuous environment, where the search agent's only observations are obtained from a binary sensor. To model this problem, the widely used Bayesian filtering approach is employed to obtain the general filtering equations for the posterior distribution representing the object's location over the workspace. Given a likelihood and prior belief belonging to the exponential family class, while using this class's self-conjugacy property, an exact, finite representation of the object posterior is explicitly derived. Though complexity issues may render this exact representation infeasible for computation, regularized particle filtering is utilized to yield a continuous approximation of the object belief. To demonstrate the validity of the search model, a gradient-ascent search strategy is applied with care taken to avoid local maxima. This is done with multiple simulations for various prior distributions. Finally, future work is described for search applications and approximation schemas relevant to the structure of the search model presented.","abstract_html":"This thesis considers the problem of modeling search for a single, non-moving target in a continuous environment, where the search agent's only observations are obtained from a binary sensor. To model this problem, the widely used Bayesian filtering approach is employed to obtain the general filtering equations for the posterior distribution representing the object's location over the workspace. Given a likelihood and prior belief belonging to the exponential family class, while using this class's self-conjugacy property, an exact, finite representation of the object posterior is explicitly derived. Though complexity issues may render this exact representation infeasible for computation, regularized particle filtering is utilized to yield a continuous approximation of the object belief. To demonstrate the validity of the search model, a gradient-ascent search strategy is applied with care taken to avoid local maxima. This is done with multiple simulations for various prior distributions. Finally, future work is described for search applications and approximation schemas relevant to the structure of the search model presented.","abstract_has_math":false,"creators":["Bonnie, Devin A."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Hutchinson, Seth A."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-02-06T20:06:21Z","date_published":"2012-02-06T20:06:21Z","updated_at":"2026-07-22T22:25:27Z","subjects":["Bayesian Search","single robot search","multi robot search","atypical exponential family mixture belief self conjugacy","binary sensor search"],"languages":["en"],"rights":["Copyright 2011 Devin A. Bonnie"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/29605","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hutchinson, Seth A."]},{"key":"dc:creator","label":"Author","values":["Bonnie, Devin A."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-02-06T20:06:21Z","2011-12"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bayesian Search","single robot search","multi robot search","atypical exponential family mixture belief self conjugacy","binary sensor search"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2011 Devin A. Bonnie"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/29605"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis considers the problem of modeling search for a single, non-moving target in a continuous environment, where the search agent's only observations are obtained from a binary sensor. To model this problem, the widely used Bayesian filtering approach is employed to obtain the general filtering equations for the posterior distribution representing the object's location over the workspace. Given a likelihood and prior belief belonging to the exponential family class, while using this class's self-conjugacy property, an exact, finite representation of the object posterior is explicitly derived. Though complexity issues may render this exact representation infeasible for computation, regularized particle filtering is utilized to yield a continuous approximation of the object belief. To demonstrate the validity of the search model, a gradient-ascent search strategy is applied with care taken to avoid local maxima. This is done with multiple simulations for various prior distributions. Finally, future work is described for search applications and approximation schemas relevant to the structure of the search model presented.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-08-02T21:50:12Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Bonnie_Devin.pdf: 3055853 bytes, checksum: eda2812efd42b71276032b39c2db217c (MD5)","Made available in DSpace on 2012-02-06T20:06:21Z (GMT). No. of bitstreams: 2 Bonnie_Devin.pdf: 3055849 bytes, checksum: 0a40ffcd526335c3fb1888758bb348f5 (MD5) license.txt: 4061 bytes, checksum: d83fe6a1a52bb1524830a795d682086f (MD5)"]},{"key":"dc:title","label":"Title","values":["Probabilistic search: a Bayesian approach in a continuous workspace"]}]}],"canonical_facts":{"dc:contributor":["Hutchinson, Seth A."],"dc:creator":["Bonnie, Devin A."],"dc:date":["2012-02-06T20:06:21Z","2011-12"],"dc:description":["This thesis considers the problem of modeling search for a single, non-moving target in a continuous environment, where the search agent's only observations are obtained from a binary sensor. To model this problem, the widely used Bayesian filtering approach is employed to obtain the general filtering equations for the posterior distribution representing the object's location over the workspace. Given a likelihood and prior belief belonging to the exponential family class, while using this class's self-conjugacy property, an exact, finite representation of the object posterior is explicitly derived. Though complexity issues may render this exact representation infeasible for computation, regularized particle filtering is utilized to yield a continuous approximation of the object belief. To demonstrate the validity of the search model, a gradient-ascent search strategy is applied with care taken to avoid local maxima. This is done with multiple simulations for various prior distributions. Finally, future work is described for search applications and approximation schemas relevant to the structure of the search model presented.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-08-02T21:50:12Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Bonnie_Devin.pdf: 3055853 bytes, checksum: eda2812efd42b71276032b39c2db217c (MD5)","Made available in DSpace on 2012-02-06T20:06:21Z (GMT). No. of bitstreams: 2 Bonnie_Devin.pdf: 3055849 bytes, checksum: 0a40ffcd526335c3fb1888758bb348f5 (MD5) license.txt: 4061 bytes, checksum: d83fe6a1a52bb1524830a795d682086f (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/29605"],"dc:language":["en"],"dc:rights":["Copyright 2011 Devin A. Bonnie"],"dc:subject":["Bayesian Search","single robot search","multi robot search","atypical exponential family mixture belief self conjugacy","binary sensor search"],"dc:title":["Probabilistic search: a Bayesian approach in a continuous workspace"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:27Z"}