{"id":"https://openalex.org/W3113801649","doi":"https://doi.org/10.1109/iros45743.2020.9340839","title":"Sampling-based search for a semi-cooperative target","display_name":"Sampling-based search for a semi-cooperative target","publication_year":2020,"publication_date":"2020-10-24","ids":{"openalex":"https://openalex.org/W3113801649","doi":"https://doi.org/10.1109/iros45743.2020.9340839","mag":"3113801649"},"language":"en","primary_location":{"id":"doi:10.1109/iros45743.2020.9340839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros45743.2020.9340839","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5039124260","display_name":"Isaac Vandermeulen","orcid":null},"institutions":[{"id":"https://openalex.org/I138423393","display_name":"iRobot (United States)","ror":"https://ror.org/02ex4jy25","country_code":"US","type":"company","lineage":["https://openalex.org/I138423393"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Isaac Vandermeulen","raw_affiliation_strings":["Isaac Vandermeulen is with iRobot, Pasadena, California, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Isaac Vandermeulen is with iRobot, Pasadena, California, USA","institution_ids":["https://openalex.org/I138423393"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107842199","display_name":"Roderich Gros","orcid":null},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Roderich Gros","raw_affiliation_strings":["The University of Sheffield, Sheffield, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Sheffield, Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086675026","display_name":"Andreas Kolling","orcid":"https://orcid.org/0000-0002-2679-9821"},"institutions":[{"id":"https://openalex.org/I1311688040","display_name":"Amazon (United States)","ror":"https://ror.org/04mv4n011","country_code":"US","type":"company","lineage":["https://openalex.org/I1311688040"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andreas Kolling","raw_affiliation_strings":["Amazon Robotics, North Reading, Massachusetts, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Amazon Robotics, North Reading, Massachusetts, USA","institution_ids":["https://openalex.org/I1311688040"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1958,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.52202548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4774","last_page":"4781"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6740617752075195},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5577857494354248},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.557166337966919},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5193663239479065},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49403315782546997},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4921809732913971},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4801849126815796},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.46083739399909973},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.45840364694595337},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4408721625804901},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4130602180957794},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35058051347732544},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3280586004257202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3237527012825012},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3212491273880005},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.315762996673584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24926871061325073},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.16520708799362183},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14198657870292664},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.11875015497207642},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11157578229904175}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6740617752075195},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5577857494354248},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.557166337966919},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5193663239479065},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49403315782546997},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4921809732913971},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4801849126815796},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.46083739399909973},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.45840364694595337},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4408721625804901},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4130602180957794},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35058051347732544},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3280586004257202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3237527012825012},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3212491273880005},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.315762996673584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24926871061325073},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.16520708799362183},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14198657870292664},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.11875015497207642},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11157578229904175},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros45743.2020.9340839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros45743.2020.9340839","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:163769","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W40650588","https://openalex.org/W131069610","https://openalex.org/W1126974217","https://openalex.org/W1524674316","https://openalex.org/W1544653223","https://openalex.org/W1777783943","https://openalex.org/W1974581510","https://openalex.org/W1984142532","https://openalex.org/W1987736941","https://openalex.org/W2003808711","https://openalex.org/W2007216244","https://openalex.org/W2008318306","https://openalex.org/W2023716923","https://openalex.org/W2023901992","https://openalex.org/W2025813574","https://openalex.org/W2031168329","https://openalex.org/W2042189440","https://openalex.org/W2058006523","https://openalex.org/W2087421501","https://openalex.org/W2095453748","https://openalex.org/W2105848344","https://openalex.org/W2115268452","https://openalex.org/W2128990851","https://openalex.org/W2129626945","https://openalex.org/W2140229973","https://openalex.org/W2144752369","https://openalex.org/W2148948872","https://openalex.org/W2152244994","https://openalex.org/W2164175930","https://openalex.org/W2167583154","https://openalex.org/W2336416123","https://openalex.org/W2554009248","https://openalex.org/W2738007898","https://openalex.org/W2783112349","https://openalex.org/W2794292089","https://openalex.org/W2910586845","https://openalex.org/W2912816339","https://openalex.org/W2945573940","https://openalex.org/W6605295560","https://openalex.org/W6631425239","https://openalex.org/W6674445081","https://openalex.org/W6679481333","https://openalex.org/W6762594178"],"related_works":["https://openalex.org/W58921990","https://openalex.org/W2885402535","https://openalex.org/W2081821176","https://openalex.org/W4390091683","https://openalex.org/W2747118187","https://openalex.org/W1622225657","https://openalex.org/W2402589461","https://openalex.org/W1971267722","https://openalex.org/W2166539025","https://openalex.org/W2131923625"],"abstract_inverted_index":{"Searching":[0],"for":[1,9,21],"a":[2,14,27,40,65,70,98,145],"lost":[3],"teammate":[4],"is":[5,37,61,69],"an":[6,116],"important":[7],"task":[8],"multirobot":[10],"systems.":[11],"We":[12],"present":[13],"variant":[15],"of":[16,30,47,73,130,175,184],"rapidly-expanding":[17],"random":[18],"trees":[19],"(RRT)":[20],"generating":[22],"search":[23,57,83,125,138],"paths":[24,139],"based":[25,101,126],"on":[26,102,104,127],"probabilistic":[28],"belief":[29,36,60],"the":[31,48,74,105,112,120,124,128,131,166,171,181],"target":[32,167],"teammate's":[33],"position.":[34],"The":[35,81],"updated":[38],"using":[39],"hidden":[41],"Markov":[42],"model":[43],"built":[44],"from":[45,115],"knowledge":[46],"target's":[49],"planned":[50],"or":[51],"historic":[52],"behavior.":[53],"For":[54],"any":[55],"candidate":[56,91,95],"path,":[58],"this":[59],"used":[62,155],"to":[63,89,97,119,144,153],"compute":[64],"discounted":[66,106],"reward":[67],"which":[68,140],"weighted":[71],"sum":[72],"connection":[75],"probability":[76],"at":[77],"each":[78],"time":[79],"step.":[80],"RRT":[82],"algorithm":[84],"uses":[85],"randomly":[86],"sampled":[87,121],"locations":[88],"generate":[90],"vertices":[92,96,109],"and":[93,147,177],"adds":[94],"planning":[99],"tree":[100],"bounds":[103],"reward.":[107],"Candidate":[108],"are":[110,141],"along":[111],"shortest":[113],"path":[114],"existing":[117],"vertex":[118],"location,":[122],"biasing":[123],"topology":[129],"environment.":[132],"This":[133],"method":[134],"produces":[135],"high":[136],"quality":[137],"not":[142],"constrained":[143],"grid":[146],"can":[148],"be":[149,154],"computed":[150],"fast":[151],"enough":[152],"in":[156,170,180],"real":[157],"time.":[158],"Compared":[159],"with":[160],"two":[161],"other":[162],"strategies,":[163],"it":[164],"found":[165],"significantly":[168],"faster":[169],"most":[172],"difficult":[173],"60%":[174],"situations":[176],"was":[178],"similar":[179],"easier":[182],"40%":[183],"situations.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}