{"id":"https://openalex.org/W2171940562","doi":"https://doi.org/10.1109/robot.2009.5152696","title":"Path diversity is only part of the problem","display_name":"Path diversity is only part of the problem","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2171940562","doi":"https://doi.org/10.1109/robot.2009.5152696","mag":"2171940562"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2009.5152696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2009.5152696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Robotics and Automation","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/A5027264368","display_name":"Ross A. Knepper","orcid":"https://orcid.org/0000-0003-0462-5502"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R.A. Knepper","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002872886","display_name":"Matthew T. Mason","orcid":"https://orcid.org/0000-0002-2672-5689"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.T. Mason","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027264368"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":3.2807,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.93168148,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3224","last_page":"3229"},"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9904000163078308,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9878000020980835,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.8052110075950623},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7897393107414246},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.7397361397743225},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.7206394076347351},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6085308790206909},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5806829929351807},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.577278733253479},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5740081667900085},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5539813041687012},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.5318854451179504},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5305395722389221},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.48263412714004517},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4745774269104004},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3651462495326996},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3385835289955139},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.2782512307167053},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24174347519874573},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.09015145897865295},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.08315044641494751},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05876803398132324}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8052110075950623},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7897393107414246},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.7397361397743225},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.7206394076347351},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6085308790206909},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5806829929351807},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.577278733253479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5740081667900085},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5539813041687012},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5318854451179504},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5305395722389221},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.48263412714004517},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4745774269104004},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3651462495326996},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3385835289955139},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.2782512307167053},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24174347519874573},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.09015145897865295},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.08315044641494751},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05876803398132324},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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/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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/robot.2009.5152696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2009.5152696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.358","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.358","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.699999988079071,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1531355326","https://openalex.org/W1563055131","https://openalex.org/W2055207897","https://openalex.org/W2091307069","https://openalex.org/W2107246263","https://openalex.org/W2112224432","https://openalex.org/W2117211893","https://openalex.org/W2119226109","https://openalex.org/W2121806728","https://openalex.org/W2124651605","https://openalex.org/W2125523198","https://openalex.org/W2134577665","https://openalex.org/W2154844948","https://openalex.org/W2158379988","https://openalex.org/W2171331791","https://openalex.org/W2399732523","https://openalex.org/W2404189583","https://openalex.org/W2758107681","https://openalex.org/W2949205176","https://openalex.org/W3083764925","https://openalex.org/W4235740860","https://openalex.org/W6631685650","https://openalex.org/W6678078320"],"related_works":["https://openalex.org/W3119736302","https://openalex.org/W2576812951","https://openalex.org/W2368795992","https://openalex.org/W2908094156","https://openalex.org/W2990979393","https://openalex.org/W2966249567","https://openalex.org/W4308080200","https://openalex.org/W1997369033","https://openalex.org/W1957996277","https://openalex.org/W2591763881"],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,34,45,61,74,90,194],"motion":[3],"planning":[4,96,131],"is":[5,16,42],"to":[6,28,78,170],"find":[7],"a":[8,25,43,87,125,134,140,154],"feasible":[9,46],"path":[10,40,92,101,105,119,137,150,161,180],"that":[11,124,176,197],"connects":[12],"two":[13,183,200],"positions":[14],"and":[15,37,48,113,133,178],"free":[17],"from":[18],"collision":[19,66,153],"with":[20,67],"obstacles.":[21,68],"Path":[22],"sets":[23],"are":[24,182],"robust":[26],"approach":[27],"this":[29,129,173,189],"problem":[30,132],"in":[31,118,162],"the":[32,75,84,97,159,195,199],"face":[33],"real-world":[35],"complexity":[36],"uncertainty.":[38],"A":[39,53,69,100],"set":[41,102,151],"collection":[44],"paths":[47,64,77],"their":[49],"corresponding":[50],"control":[51],"sequences.":[52],"path-set-based":[54],"planner":[55],"navigates":[56],"by":[57],"repeatedly":[58],"testing":[59],"each":[60,82,91],"these":[62,165],"robot-fixed":[63],"for":[65,152],"heuristic":[70],"function":[71],"selects":[72],"which":[73],"surviving":[76],"follow":[79],"next.":[80],"At":[81],"step,":[83],"robot":[85,141],"follows":[86],"small":[88],"piece":[89],"selected":[93],"while":[94],"simultaneously":[95],"subsequent":[98],"trajectory.":[99],"possesses":[103],"high":[104],"diversity":[106,120,138,181],"if":[107],"it":[108],"performs":[109],"well":[110],"at":[111],"obstacle-avoidance":[112],"goal-seeking":[114],"behaviors.":[115],"Previous":[116],"work":[117],"has":[121],"tacitly":[122],"assumed":[123],"correlation":[126],"exists":[127],"between":[128],"dynamic":[130,179],"simpler,":[135],"static":[136,177],"problem:":[139],"placed":[142],"randomly":[143],"into":[144],"an":[145],"obstacle":[146],"field":[147],"evaluates":[148],"its":[149],"single":[155],"time":[156],"before":[157],"following":[158],"chosen":[160],"entirety.":[163],"Although":[164],"problems":[166],"might":[167],"intuitively":[168],"appear":[169],"be":[171],"linked,":[172],"paper":[174],"shows":[175],"distinct":[184],"properties.":[185],"After":[186],"empirically":[187],"demonstrating":[188],"fact,":[190],"we":[191],"discuss":[192],"some":[193],"factors":[196],"differentiate":[198],"problems.":[201]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}