{"id":"https://openalex.org/W4250200009","doi":"https://doi.org/10.1109/hri.2016.7451763","title":"Homotopy-aware RRT*: Toward human-robot topological path-planning","display_name":"Homotopy-aware RRT*: Toward human-robot topological path-planning","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W4250200009","doi":"https://doi.org/10.1109/hri.2016.7451763"},"language":"en","primary_location":{"id":"doi:10.1109/hri.2016.7451763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hri.2016.7451763","pdf_url":null,"source":{"id":"https://openalex.org/S4363608116","display_name":"2016 11th ACM/IEEE International Conference on Human-Robot Interaction (HRI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 11th ACM/IEEE International Conference on Human-Robot Interaction (HRI)","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/A5057008378","display_name":"Daqing Yi","orcid":null},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daqing Yi","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, UT, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077345598","display_name":"Michael A. Goodrich","orcid":"https://orcid.org/0000-0002-2489-5705"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael A. Goodrich","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, UT, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029074659","display_name":"Kevin Seppi","orcid":"https://orcid.org/0000-0002-4932-2700"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin D. Seppi","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, UT, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057008378"],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":1.1322,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.88401254,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"279","last_page":"286"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9818000197410583,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/robot","display_name":"Robot","score":0.7358638048171997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6032358407974243},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5805554986000061},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5676463842391968},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5224891304969788},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.514707624912262},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5027666091918945},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4981648921966553},{"id":"https://openalex.org/keywords/homotopy","display_name":"Homotopy","score":0.47297728061676025},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.4550796449184418},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4219937324523926},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.41493889689445496},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.389325886964798},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28289371728897095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23729777336120605}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7358638048171997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6032358407974243},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5805554986000061},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5676463842391968},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5224891304969788},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.514707624912262},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5027666091918945},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4981648921966553},{"id":"https://openalex.org/C5961521","wikidata":"https://www.wikidata.org/wiki/Q746083","display_name":"Homotopy","level":2,"score":0.47297728061676025},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.4550796449184418},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4219937324523926},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.41493889689445496},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.389325886964798},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28289371728897095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23729777336120605},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hri.2016.7451763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hri.2016.7451763","pdf_url":null,"source":{"id":"https://openalex.org/S4363608116","display_name":"2016 11th ACM/IEEE International Conference on Human-Robot Interaction (HRI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 11th ACM/IEEE International Conference on Human-Robot Interaction (HRI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1777783943","https://openalex.org/W1917004820","https://openalex.org/W1998840849","https://openalex.org/W2019287133","https://openalex.org/W2026774293","https://openalex.org/W2030021468","https://openalex.org/W2059039791","https://openalex.org/W2064045620","https://openalex.org/W2077828922","https://openalex.org/W2081751185","https://openalex.org/W2098029503","https://openalex.org/W2121045674","https://openalex.org/W2122159926","https://openalex.org/W2142963440","https://openalex.org/W2161808137","https://openalex.org/W2295417718","https://openalex.org/W6640049908","https://openalex.org/W6656924837","https://openalex.org/W6674443108","https://openalex.org/W6683976185","https://openalex.org/W6780011183"],"related_works":["https://openalex.org/W4312723892","https://openalex.org/W2783065147","https://openalex.org/W2359600231","https://openalex.org/W3216757130","https://openalex.org/W2380019117","https://openalex.org/W2093343611","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3154539612"],"abstract_inverted_index":{"An":[0],"important":[1],"problem":[2],"in":[3],"human-robot":[4,149],"interaction":[5],"is":[6,83],"for":[7,111,121,139],"a":[8,19,39,84,89,108,119,125,137],"human":[9,45],"to":[10,13,18,26,31,41,51,57,69,93,98,135],"be":[11],"able":[12],"tell":[14],"the":[15,34,44,47,77,99,103,112,116,132,146],"robot":[16,48,90],"go":[17],"particular":[20],"location":[21],"with":[22,145],"instructions":[23],"on":[24,33],"how":[25],"get":[27],"there":[28],"or":[29,60],"what":[30],"avoid":[32],"way.":[35],"This":[36],"paper":[37,75,106],"provides":[38,107],"solution":[40],"problems":[42],"where":[43],"wants":[46],"not":[49],"only":[50],"optimize":[52],"some":[53],"objective":[54],"but":[55],"also":[56],"honor":[58],"\u201csoft\u201d":[59],"\u201chard\u201d":[61],"topological":[62],"constraints,":[63],"i.e.":[64],"\u201cgo":[65],"quickly":[66],"from":[67],"A":[68],"B":[70],"while":[71],"avoiding":[72],"C\u201d.":[73],"The":[74,105],"presents":[76],"HARRT*":[78],"(homotopy-aware":[79],"RRT*)":[80],"algorithm,":[81,117],"which":[82],"computationally":[85],"scalable":[86],"algorithm":[87,134],"that":[88],"can":[91],"use":[92],"plan":[94],"optimal":[95],"paths":[96],"subject":[97],"information":[100],"provided":[101],"by":[102],"human.":[104],"theoretic":[109],"justification":[110],"key":[113],"property":[114],"of":[115,127,131,148],"proposes":[118],"heuristic":[120],"RRT*,":[122],"and":[123],"uses":[124],"set":[126],"simulation":[128],"case":[129,138],"studies":[130],"resulting":[133],"make":[136],"why":[140],"these":[141],"properties":[142],"are":[143],"compatible":[144],"requirements":[147],"interactive":[150],"path-planning.":[151]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}