{"id":"https://openalex.org/W2773382374","doi":"https://doi.org/10.1587/transinf.2017edp7109","title":"BDD-Constrained A<sup>*</sup> Search: A Fast Method for Solving Constrained Shortest-Path Problems","display_name":"BDD-Constrained A<sup>*</sup> Search: A Fast Method for Solving Constrained Shortest-Path Problems","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2773382374","doi":"https://doi.org/10.1587/transinf.2017edp7109","mag":"2773382374"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2017edp7109","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2017edp7109","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/12/E100.D_2017EDP7109/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/12/E100.D_2017EDP7109/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000398473","display_name":"Takeuchi Fumito","orcid":null},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Fumito TAKEUCHI","raw_affiliation_strings":["Graduate School of Information Science and Technology, Hokkaido University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Hokkaido University","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101076405","display_name":"Masaaki Nishino","orcid":"https://orcid.org/0000-0001-6489-5446"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masaaki NISHINO","raw_affiliation_strings":["NTT Communication Science Laboratories, NTT Corporation"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Communication Science Laboratories, NTT Corporation","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090171057","display_name":"Norihito Yasuda","orcid":null},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Norihito YASUDA","raw_affiliation_strings":["NTT Communication Science Laboratories, NTT Corporation"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Communication Science Laboratories, NTT Corporation","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102966470","display_name":"Takuya Akiba","orcid":"https://orcid.org/0000-0002-8284-4375"},"institutions":[{"id":"https://openalex.org/I4210166566","display_name":"Preferred Networks (Japan)","ror":"https://ror.org/05xeefy56","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210166566"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takuya AKIBA","raw_affiliation_strings":["Preferred Networks Inc"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Preferred Networks Inc","institution_ids":["https://openalex.org/I4210166566"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011807509","display_name":"Shin-ichi Minato","orcid":"https://orcid.org/0000-0002-1397-1020"},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shin-ichi MINATO","raw_affiliation_strings":["Graduate School of Information Science and Technology, Hokkaido University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Hokkaido University","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100520423","display_name":"Masaaki Nagata","orcid":null},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masaaki NAGATA","raw_affiliation_strings":["NTT Communication Science Laboratories, NTT Corporation"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Communication Science Laboratories, NTT Corporation","institution_ids":["https://openalex.org/I2251713219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.21875259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"E100.D","issue":"12","first_page":"2945","last_page":"2952"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9745000004768372,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9742000102996826,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.8413647413253784},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7308205366134644},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7201209664344788},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6761182546615601},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5788427591323853},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.57286536693573},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4802742004394531},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4708031415939331},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.44925010204315186},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4218885898590088},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34395545721054077},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0764283537864685}],"concepts":[{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.8413647413253784},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7308205366134644},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7201209664344788},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6761182546615601},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5788427591323853},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.57286536693573},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4802742004394531},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4708031415939331},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.44925010204315186},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4218885898590088},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34395545721054077},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0764283537864685},{"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.1587/transinf.2017edp7109","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2017edp7109","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/12/E100.D_2017EDP7109/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1587/transinf.2017edp7109","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2017edp7109","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/12/E100.D_2017EDP7109/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2773382374.pdf","grobid_xml":"https://content.openalex.org/works/W2773382374.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1528768670","https://openalex.org/W1822932058","https://openalex.org/W1964443412","https://openalex.org/W1981162332","https://openalex.org/W1994143452","https://openalex.org/W1995415305","https://openalex.org/W2037140854","https://openalex.org/W2080267935","https://openalex.org/W2089402478","https://openalex.org/W2095689036","https://openalex.org/W2101234060","https://openalex.org/W2106784610","https://openalex.org/W2119295783","https://openalex.org/W2147996827","https://openalex.org/W2241988237"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W2056754788","https://openalex.org/W2019018557","https://openalex.org/W2334471432","https://openalex.org/W1998712144","https://openalex.org/W3004636964","https://openalex.org/W1487981883","https://openalex.org/W2163564638","https://openalex.org/W2037898264","https://openalex.org/W2109471565"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3,105,165],"the":[4,13,44,49,53,86,101,106,122,126,137,141,152,166,180,185,195],"constrained":[5],"DAG":[6,51,142],"shortest":[7,14,138],"path":[8,15,139],"problem":[9],"(CDSP),":[10],"which":[11],"finds":[12],"on":[16,28],"a":[17,33,129,132,176],"given":[18],"directed":[19],"acyclic":[20],"graph":[21],"(DAG)":[22],"under":[23],"any":[24],"logical":[25,45],"constraints":[26],"posed":[27],"taken":[29],"edges.":[30],"There":[31],"exists":[32],"previous":[34],"work":[35],"that":[36,121,151,169],"uses":[37],"binary":[38],"decision":[39],"diagrams":[40],"(BDDs)":[41],"to":[42,72,160,190],"represent":[43],"constraints,":[46],"and":[47,52,58,70,110],"traverses":[48],"input":[50],"BDD":[54,68,127],"simultaneously.":[55],"The":[56,116],"time":[57,157],"space":[59],"complexity":[60],"of":[61,131,163],"this":[62],"BDD-based":[63,107],"method":[64,108,154,182],"is":[65,90,120,128,171],"derived":[66],"from":[67],"size,":[69],"tends":[71],"be":[73],"fast":[74],"only":[75],"when":[76],"BDDs":[77],"are":[78],"small.":[79],"However,":[80],"since":[81],"it":[82,170],"does":[83],"not":[84],"prioritize":[85],"search":[87,104,156],"order,":[88],"there":[89],"considerable":[91],"room":[92],"for":[93,96],"improvement,":[94],"particularly":[95,145],"large":[97],"BDDs.":[98],"We":[99],"combine":[100],"well-known":[102],"A*":[103],"synergistically,":[109],"implement":[111],"several":[112],"novel":[113],"heuristic":[114],"functions.":[115],"key":[117],"insight":[118],"here":[119],"\u2018shortest":[123],"path\u2019":[124],"in":[125,140],"solution":[130],"relaxed":[133],"problem,":[134],"just":[135],"as":[136],"is.":[143],"Experiments,":[144],"practical":[146],"machine":[147],"learning":[148],"applications,":[149],"show":[150],"proposed":[153,181],"decreases":[155],"by":[158],"up":[159,189],"2":[161],"orders":[162],"magnitude,":[164],"specific":[167],"result":[168],"2,000":[172],"times":[173,192],"faster":[174],"than":[175,194],"commercial":[177],"solver.":[178],"Moreover,":[179],"can":[183],"reduce":[184],"peak":[186],"memory":[187],"usage":[188],"40":[191],"less":[193],"conventional":[196],"method.":[197]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}