{"id":"https://openalex.org/W4390401786","doi":"https://doi.org/10.1109/itnac59571.2023.10368579","title":"Deep Learning Based Path Planning Using Integer Linear Programming Method to Teacher Signal","display_name":"Deep Learning Based Path Planning Using Integer Linear Programming Method to Teacher Signal","publication_year":2023,"publication_date":"2023-11-29","ids":{"openalex":"https://openalex.org/W4390401786","doi":"https://doi.org/10.1109/itnac59571.2023.10368579"},"language":"en","primary_location":{"id":"doi:10.1109/itnac59571.2023.10368579","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/itnac59571.2023.10368579","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 33rd International Telecommunication Networks and Applications Conference","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/A5034979643","display_name":"Makoto Ito","orcid":"https://orcid.org/0000-0003-2687-7655"},"institutions":[{"id":"https://openalex.org/I104946051","display_name":"Nihon University","ror":"https://ror.org/05jk51a88","country_code":"JP","type":"education","lineage":["https://openalex.org/I104946051"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Makoto Ito","raw_affiliation_strings":["Graduate School of Engineering, Nihon University,Koriyama,Japan","Graduate School of Engineering, Nihon University, Koriyama, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Nihon University,Koriyama,Japan","institution_ids":["https://openalex.org/I104946051"]},{"raw_affiliation_string":"Graduate School of Engineering, Nihon University, Koriyama, Japan","institution_ids":["https://openalex.org/I104946051"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069940028","display_name":"Taiju Mikoshi","orcid":"https://orcid.org/0000-0002-5651-8891"},"institutions":[{"id":"https://openalex.org/I104946051","display_name":"Nihon University","ror":"https://ror.org/05jk51a88","country_code":"JP","type":"education","lineage":["https://openalex.org/I104946051"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Taiju Mikoshi","raw_affiliation_strings":["College of Engineering, Nihon University,Koriyama,Japan","College of Engineering, Nihon University, Koriyama, Japan"],"affiliations":[{"raw_affiliation_string":"College of Engineering, Nihon University,Koriyama,Japan","institution_ids":["https://openalex.org/I104946051"]},{"raw_affiliation_string":"College of Engineering, Nihon University, Koriyama, Japan","institution_ids":["https://openalex.org/I104946051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014962584","display_name":"Kouichi Genda","orcid":null},"institutions":[{"id":"https://openalex.org/I104946051","display_name":"Nihon University","ror":"https://ror.org/05jk51a88","country_code":"JP","type":"education","lineage":["https://openalex.org/I104946051"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kouichi Genda","raw_affiliation_strings":["College of Engineering, Nihon University,Koriyama,Japan","College of Engineering, Nihon University, Koriyama, Japan"],"affiliations":[{"raw_affiliation_string":"College of Engineering, Nihon University,Koriyama,Japan","institution_ids":["https://openalex.org/I104946051"]},{"raw_affiliation_string":"College of Engineering, Nihon University, Koriyama, Japan","institution_ids":["https://openalex.org/I104946051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034979643"],"corresponding_institution_ids":["https://openalex.org/I104946051"],"apc_list":null,"apc_paid":null,"fwci":0.2009,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54157901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"48","issue":null,"first_page":"92","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9991000294685364,"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.7638369798660278},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6698172092437744},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5676309466362},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5293753147125244},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5289713740348816},{"id":"https://openalex.org/keywords/traffic-signal","display_name":"Traffic signal","score":0.5283185839653015},{"id":"https://openalex.org/keywords/signal","display_name":"SIGNAL (programming language)","score":0.4626757502555847},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4601401090621948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44829583168029785},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.43117576837539673},{"id":"https://openalex.org/keywords/traffic-congestion","display_name":"Traffic congestion","score":0.41381949186325073},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.356245219707489},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3112916946411133},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2775217890739441},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1938304901123047},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1596616804599762},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11324483156204224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10511738061904907},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10163739323616028},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.08640450239181519}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7638369798660278},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6698172092437744},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5676309466362},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5293753147125244},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5289713740348816},{"id":"https://openalex.org/C2987419075","wikidata":"https://www.wikidata.org/wiki/Q8004","display_name":"Traffic signal","level":2,"score":0.5283185839653015},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.4626757502555847},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4601401090621948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44829583168029785},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.43117576837539673},{"id":"https://openalex.org/C2779888511","wikidata":"https://www.wikidata.org/wiki/Q244156","display_name":"Traffic congestion","level":2,"score":0.41381949186325073},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.356245219707489},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3112916946411133},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2775217890739441},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1938304901123047},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1596616804599762},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11324483156204224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10511738061904907},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10163739323616028},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.08640450239181519},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itnac59571.2023.10368579","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/itnac59571.2023.10368579","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 33rd International Telecommunication Networks and Applications Conference","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":15,"referenced_works":["https://openalex.org/W1533970845","https://openalex.org/W2096655151","https://openalex.org/W2097906305","https://openalex.org/W2098383356","https://openalex.org/W2111162397","https://openalex.org/W2122518670","https://openalex.org/W2162311977","https://openalex.org/W2566425973","https://openalex.org/W2893647509","https://openalex.org/W3019817166","https://openalex.org/W3103263926","https://openalex.org/W3139047626","https://openalex.org/W3197818567","https://openalex.org/W3198016648","https://openalex.org/W4200080157"],"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":{"It":[0,139],"is":[1,21,38,103,140],"an":[2],"important":[3],"research":[4],"topic":[5],"to":[6,40,120,135,160],"suppress":[7],"congestion":[8,65],"caused":[9],"by":[10],"rapid":[11],"increasing":[12],"of":[13,47,99,168,173],"traffic":[14,27,35],"volume":[15],"in":[16,77,171],"a":[17,22,59,78,84,112],"network.":[18],"Traffic":[19],"Engineering":[20],"technology":[23],"for":[24,64,116,131],"controlling":[25],"such":[26],"and":[28,44,91,176],"efficiently":[29],"using":[30,67,105],"network":[31],"resources.":[32],"For":[33],"sophisticated":[34],"control,":[36],"it":[37],"necessary":[39],"adopt":[41,111],"complex":[42,114],"calculations,":[43],"the":[45,96,100,106,117,132,157,161,166,180],"issue":[46],"calculation":[48,80,177],"time":[49,81,178],"cannot":[50],"be":[51,75],"ignored.":[52],"To":[53],"solve":[54],"these":[55],"problems,":[56],"we":[57,109,126,155],"proposed":[58,162],"centralized":[60],"path":[61,87],"planning":[62],"method":[63,71,102,159,163],"control":[66],"machine":[68],"learning.":[69],"This":[70],"shows":[72],"paths":[73],"can":[74],"designed":[76],"short":[79],"while":[82],"achieving":[83],"very":[85],"high":[86],"estimation":[88],"success":[89],"rate":[90],"load":[92,147,182],"balancing.":[93],"However,":[94],"since":[95],"teacher":[97,118,133],"signal":[98,119,134],"pre-proposed":[101,158],"calculated":[104],"dijkstra":[107],"algorithm,":[108],"must":[110],"more":[113],"algorithm":[115],"improve":[121,137],"performance.":[122,138],"In":[123],"this":[124,143],"paper,":[125],"use":[127],"Integer":[128],"Linear":[129],"Programming":[130],"further":[136],"expected":[141],"that":[142],"will":[144],"enable":[145],"better":[146],"distribution":[148],"than":[149],"before.":[150],"Through":[151],"performance":[152],"evaluation":[153],"experiments,":[154],"compare":[156],"and,":[164],"demonstrate":[165],"effectiveness":[167],"our":[169],"proposal":[170],"terms":[172],"bandwidth":[174],"usage":[175],"on":[179],"maximum":[181],"link.":[183]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}