{"id":"https://openalex.org/W2563402379","doi":"https://doi.org/10.1109/iros.2016.7759238","title":"Expressing homotopic requirements for mobile robot navigation through natural language instructions","display_name":"Expressing homotopic requirements for mobile robot navigation through natural language instructions","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2563402379","doi":"https://doi.org/10.1109/iros.2016.7759238","mag":"2563402379"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2016.7759238","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2016.7759238","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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/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/A5101411184","display_name":"Thomas M. Howard","orcid":"https://orcid.org/0000-0002-8270-0806"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas M. Howard","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Rochester, Rochester, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Rochester, Rochester, NY, USA","institution_ids":["https://openalex.org/I5388228"]}]},{"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":4,"corresponding_author_ids":["https://openalex.org/A5057008378"],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":0.501,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73896991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1462","last_page":"1468"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9787999987602234,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9703999757766724,"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/robot","display_name":"Robot","score":0.6636551022529602},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6370442509651184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5828542113304138},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5595055818557739},{"id":"https://openalex.org/keywords/homotopy","display_name":"Homotopy","score":0.5334335565567017},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5293289422988892},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.528421938419342},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5237724184989929},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47068196535110474},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.46322301030158997},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4569055140018463},{"id":"https://openalex.org/keywords/natural-language","display_name":"Natural language","score":0.44007161259651184},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41811907291412354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31231963634490967},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2830367088317871},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23944175243377686},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10924354195594788},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07624125480651855}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6636551022529602},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6370442509651184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5828542113304138},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5595055818557739},{"id":"https://openalex.org/C5961521","wikidata":"https://www.wikidata.org/wiki/Q746083","display_name":"Homotopy","level":2,"score":0.5334335565567017},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5293289422988892},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.528421938419342},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5237724184989929},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47068196535110474},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.46322301030158997},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4569055140018463},{"id":"https://openalex.org/C195324797","wikidata":"https://www.wikidata.org/wiki/Q33742","display_name":"Natural language","level":2,"score":0.44007161259651184},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41811907291412354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31231963634490967},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2830367088317871},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23944175243377686},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10924354195594788},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07624125480651855},{"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2016.7759238","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2016.7759238","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.75}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W46490633","https://openalex.org/W1534120332","https://openalex.org/W2007820193","https://openalex.org/W2019287133","https://openalex.org/W2026774293","https://openalex.org/W2051434435","https://openalex.org/W2064045620","https://openalex.org/W2069809153","https://openalex.org/W2081751185","https://openalex.org/W2118781169","https://openalex.org/W2198355466","https://openalex.org/W2236233024","https://openalex.org/W2295417718","https://openalex.org/W2318285167","https://openalex.org/W2343548393","https://openalex.org/W2359824219","https://openalex.org/W3147794100","https://openalex.org/W4250200009","https://openalex.org/W4312769317","https://openalex.org/W6677564776","https://openalex.org/W6697205691","https://openalex.org/W6699924034","https://openalex.org/W6706765627"],"related_works":["https://openalex.org/W3049557657","https://openalex.org/W3150915502","https://openalex.org/W2111158727","https://openalex.org/W1809059965","https://openalex.org/W2024668666","https://openalex.org/W2155287816","https://openalex.org/W3123455607","https://openalex.org/W2132826624","https://openalex.org/W4281385974","https://openalex.org/W2112736381"],"abstract_inverted_index":{"Allowing":[0],"a":[1,8,30,44,48,51,57,69,102,108,118,128,134],"human":[2,22],"to":[3,7,15,23,35,64,76,91],"express":[4],"topological":[5,40,140],"requirements":[6],"robot":[9,17,26,49],"in":[10,96],"language":[11,103,129],"enables":[12],"untrained":[13],"users":[14],"guide":[16],"movement":[18],"without":[19],"requiring":[20],"the":[21,85,93,97,114],"understand":[24,50],"sophisticated":[25],"algorithms.":[27],"By":[28],"using":[29],"homotopy":[31],"class":[32],"or":[33,38],"classes":[34],"represent":[36],"one":[37],"more":[39],"requirements,":[41],"we":[42,106],"build":[43],"framework":[45],"that":[46,61,112],"helps":[47],"human's":[52],"intent.":[53],"This":[54],"paper":[55],"reviews":[56],"homotopic":[58,73,94,109,122],"decomposition":[59],"method":[60],"is":[62,131],"used":[63],"convert":[65],"any":[66],"path":[67,74,135],"into":[68,133],"string,":[70],"which":[71],"allows":[72],"equivalence":[75],"be":[77],"performed":[78],"by":[79,137],"comparing":[80],"strings.":[81],"We":[82],"then":[83],"integrate":[84],"Homotopic":[86],"Distributed":[87],"Correspondence":[88],"Graph":[89],"(HoDCG)":[90],"infer":[92],"constraint":[95],"format":[98],"of":[99],"strings":[100],"from":[101],"instruction.":[104],"Finally,":[105],"use":[107],"path-planning":[110],"algorithm":[111],"finds":[113],"optimal":[115],"paths":[116],"for":[117],"given":[119],"objective":[120],"and":[121],"constraint.":[123],"Experiment":[124],"results":[125],"show":[126],"how":[127],"instruction":[130],"converted":[132],"driven":[136],"an":[138],"implicit":[139],"requirement.":[141]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
