{"id":"https://openalex.org/W2594930926","doi":"https://doi.org/10.1109/icra.2017.7989754","title":"Sequential Bayesian optimization as a POMDP for environment monitoring with UAVs","display_name":"Sequential Bayesian optimization as a POMDP for environment monitoring with UAVs","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2594930926","doi":"https://doi.org/10.1109/icra.2017.7989754","mag":"2594930926"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2017.7989754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038103937","display_name":"Philippe Morere","orcid":"https://orcid.org/0000-0001-6035-1724"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Philippe Morere","raw_affiliation_strings":["School of Information Technologies, University of Sydney, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technologies, University of Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079315163","display_name":"Rom\u00e1n Marchant","orcid":"https://orcid.org/0000-0002-0969-2352"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Roman Marchant","raw_affiliation_strings":["School of Information Technologies, University of Sydney, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technologies, University of Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062619542","display_name":"F\u00e1bio Ramos","orcid":"https://orcid.org/0000-0002-2996-2188"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Fabio Ramos","raw_affiliation_strings":["School of Information Technologies, University of Sydney, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technologies, University of Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6627,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.90536745,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"6381","last_page":"6388"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/partially-observable-markov-decision-process","display_name":"Partially observable Markov decision process","score":0.9302459955215454},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7403779029846191},{"id":"https://openalex.org/keywords/bayesian-optimization","display_name":"Bayesian optimization","score":0.6630692481994629},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.5488489270210266},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.5485653281211853},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5357121229171753},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5224034786224365},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4898190200328827},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4715690016746521},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4705736041069031},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42907798290252686},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4227045476436615},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4206044673919678},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.38704395294189453},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.3417341709136963},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.24896687269210815},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.16674348711967468},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11417916417121887}],"concepts":[{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.9302459955215454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7403779029846191},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.6630692481994629},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.5488489270210266},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.5485653281211853},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5357121229171753},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5224034786224365},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4898190200328827},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4715690016746521},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4705736041069031},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42907798290252686},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4227045476436615},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4206044673919678},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.38704395294189453},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3417341709136963},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.24896687269210815},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.16674348711967468},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11417916417121887},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2017.7989754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W81238816","https://openalex.org/W1532688806","https://openalex.org/W1558657492","https://openalex.org/W1979211426","https://openalex.org/W1984554327","https://openalex.org/W2018020586","https://openalex.org/W2034725503","https://openalex.org/W2083327122","https://openalex.org/W2099201756","https://openalex.org/W2099430963","https://openalex.org/W2110322955","https://openalex.org/W2113741278","https://openalex.org/W2124595631","https://openalex.org/W2131627640","https://openalex.org/W2144913588","https://openalex.org/W2171084228","https://openalex.org/W2221184070","https://openalex.org/W2339179100","https://openalex.org/W4211049957","https://openalex.org/W6603223803","https://openalex.org/W6631864160","https://openalex.org/W6675200109","https://openalex.org/W6676562469","https://openalex.org/W6678541622","https://openalex.org/W6684973485","https://openalex.org/W6689175234"],"related_works":["https://openalex.org/W2096013579","https://openalex.org/W1760611253","https://openalex.org/W52153049","https://openalex.org/W1589140671","https://openalex.org/W2951545791","https://openalex.org/W1515117609","https://openalex.org/W2294884454","https://openalex.org/W4323315247","https://openalex.org/W3169161914","https://openalex.org/W4321379664"],"abstract_inverted_index":{"Bayesian":[0,89],"Optimization":[1,90],"has":[2],"gained":[3],"much":[4],"popularity":[5],"lately,":[6],"as":[7,47],"a":[8,21,43,66,95,118,128,132],"global":[9],"optimization":[10],"technique":[11],"for":[12,42,91],"functions":[13],"that":[14],"are":[15,79],"expensive":[16],"to":[17,29,53,116],"evaluate":[18],"or":[19],"unknown":[20],"priori.":[22],"While":[23],"classical":[24],"BO":[25],"focuses":[26],"on":[27,126],"where":[28,48],"gather":[30,54],"an":[31],"observation":[32],"next,":[33],"it":[34,49],"does":[35],"not":[36],"take":[37],"into":[38],"account":[39],"practical":[40],"constraints":[41,78],"robotic":[44],"system":[45],"such":[46],"is":[50,106],"physically":[51],"possible":[52],"samples":[55],"from,":[56],"nor":[57],"the":[58,62],"sequential":[59],"nature":[60],"of":[61],"problem":[63],"while":[64],"executing":[65],"trajectory.":[67],"In":[68],"field":[69],"robotics":[70],"and":[71,76,123],"other":[72],"real-life":[73],"situations,":[74],"physical":[75],"trajectory":[77],"inherent":[80],"problems.":[81],"This":[82],"paper":[83],"addresses":[84],"these":[85],"issues":[86],"by":[87],"formulating":[88],"continuous":[92],"trajectories":[93],"within":[94],"Partially":[96],"observable":[97],"Markov":[98],"Decision":[99],"Process":[100],"(POMDP)":[101],"framework.":[102],"The":[103],"resulting":[104],"POMDP":[105],"solved":[107],"using":[108,117],"Monte-Carlo":[109],"Tree":[110],"Search":[111],"(MCTS),":[112],"which":[113],"we":[114],"adapt":[115],"reward":[119],"function":[120],"balancing":[121],"exploration":[122],"exploitation.":[124],"Experiments":[125],"monitoring":[127],"spatial":[129],"phenomenon":[130],"with":[131],"UAV":[133],"illustrate":[134],"how":[135],"our":[136],"BO-POMDP":[137],"algorithm":[138],"outperforms":[139],"competing":[140],"techniques.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}