{"id":"https://openalex.org/W3128926521","doi":"https://doi.org/10.1109/gol49479.2020.9314764","title":"Minimax Strategy for Lane Choice Prediction in Markovian Traffic Modeling","display_name":"Minimax Strategy for Lane Choice Prediction in Markovian Traffic Modeling","publication_year":2020,"publication_date":"2020-10-28","ids":{"openalex":"https://openalex.org/W3128926521","doi":"https://doi.org/10.1109/gol49479.2020.9314764","mag":"3128926521"},"language":"en","primary_location":{"id":"doi:10.1109/gol49479.2020.9314764","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gol49479.2020.9314764","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 5th International Conference on Logistics Operations Management (GOL)","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/A5047556734","display_name":"M\u0103d\u0103lin-Dorin Pop","orcid":"https://orcid.org/0000-0002-2524-3370"},"institutions":[{"id":"https://openalex.org/I3122695212","display_name":"Polytechnic University of Timi\u015foara","ror":"https://ror.org/02v91gy68","country_code":"RO","type":"education","lineage":["https://openalex.org/I3122695212"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Madalin-Dorin Pop","raw_affiliation_strings":["Automation and Applied Informatics Department, Politehnica University of Timi\u015foara, Timi\u015foara, Rom\u00e2nia"],"affiliations":[{"raw_affiliation_string":"Automation and Applied Informatics Department, Politehnica University of Timi\u015foara, Timi\u015foara, Rom\u00e2nia","institution_ids":["https://openalex.org/I3122695212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016967605","display_name":"Octavian Pro\u0219tean","orcid":"https://orcid.org/0000-0002-0459-5916"},"institutions":[{"id":"https://openalex.org/I3122695212","display_name":"Polytechnic University of Timi\u015foara","ror":"https://ror.org/02v91gy68","country_code":"RO","type":"education","lineage":["https://openalex.org/I3122695212"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Octavian Prostean","raw_affiliation_strings":["Automation and Applied Informatics Department, Politehnica University of Timi\u015foara, Timi\u015foara, Rom\u00e2nia"],"affiliations":[{"raw_affiliation_string":"Automation and Applied Informatics Department, Politehnica University of Timi\u015foara, Timi\u015foara, Rom\u00e2nia","institution_ids":["https://openalex.org/I3122695212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068784918","display_name":"Gabriela Pro\u015ftean","orcid":"https://orcid.org/0000-0002-0206-5516"},"institutions":[{"id":"https://openalex.org/I3122695212","display_name":"Polytechnic University of Timi\u015foara","ror":"https://ror.org/02v91gy68","country_code":"RO","type":"education","lineage":["https://openalex.org/I3122695212"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Gabriela Prostean","raw_affiliation_strings":["Management Department, Politehnica University of Timi\u015foara, Timi\u015foara, Rom\u00e2nia"],"affiliations":[{"raw_affiliation_string":"Management Department, Politehnica University of Timi\u015foara, Timi\u015foara, Rom\u00e2nia","institution_ids":["https://openalex.org/I3122695212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047556734"],"corresponding_institution_ids":["https://openalex.org/I3122695212"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.21190428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9994999766349792,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/computer-science","display_name":"Computer science","score":0.7203056216239929},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6089479327201843},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5745073556900024},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5695244073867798},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.549340546131134},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.508508563041687},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.49430179595947266},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4531247913837433},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.34003132581710815},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.33234429359436035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15143495798110962},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11638399958610535},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08616948127746582}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7203056216239929},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6089479327201843},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5745073556900024},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5695244073867798},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.549340546131134},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.508508563041687},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.49430179595947266},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4531247913837433},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.34003132581710815},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.33234429359436035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15143495798110962},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11638399958610535},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08616948127746582},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","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":1,"locations":[{"id":"doi:10.1109/gol49479.2020.9314764","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gol49479.2020.9314764","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 5th International Conference on Logistics Operations Management (GOL)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W107233025","https://openalex.org/W184180097","https://openalex.org/W1974337332","https://openalex.org/W1978520228","https://openalex.org/W2003031375","https://openalex.org/W2056877664","https://openalex.org/W2058401212","https://openalex.org/W2524077433","https://openalex.org/W2547655585","https://openalex.org/W2548999408","https://openalex.org/W2567218354","https://openalex.org/W2808024027","https://openalex.org/W2808192859","https://openalex.org/W2897546657","https://openalex.org/W2916594822","https://openalex.org/W3020997087"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"Daily,":[0],"vehicles":[1],"overload":[2],"the":[3,14,30,38,44,48,83,100,104,108,124,128,145,154,159,167,170,183],"road":[4,81],"networks.":[5],"Starting":[6],"from":[7],"this":[8,95,193],"worldwide":[9],"issue,":[10],"we":[11,27,41],"can":[12,42],"see":[13],"necessity":[15],"of":[16,47,65,80,147,169,188],"finding":[17],"solutions":[18,24],"for":[19,91,161],"travel":[20],"times":[21],"improvements.":[22],"Many":[23],"arise":[25],"if":[26],"look":[28],"at":[29],"lowest":[31],"possible":[32],"level":[33],"in":[34,192],"traffic":[35,134,138],"modeling.":[36],"At":[37],"microscopic":[39],"level,":[40],"have":[43],"best":[45,101],"overview":[46],"vehicle's":[49],"interactions,":[50],"about":[51],"their":[52],"velocity,":[53],"acceleration":[54],"or":[55],"lane":[56,66,84,112],"change":[57,85,113],"behavior.":[58],"This":[59],"paper":[60,96,194],"proposes":[61],"a":[62,78,92,119,189],"new":[63],"approach":[64],"choice":[67,163],"prediction":[68],"using":[69],"an":[70],"AI":[71],"(Artificial":[72],"Intelligence)":[73],"based":[74],"gaming":[75],"strategy.":[76],"Having":[77],"piece":[79],"with":[82,131,141,153,182],"action":[86,114],"modeled":[87],"as":[88,118,133,158,177],"Markovian":[89],"process,":[90],"chosen":[93],"vehicle,":[94],"aims":[97],"to":[98],"find":[99],"decision":[102],"considering":[103],"desired":[105],"destination":[106,135,178],"and":[107,144],"involved":[109,123],"costs.":[110],"The":[111,151,173],"will":[115],"be":[116],"described":[117],"game":[120],"where":[121],"is":[122],"vehicle":[125],"that":[126],"initiates":[127],"action,":[129],"together":[130],"parameters":[132],"volumes,":[136],"intermediary":[137],"volumes":[139,179],"associated":[140],"distinct":[142],"lanes":[143,148],"placement":[146],"splitting":[149],"points.":[150],"comparison":[152],"Dijkstra's":[155],"algorithm,":[156],"known":[157],"optimal":[160,185],"route":[162],"problem":[164],"solving,":[165],"proves":[166],"efficiency":[168],"proposed":[171],"approach.":[172],"similar":[174],"results":[175],"obtained":[176],"by":[180],"comparing":[181],"mentioned":[184],"algorithm":[186],"consists":[187],"validation":[190],"step":[191],"proposal.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}