{"id":"https://openalex.org/W2078597682","doi":"https://doi.org/10.1109/robio.2012.6491290","title":"Multi-robot repeated boundary coverage under uncertainty","display_name":"Multi-robot repeated boundary coverage under uncertainty","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2078597682","doi":"https://doi.org/10.1109/robio.2012.6491290","mag":"2078597682"},"language":"en","primary_location":{"id":"doi:10.1109/robio.2012.6491290","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2012.6491290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Biomimetics (ROBIO)","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/A5029196810","display_name":"Pooyan Fazli","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Pooyan Fazli","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Vancouver, BC, Canada","Department of Computer Science, University of British Columbia, Vancouver, BC Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079331774","display_name":"Alan K. Mackworth","orcid":"https://orcid.org/0000-0003-0380-105X"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alan K. Mackworth","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Vancouver, BC, Canada","Department of Computer Science, University of British Columbia, Vancouver, BC Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC Canada","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029196810"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":1.1176,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80222891,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2167","last_page":"2174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"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.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.7925846576690674},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7298773527145386},{"id":"https://openalex.org/keywords/event","display_name":"Event (particle physics)","score":0.7188928127288818},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6701343059539795},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6682261824607849},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6095395684242249},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4871792197227478},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4863889515399933},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.479168564081192},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3441818654537201},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26939618587493896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23003649711608887}],"concepts":[{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.7925846576690674},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7298773527145386},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.7188928127288818},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6701343059539795},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6682261824607849},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6095395684242249},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4871792197227478},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4863889515399933},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.479168564081192},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3441818654537201},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26939618587493896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23003649711608887},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/robio.2012.6491290","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2012.6491290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Biomimetics (ROBIO)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.412.8636","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.412.8636","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/~mack/Publications/PooyanFazliROBIO2012.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.413.1615","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.413.1615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/~mack/Publications/PooyanFazliIROS2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W626292722","https://openalex.org/W1508587596","https://openalex.org/W1522621335","https://openalex.org/W1523723368","https://openalex.org/W1543672909","https://openalex.org/W1544032329","https://openalex.org/W1575155528","https://openalex.org/W1591939288","https://openalex.org/W1606450834","https://openalex.org/W1728603878","https://openalex.org/W1965057580","https://openalex.org/W2016216597","https://openalex.org/W2025402019","https://openalex.org/W2042986967","https://openalex.org/W2079868147","https://openalex.org/W2094658339","https://openalex.org/W2101889102","https://openalex.org/W2109631474","https://openalex.org/W2119981134","https://openalex.org/W2140425706","https://openalex.org/W2140903796","https://openalex.org/W2152097279","https://openalex.org/W2155183030","https://openalex.org/W2157559538","https://openalex.org/W6630640323","https://openalex.org/W6631230212","https://openalex.org/W6637419966"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W4297427155","https://openalex.org/W3025823153","https://openalex.org/W3136451934","https://openalex.org/W3200006077","https://openalex.org/W2975368677","https://openalex.org/W2170228269"],"abstract_inverted_index":{"We":[0],"address":[1],"the":[2,13,20,31,41,44,47,63,77,81,106,119,125,130,133,138,144,156,163,168,173,178,188,193,196,201],"problem":[3],"of":[4,10,12,15,30,43,62,84,121,172,177,195],"repeated":[5,206],"coverage":[6,208],"by":[7,79,87,200],"a":[8,16,95,151,184,204],"team":[9,202],"robots":[11],"boundaries":[14,32,42,126],"target":[17,134,164],"area":[18,45,165],"and":[19,33,46,65,116],"structures":[21,48],"inside":[22],"it.":[23],"Events":[24],"may":[25,34,54,68],"occur":[26],"on":[27,59,103,124,137,192],"any":[28],"parts":[29,61,171],"have":[35],"different":[36,60],"importance":[37],"weights.":[38],"In":[39],"addition,":[40],"are":[49],"heterogeneous,":[50],"so":[51],"that":[52,160],"events":[53],"appear":[55],"with":[56,183],"varying":[57],"probabilities":[58],"boundary,":[64],"this":[66,111],"probability":[67],"change":[69],"over":[70,127],"time.":[71,92],"The":[72,93,175],"goal":[73],"is":[74,108,181],"to":[75,142,154,166],"maximize":[76,143],"reward":[78,94,198],"detecting":[80,99],"maximum":[82],"number":[83],"events,":[85],"weighted":[86],"their":[88],"importance,":[89],"in":[90,132,150,162],"minimum":[91],"robot":[96,114,147],"receives":[97],"for":[98,187],"an":[100],"event":[101,107,122],"depends":[102],"how":[104],"early":[105],"detected.":[109],"To":[110],"end,":[112],"each":[113,146],"autonomously":[115],"continuously":[117],"learns":[118],"pattern":[120],"occurrence":[123],"time,":[128],"capturing":[129],"uncertainties":[131],"area.":[135],"Based":[136],"policy":[139],"being":[140],"learned":[141],"reward,":[145],"then":[148],"plans":[149],"decentralized":[152],"manner":[153],"select":[155],"best":[157],"path":[158],"at":[159],"time":[161],"visit":[167],"most":[169],"promising":[170],"boundary.":[174],"performance":[176],"learning":[179],"algorithm":[180,186],"compared":[182],"heuristic":[185],"Travelling":[189],"Salesman":[190],"Problem,":[191],"basis":[194],"total":[197],"collected":[199],"during":[203],"finite":[205],"boundary":[207],"mission.":[209]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}