{"id":"https://openalex.org/W4383108937","doi":"https://doi.org/10.1109/icra48891.2023.10160781","title":"Contextual Multi-Objective Path Planning","display_name":"Contextual Multi-Objective Path Planning","publication_year":2023,"publication_date":"2023-05-29","ids":{"openalex":"https://openalex.org/W4383108937","doi":"https://doi.org/10.1109/icra48891.2023.10160781"},"language":"en","primary_location":{"id":"doi:10.1109/icra48891.2023.10160781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48891.2023.10160781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","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/A5049730137","display_name":"Anna Nickelson","orcid":"https://orcid.org/0009-0002-8664-4116"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anna Nickelson","raw_affiliation_strings":["Collaborative Robotics & Intelligent Systems Institute, Oregon State University,Corvallis,OR,97331"],"affiliations":[{"raw_affiliation_string":"Collaborative Robotics & Intelligent Systems Institute, Oregon State University,Corvallis,OR,97331","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084748531","display_name":"Kagan Tumer","orcid":"https://orcid.org/0009-0007-3809-7257"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kagan Tumer","raw_affiliation_strings":["Collaborative Robotics & Intelligent Systems Institute, Oregon State University,Corvallis,OR,97331"],"affiliations":[{"raw_affiliation_string":"Collaborative Robotics & Intelligent Systems Institute, Oregon State University,Corvallis,OR,97331","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026622322","display_name":"William D. Smart","orcid":"https://orcid.org/0000-0001-6867-5125"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William D. Smart","raw_affiliation_strings":["Collaborative Robotics & Intelligent Systems Institute, Oregon State University,Corvallis,OR,97331"],"affiliations":[{"raw_affiliation_string":"Collaborative Robotics & Intelligent Systems Institute, Oregon State University,Corvallis,OR,97331","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049730137"],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":0.123,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.38963191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"10240","last_page":"10246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/motion-planning","display_name":"Motion planning","score":0.7870607376098633},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.739062488079071},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6888883709907532},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6844582557678223},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6283361315727234},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.609930157661438},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5712539553642273},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.532801628112793},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5227102041244507},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.48624172806739807},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.46399638056755066},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4404575228691101},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.38031473755836487},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27330613136291504},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.20821872353553772},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1393979787826538},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13670381903648376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11629778146743774}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7870607376098633},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.739062488079071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6888883709907532},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6844582557678223},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6283361315727234},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.609930157661438},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5712539553642273},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.532801628112793},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5227102041244507},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.48624172806739807},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.46399638056755066},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4404575228691101},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.38031473755836487},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27330613136291504},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.20821872353553772},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1393979787826538},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13670381903648376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11629778146743774},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra48891.2023.10160781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48891.2023.10160781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3003399847","display_name":null,"funder_award_id":"R01-EB024330","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G3611504697","display_name":null,"funder_award_id":"IIS-2112633","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332161","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2005854848","https://openalex.org/W2085248615","https://openalex.org/W2126105956","https://openalex.org/W2143651216","https://openalex.org/W2169528473","https://openalex.org/W2587832638","https://openalex.org/W2615145192","https://openalex.org/W2772079570","https://openalex.org/W2808970843","https://openalex.org/W2952077217","https://openalex.org/W3023935218","https://openalex.org/W3037164811","https://openalex.org/W3093505136","https://openalex.org/W4251644969","https://openalex.org/W4285249829","https://openalex.org/W4313148659","https://openalex.org/W6733535932"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2359600231","https://openalex.org/W2093343611","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583"],"abstract_inverted_index":{"Many":[0],"critical":[1],"robot":[2,87],"environments,":[3],"such":[4],"as":[5],"healthcare":[6],"and":[7,109],"security,":[8],"require":[9,24],"robots":[10,34],"to":[11,35,62,88,104,136,182,184,202],"account":[12],"for":[13,33],"contextdependent":[14],"criteria":[15],"when":[16,145],"performing":[17],"their":[18],"functions":[19],"(e.g.,":[20],"navigation).":[21],"Such":[22],"domains":[23],"decisions":[25],"that":[26,149,163],"balance":[27],"multiple":[28],"factors,":[29],"making":[30],"it":[31],"difficult":[32],"make":[36],"contextually":[37,172],"appropriate":[38,173],"decisions.":[39],"Multi-Objective":[40,79],"Optimization":[41],"(MOO)":[42],"methods":[43],"offer":[44],"a":[45,131,147,185],"potential":[46],"solution":[47],"by":[48,175],"trading":[49],"off":[50,90],"between":[51],"objectives;":[52],"however":[53],"concepts":[54],"like":[55],"Pareto":[56,72],"fronts":[57],"are":[58],"not":[59],"only":[60],"expensive":[61],"compute":[63],"but":[64],"struggle":[65],"with":[66],"differentiating":[67],"among":[68],"solutions":[69],"on":[70,95,160],"the":[71,77,86,106,124,127,152,156,178,193],"front.":[73],"This":[74,190],"work":[75,102],"introduces":[76],"Contextual":[78],"Path":[80],"Planning":[81],"(CMOPP)":[82],"algorithm,":[83],"which":[84,141],"enables":[85,192],"trade":[89],"different":[91],"complex":[92],"costs":[93],"dependent":[94],"context.":[96,153],"The":[97],"key":[98],"insight":[99],"of":[100,126,158,188,195],"this":[101],"is":[103,134],"separate":[105],"path":[107,110,139,148,167,197],"planning":[108,168],"cost":[111,121,198],"estimation":[112],"into":[113],"two":[114],"independent":[115],"steps,":[116],"thus":[117],"significantly":[118],"reducing":[119,177],"computation":[120,205],"without":[122],"impacting":[123],"quality":[125],"resulting":[128],"path.":[129],"As":[130],"result,":[132],"CMOPP":[133,159,170],"able":[135],"accurately":[137],"model":[138],"costs,":[140],"provide":[142],"meaningful":[143],"trade-offs":[144],"choosing":[146],"best":[150],"fits":[151],"We":[154],"show":[155],"benefits":[157],"case":[161],"studies":[162],"demonstrate":[164],"its":[165],"contextual":[166],"capabilities.":[169],"finds":[171],"paths":[174],"first":[176],"search":[179],"space":[180],"up":[181,201],"99.9%":[183],"near-optimal":[186],"set":[187],"paths.":[189],"reduction":[191],"generation":[194],"accurate":[196],"models,":[199],"using":[200],"90%":[203],"less":[204],"than":[206],"similar":[207],"methods.":[208]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}