{"id":"https://openalex.org/W2785891102","doi":"https://doi.org/10.1109/ascc.2017.8287161","title":"A branch-and-bound approach for path planning of vehicles under navigation relayed by multiple stations","display_name":"A branch-and-bound approach for path planning of vehicles under navigation relayed by multiple stations","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2785891102","doi":"https://doi.org/10.1109/ascc.2017.8287161","mag":"2785891102"},"language":"en","primary_location":{"id":"doi:10.1109/ascc.2017.8287161","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ascc.2017.8287161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 11th Asian Control Conference (ASCC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5029005549","display_name":"Mingfeng Qi","orcid":"https://orcid.org/0000-0001-6640-3222"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mingfeng Qi","raw_affiliation_strings":["Decision of Complex Systems, Beijing Institute of Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Decision of Complex Systems, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104108147","display_name":"Lihua Dou","orcid":null},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lihua Dou","raw_affiliation_strings":["Beijing Adcanced Innovation Center for Intelligent Robots and Systems, Beijing Institute of Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Adcanced Innovation Center for Intelligent Robots and Systems, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020307082","display_name":"Bin Xin","orcid":"https://orcid.org/0000-0001-9989-0418"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Xin","raw_affiliation_strings":["Beijing Adcanced Innovation Center for Intelligent Robots and Systems, Beijing Institute of Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Adcanced Innovation Center for Intelligent Robots and Systems, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100333005","display_name":"Jie Chen","orcid":"https://orcid.org/0000-0003-2449-9793"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jie Chen","raw_affiliation_strings":["Beijing Adcanced Innovation Center for Intelligent Robots and Systems, Beijing Institute of Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Adcanced Innovation Center for Intelligent Robots and Systems, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I125839683"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"168","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958999752998352,"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"}},{"id":"https://openalex.org/T11622","display_name":"Maritime Navigation and Safety","score":0.9746999740600586,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/motion-planning","display_name":"Motion planning","score":0.6669436693191528},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.663307785987854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6486122012138367},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6199547052383423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5774097442626953},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5408307909965515},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5311642289161682},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5096571445465088},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5090531706809998},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4968409836292267},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.4914156198501587},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.4863603711128235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2574891149997711},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13851961493492126},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.0617142915725708}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6669436693191528},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.663307785987854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6486122012138367},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6199547052383423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5774097442626953},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5408307909965515},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5311642289161682},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5096571445465088},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5090531706809998},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4968409836292267},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.4914156198501587},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.4863603711128235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2574891149997711},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13851961493492126},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0617142915725708},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"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/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ascc.2017.8287161","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ascc.2017.8287161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 11th Asian Control Conference (ASCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"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":14,"referenced_works":["https://openalex.org/W1507592509","https://openalex.org/W1595159159","https://openalex.org/W1963533848","https://openalex.org/W1970161443","https://openalex.org/W1982421201","https://openalex.org/W2045940440","https://openalex.org/W2059369105","https://openalex.org/W2071990734","https://openalex.org/W2081777693","https://openalex.org/W2145479420","https://openalex.org/W2152028815","https://openalex.org/W2155134687","https://openalex.org/W2157623189","https://openalex.org/W2277678953"],"related_works":["https://openalex.org/W1997215277","https://openalex.org/W2591763881","https://openalex.org/W3014413606","https://openalex.org/W1660309994","https://openalex.org/W1999818096","https://openalex.org/W2041676367","https://openalex.org/W4248516644","https://openalex.org/W2070184056","https://openalex.org/W2019352326","https://openalex.org/W2785891102"],"abstract_inverted_index":{"The":[0],"optimal":[1,42],"path":[2,56,98],"planning":[3,54],"problem":[4,30,37],"for":[5,74,99],"vehicles":[6],"under":[7],"navigation":[8,45,81],"relayed":[9],"by":[10,23,80],"multiple":[11,24],"stations":[12,25],"(OPP-V-NRMS)":[13],"arises":[14],"when":[15],"a":[16,32,49,55,64,84,94,120],"vehicle":[17],"needs":[18],"to":[19,26,92],"be":[20],"sequentially":[21],"navigated":[22],"its":[27],"destination.":[28],"This":[29],"is":[31,48,63,72,90],"hierarchical":[33],"mixed-variable":[34],"constrained":[35,66],"optimization":[36,51,67],"consisting":[38],"of":[39,44],"determining":[40],"the":[41,59,76,100,106,111,115,127,137],"arrangement":[43],"stations,":[46,82],"which":[47,62],"combinatorial":[50],"problem,":[52],"and":[53,83,96,125,145],"based":[57,87],"on":[58,133,142],"determined":[60],"arrangement,":[61],"continuous-variable":[65],"problem.":[68],"A":[69],"branch-and-bound":[70,107,138],"approach":[71,108,118,130,139],"proposed":[73],"searching":[75],"decision":[77],"tree":[78],"posed":[79],"differential":[85],"evolution":[86],"(DE-based)":[88],"algorithm":[89],"applied":[91],"find":[93,110],"feasible":[95],"high-quality":[97],"vehicle.":[101],"Computational":[102],"results":[103],"show":[104],"that":[105,126],"can":[109],"same":[112],"solution":[113],"with":[114],"exhaustive":[116,128],"enumeration":[117,129],"at":[119],"much":[121],"lower":[122],"computational":[123],"cost,":[124],"only":[131],"works":[132],"small-scale":[134,144],"cases":[135],"while":[136],"performs":[140],"satisfactorily":[141],"both":[143],"large-scale":[146],"cases.":[147]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}