{"id":"https://openalex.org/W1991323027","doi":"https://doi.org/10.1109/is3c.2012.72","title":"A Diamond Search Algorithm of Travel Route Planning","display_name":"A Diamond Search Algorithm of Travel Route Planning","alternate_titles":[],"publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W1991323027","doi":"https://doi.org/10.1109/is3c.2012.72","mag":"1991323027"},"language":"en","primary_location":{"id":"doi:10.1109/is3c.2012.72","doi":"https://doi.org/10.1109/is3c.2012.72","is_oa":false,"landing_page_url":"https://doi.org/10.1109/is3c.2012.72","pdf_url":null,"source":{"id":"https://openalex.org/S4306420112","display_name":"International Symposium on Computer, Consumer and Control","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Symposium on Computer, Consumer and Control","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W1991323027"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5111877880","display_name":"Chao\u2010Yin Hsiao","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4880106","display_name":"Feng Chia University","ror":"https://ror.org/05vhczg54","country_code":"TW","type":"education","lineage":["https://openalex.org/I4880106"]}],"countries":["TW"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Chao-Yin Hsiao","raw_affiliation_strings":["Department of Mechanical and Computer Aided Engineering, Feng Chia University, Taiwan","Dept. of Mech. & Comput. Aided Eng., Feng Chia Univ., Feng Chi, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Computer Aided Engineering, Feng Chia University, Taiwan","institution_ids":["https://openalex.org/I4880106"]},{"raw_affiliation_string":"Dept. of Mech. & Comput. Aided Eng., Feng Chia Univ., Feng Chi, Taiwan","institution_ids":["https://openalex.org/I4880106"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071348472","display_name":"Zong-Long Li","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4880106","display_name":"Feng Chia University","ror":"https://ror.org/05vhczg54","country_code":"TW","type":"education","lineage":["https://openalex.org/I4880106"]}],"countries":["TW"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Zong-Long Li","raw_affiliation_strings":["Department of Mechanical and Computer Aided Engineering, Feng Chia University, Taiwan","Dept. of Mech. & Comput. Aided Eng., Feng Chia Univ., Feng Chi, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Computer Aided Engineering, Feng Chia University, Taiwan","institution_ids":["https://openalex.org/I4880106"]},{"raw_affiliation_string":"Dept. of Mech. & Comput. Aided Eng., Feng Chia Univ., Feng Chi, Taiwan","institution_ids":["https://openalex.org/I4880106"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113613724","display_name":"Ching-Sheng Chiu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4880106","display_name":"Feng Chia University","ror":"https://ror.org/05vhczg54","country_code":"TW","type":"education","lineage":["https://openalex.org/I4880106"]}],"countries":["TW"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Ching-Sheng Chiu","raw_affiliation_strings":["Department of Urban Planning and Spatial Information, Feng Chia University, Taichung, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Urban Planning and Spatial Information, Feng Chia University, Taichung, Taiwan","institution_ids":["https://openalex.org/I4880106"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4880106"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"258","last_page":"261"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.7113999724388123,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.7113999724388123,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.09809999912977219,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.08640000224113464,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/travel-route-planning","display_name":"travel route planning","score":0.9869999885559082},{"id":"https://openalex.org/keywords/optimal-path-finding","display_name":"optimal path finding","score":0.5609999895095825},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.5899999737739563},{"id":"https://openalex.org/keywords/process-planning","display_name":"process planning","score":0.722000002861023}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7932791113853455},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7152410745620728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7087910175323486},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6359190940856934},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5963591933250427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5860634446144104},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5252510905265808},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46147915720939636},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.449036568403244},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44698572158813477},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41282325983047485},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4123052954673767},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3522520661354065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16461911797523499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13826408982276917},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1278337836265564},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1251198649406433},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07975736260414124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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":1,"locations":[{"id":"doi:10.1109/is3c.2012.72","doi":"https://doi.org/10.1109/is3c.2012.72","is_oa":false,"landing_page_url":"https://doi.org/10.1109/is3c.2012.72","pdf_url":null,"source":{"id":"https://openalex.org/S4306420112","display_name":"International Symposium on Computer, Consumer and Control","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Symposium on Computer, Consumer and Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4943999946117401}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1556800872","https://openalex.org/W1689361651","https://openalex.org/W2030874472","https://openalex.org/W2036739882","https://openalex.org/W2060663452","https://openalex.org/W2115913201","https://openalex.org/W2131237536","https://openalex.org/W2200200164","https://openalex.org/W2319958627","https://openalex.org/W3021035068","https://openalex.org/W4206963553","https://openalex.org/W7066321343"],"related_works":["https://openalex.org/W2043228396","https://openalex.org/W3004125348","https://openalex.org/W2075544683","https://openalex.org/W2126507513","https://openalex.org/W4416038564","https://openalex.org/W624648631","https://openalex.org/W2012680538","https://openalex.org/W2350480931","https://openalex.org/W2168695391","https://openalex.org/W2378642186"],"abstract_inverted_index":{"Many":[0],"optimal":[1,30,72,115],"algorithms":[2],"for":[3,32,56,171],"travel":[4,33,172],"route":[5,34,116,173],"planning":[6,35],"have":[7],"been":[8],"successfully":[9],"and":[10,22,53,66,74,82,98,121,193],"widely":[11],"used":[12],"in":[13,147],"the":[14,29,58,63,67,75,79,83,93,99,105,114,118,122,130,134,142,148,158,178,183],"fields":[15,184],"of":[16,38,42,85,95,107,133,136,141,150,185],"dynamic":[17,188],"system":[18],"control,":[19,189],"decision":[20,186],"making,":[21,187],"manufacture":[23],"processes":[24],"planning.":[25],"In":[26],"this":[27,156],"paper,":[28],"algorithm":[31,48,106,157,163],"with":[36],"constrains":[37],"a":[39],"given":[40],"set":[41,84,94,135],"mid":[43,86,96,137],"nodes":[44,87,97,132],"is":[45,125,146],"proposed.":[46],"The":[47,71,139],"provides":[49],"an":[50,168],"efficient":[51,169],"cost":[52,77],"path":[54],"computation":[55,170],"searching":[57,129],"road":[59,144],"map":[60,145],"from":[61],"both":[62],"start":[64,80,119],"note":[65],"target":[68,100,123],"node":[69,81,120,124],"simultaneously.":[70],"trajectory":[73],"related":[76],"between":[78,92,117],"as":[88,90],"well":[89],"that":[91,113],"can":[101,166],"be":[102,180],"determined":[103,126],"by":[104,127],"Dijkstra":[108],"or":[109],"other":[110],"algorithms,":[111],"after":[112],"only":[128,165],"necessary":[131],"nodes.":[138],"shape":[140],"searched":[143],"form":[149],"skewed":[151],"diamond":[152,159],"so":[153],"we":[154],"call":[155],"search":[160],"algorithm.":[161],"This":[162],"not":[164],"provide":[167],"planning,":[174],"but":[175],"also":[176],"has":[177],"potential":[179],"applied":[181],"to":[182],"unmanned":[190],"vehicle":[191],"navigation,":[192],"automated":[194],"manufacturing":[195],"processes.":[196]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1991323027","counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
