{"id":"https://openalex.org/W2077828922","doi":"https://doi.org/10.1109/smc.2014.6974170","title":"Informative path planning with a human path constraint","display_name":"Informative path planning with a human path constraint","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2077828922","doi":"https://doi.org/10.1109/smc.2014.6974170","mag":"2077828922"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2014.6974170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2014.6974170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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/A5022946078","display_name":"Daqign 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":"Daqign Yi","raw_affiliation_strings":["Department of Computer Science, Brigham Young University, Provo, Utah","Department of Computer Science, Brigham Young University, Provo, Utah 84604, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brigham Young University, Provo, Utah","institution_ids":["https://openalex.org/I100005738"]},{"raw_affiliation_string":"Department of Computer Science, Brigham Young University, Provo, Utah 84604, 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":["Department of Computer Science, Brigham Young University, Provo, Utah","Department of Computer Science, Brigham Young University, Provo, Utah 84604, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brigham Young University, Provo, Utah","institution_ids":["https://openalex.org/I100005738"]},{"raw_affiliation_string":"Department of Computer Science, Brigham Young University, Provo, Utah 84604, 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":["Department of Computer Science, Brigham Young University, Provo, Utah","Department of Computer Science, Brigham Young University, Provo, Utah 84604, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brigham Young University, Provo, Utah","institution_ids":["https://openalex.org/I100005738"]},{"raw_affiliation_string":"Department of Computer Science, Brigham Young University, Provo, Utah 84604, USA","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022946078"],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":0.96456618,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81149034,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"1752","last_page":"1758"},"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9797999858856201,"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/backtracking","display_name":"Backtracking","score":0.7891459465026855},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6854759454727173},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6785175204277039},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6703861951828003},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6677274703979492},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5786097645759583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5706117153167725},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.562854528427124},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.5126025080680847},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4859846532344818},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.471090167760849},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4370875358581543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32360905408859253},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31742358207702637},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31742048263549805}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7891459465026855},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6854759454727173},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6785175204277039},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6703861951828003},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6677274703979492},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5786097645759583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5706117153167725},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.562854528427124},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.5126025080680847},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4859846532344818},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.471090167760849},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4370875358581543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32360905408859253},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31742358207702637},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31742048263549805},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc.2014.6974170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2014.6974170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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":18,"referenced_works":["https://openalex.org/W50980560","https://openalex.org/W1490384990","https://openalex.org/W1983758950","https://openalex.org/W2018020586","https://openalex.org/W2027031153","https://openalex.org/W2113873983","https://openalex.org/W2115384379","https://openalex.org/W2121142533","https://openalex.org/W2151239055","https://openalex.org/W2400908863","https://openalex.org/W2500139799","https://openalex.org/W2570178494","https://openalex.org/W2913764427","https://openalex.org/W3099664902","https://openalex.org/W6629242568","https://openalex.org/W6724212191","https://openalex.org/W6785177498","https://openalex.org/W7020126621"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W4302557420","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2904203243"],"abstract_inverted_index":{"One":[0],"way":[1],"for":[2,15,116],"a":[3,6,11,54,94,100],"human":[4,17,52],"and":[5,25,57,87,120],"robot":[7,29],"to":[8,18,30,36,45,70,78,111,126],"collaborate":[9],"on":[10,21,104],"search":[12,76],"task":[13],"is":[14,69,109,124],"the":[16,22,28,46,51,75,84,90],"specify":[19],"constraints":[20],"robot's":[23,47,67],"path":[24,34,55,85],"then":[26,88],"allow":[27],"find":[31],"an":[32,42,58,113,121,128],"optimal":[33],"subject":[35,77],"these":[37],"constraints.":[38],"This":[39],"paper":[40],"presents":[41],"anytime":[43,129],"solution":[44],"path-planning":[48],"problem":[49,92,103],"when":[50],"specifies":[53],"constraint":[56,86],"acceptable":[59],"amount":[60],"of":[61],"deviation":[62],"from":[63],"this":[64,79,105,118],"path.":[65],"The":[66],"objective":[68],"maximize":[71],"information":[72],"gathered":[73],"during":[74],"constraint.":[80],"We":[81],"first":[82],"discretize":[83],"convert":[89],"resulting":[91],"into":[93],"multi-partite":[95],"graph.":[96],"Information":[97],"maximization":[98],"becomes":[99],"submodular":[101],"orienteering":[102],"topology":[106],"structure.":[107],"Backtracking":[108],"used":[110,125],"generate":[112],"efficient":[114],"heuristic":[115],"solving":[117],"problem,":[119],"expanding":[122],"tree":[123],"facilitate":[127],"algorithm.":[130]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}