{"id":"https://openalex.org/W2551428019","doi":"https://doi.org/10.1109/coase.2016.7743527","title":"Path planning with user route preference - A reward surface approximation approach using orthogonal Legendre polynomials","display_name":"Path planning with user route preference - A reward surface approximation approach using orthogonal Legendre polynomials","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2551428019","doi":"https://doi.org/10.1109/coase.2016.7743527","mag":"2551428019"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2016.7743527","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2016.7743527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Automation Science and Engineering (CASE)","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/A5058741390","display_name":"Aravinda Ramakrishnan Srinivasan","orcid":"https://orcid.org/0000-0001-9280-7837"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aravinda Ramakrishnan Srinivasan","raw_affiliation_strings":["Department of Mechanical Aerospace and Biomedical Engineering, University of Tennessee, Knoxville, TN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Aerospace and Biomedical Engineering, University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046607346","display_name":"Subhadeep Chakraborty","orcid":"https://orcid.org/0000-0001-5035-9925"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhadeep Chakraborty","raw_affiliation_strings":["Department of Mechanical Aerospace and Biomedical Engineering, University of Tennessee, Knoxville, TN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Aerospace and Biomedical Engineering, University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058741390"],"corresponding_institution_ids":["https://openalex.org/I75027704"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.16254961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"34","issue":null,"first_page":"1100","last_page":"1105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.996399998664856,"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/computer-science","display_name":"Computer science","score":0.6007596254348755},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5614874362945557},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.541399359703064},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48206454515457153},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46674710512161255},{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.44450685381889343},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.4328842759132385},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4282810389995575},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3963702321052551},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34711575508117676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31042343378067017},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.2774282693862915}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6007596254348755},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5614874362945557},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.541399359703064},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48206454515457153},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46674710512161255},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.44450685381889343},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.4328842759132385},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4282810389995575},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3963702321052551},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34711575508117676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31042343378067017},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.2774282693862915},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/coase.2016.7743527","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2016.7743527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:162141","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1557499844","https://openalex.org/W1963649406","https://openalex.org/W1969483458","https://openalex.org/W1980516134","https://openalex.org/W1986014385","https://openalex.org/W1996625075","https://openalex.org/W1997458507","https://openalex.org/W1999874108","https://openalex.org/W2018020788","https://openalex.org/W2031580264","https://openalex.org/W2057134775","https://openalex.org/W2061562262","https://openalex.org/W2085248615","https://openalex.org/W2098774185","https://openalex.org/W2119567691","https://openalex.org/W2131825035","https://openalex.org/W2140135625","https://openalex.org/W2150113360","https://openalex.org/W2154018708","https://openalex.org/W2157719307","https://openalex.org/W2168148394","https://openalex.org/W2168654130","https://openalex.org/W2169528473","https://openalex.org/W2187006281","https://openalex.org/W2210721416","https://openalex.org/W2287850282","https://openalex.org/W2773725776","https://openalex.org/W4298023569","https://openalex.org/W6674884181","https://openalex.org/W6680657880","https://openalex.org/W6687137410","https://openalex.org/W6688524242","https://openalex.org/W6696273291"],"related_works":["https://openalex.org/W4306904969","https://openalex.org/W4400868993","https://openalex.org/W3096874164","https://openalex.org/W1985560493","https://openalex.org/W2386410636","https://openalex.org/W2357975469","https://openalex.org/W2145363145","https://openalex.org/W1626977535","https://openalex.org/W2341346307","https://openalex.org/W3168977894"],"abstract_inverted_index":{"As":[0],"self":[1],"driving":[2],"cars":[3],"become":[4,95],"more":[5],"ubiquitous,":[6],"users":[7],"would":[8],"look":[9],"for":[10,59],"natural":[11],"ways":[12],"of":[13,22,126,143,155,182,201,210,213,216,243],"informing":[14],"the":[15,71,85,92,123,129,134,144,153,156,169,173,180,193,214,217,241],"car":[16],"AI":[17],"about":[18],"their":[19],"personal":[20],"choice":[21,25,78],"routes.":[23],"This":[24,52],"is":[26,100,137,158,176,196,228],"not":[27],"always":[28],"dictated":[29],"by":[30,44],"straightforward":[31],"logic":[32],"such":[33,47,60],"as":[34,48,102],"shortest":[35,38],"distance":[36],"or":[37],"time,":[39],"and":[40,50,75,110,131,133,166],"can":[41],"be":[42,140],"influenced":[43],"hidden":[45],"factors,":[46],"comfort":[49],"familiarity.":[51],"paper":[53],"presents":[54],"a":[55,103,141,189,199,207],"path":[56,73,171],"learning":[57,98,164,226],"algorithm":[58,165],"applications,":[61],"where":[62],"from":[63,114,167],"limited":[64],"positive":[65],"demonstrations,":[66],"an":[67,161],"autonomous":[68],"agent":[69],"learns":[70],"user's":[72,135],"preference":[74],"honors":[76],"that":[77,168,236],"in":[79,224],"its":[80],"route":[81],"planning,":[82],"but":[83],"has":[84,237],"capability":[86],"to":[87,117,122,139,231,240],"adopt":[88],"alternate":[89],"routes,":[90],"if":[91],"original":[93],"choice(s)":[94],"impractical.":[96],"The":[97,107,147],"problem":[99,181],"modeled":[101],"Markov":[104],"decision":[105],"process.":[106],"states":[108],"(way-points)":[109],"actions":[111],"(to":[112],"move":[113],"one":[115],"way-point":[116],"another)":[118],"are":[119],"pre-defined":[120],"according":[121],"existing":[124],"network":[125],"paths":[127],"between":[128],"origin":[130],"destination":[132],"demonstration":[136,157,175],"assumed":[138],"sample":[142],"preferred":[145],"path.":[146],"underlying":[148],"reward":[149,194],"function":[150,195],"which":[151],"captures":[152],"essence":[154],"computed":[159],"using":[160,198,232],"inverse":[162],"reinforcement":[163],"entire":[170],"mirroring":[172],"expert's":[174],"extracted.":[177],"To":[178],"alleviate":[179],"state":[183,191,218],"space":[184],"explosion":[185],"when":[186],"dealing":[187],"with":[188,206],"large":[190],"space,":[192],"approximated":[197],"set":[200],"orthogonal":[202],"polynomial":[203],"basis":[204,234],"functions":[205],"fixed":[208],"number":[209,242],"coefficients":[211],"regardless":[212],"size":[215],"space.":[219],"A":[220],"six":[221],"fold":[222],"reduction":[223],"total":[225],"time":[227],"achieved":[229],"compared":[230],"simple":[233],"functions,":[235],"dimensionality":[238],"equal":[239],"distinct":[244],"states.":[245]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}