{"id":"https://openalex.org/W3196782655","doi":"https://doi.org/10.1080/01691864.2021.1970020","title":"Wide-range routing method for lunar exploration rovers using multi-objective optimization","display_name":"Wide-range routing method for lunar exploration rovers using multi-objective optimization","publication_year":2021,"publication_date":"2021-09-05","ids":{"openalex":"https://openalex.org/W3196782655","doi":"https://doi.org/10.1080/01691864.2021.1970020","mag":"3196782655"},"language":"en","primary_location":{"id":"doi:10.1080/01691864.2021.1970020","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01691864.2021.1970020","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/Wide-range_routing_method_for_lunar_exploration_rovers_using_multi-objective_optimization/16571478","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009069720","display_name":"Reina Nakanishi","orcid":null},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Reina Nakanishi","raw_affiliation_strings":["Dept. of Mechanical Engineering, Keio University, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mechanical Engineering, Keio University, Tokyo, Japan","institution_ids":["https://openalex.org/I203951103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018788822","display_name":"Genya Ishigami","orcid":"https://orcid.org/0000-0003-2107-3471"},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Genya Ishigami","raw_affiliation_strings":["Dept. of Mechanical Engineering, Keio University, Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0003-2107-3471","affiliations":[{"raw_affiliation_string":"Dept. of Mechanical Engineering, Keio University, Tokyo, Japan","institution_ids":["https://openalex.org/I203951103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018788822"],"corresponding_institution_ids":["https://openalex.org/I203951103"],"apc_list":null,"apc_paid":null,"fwci":0.1942,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.49407811,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"35","issue":"21-22","first_page":"1317","last_page":"1331"},"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.9825999736785889,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9722999930381775,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.6520793437957764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6447383761405945},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6087714433670044},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5789220333099365},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5194370746612549},{"id":"https://openalex.org/keywords/standard-deviation","display_name":"Standard deviation","score":0.4186815917491913},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41606035828590393},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4105679392814636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3189399242401123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19908905029296875},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12282240390777588},{"id":"https://openalex.org/keywords/aerospace-engineering","display_name":"Aerospace engineering","score":0.0816323459148407}],"concepts":[{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.6520793437957764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6447383761405945},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6087714433670044},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5789220333099365},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5194370746612549},{"id":"https://openalex.org/C22679943","wikidata":"https://www.wikidata.org/wiki/Q159375","display_name":"Standard deviation","level":2,"score":0.4186815917491913},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41606035828590393},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4105679392814636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3189399242401123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19908905029296875},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12282240390777588},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0816323459148407},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/01691864.2021.1970020","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01691864.2021.1970020","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","raw_type":"journal-article"},{"id":"pmh:oai:figshare.com:article/16571478","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Wide-range_routing_method_for_lunar_exploration_rovers_using_multi-objective_optimization/16571478","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"doi:10.6084/m9.figshare.16571478.v1","is_oa":true,"landing_page_url":"https://doi.org/10.6084/m9.figshare.16571478.v1","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/16571478","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Wide-range_routing_method_for_lunar_exploration_rovers_using_multi-objective_optimization/16571478","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W184668183","https://openalex.org/W1697891746","https://openalex.org/W1995424719","https://openalex.org/W2000152514","https://openalex.org/W2050819731","https://openalex.org/W2091564622","https://openalex.org/W2126105956","https://openalex.org/W2133833812","https://openalex.org/W2137849348","https://openalex.org/W2173197174","https://openalex.org/W2612476481","https://openalex.org/W2971389545","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2994881281","https://openalex.org/W606801092","https://openalex.org/W3005711171","https://openalex.org/W2016931564","https://openalex.org/W184668183","https://openalex.org/W4213164143","https://openalex.org/W2125009529","https://openalex.org/W4313125656","https://openalex.org/W4306168826","https://openalex.org/W2546686995"],"abstract_inverted_index":{"This":[0,52,87],"paper":[1],"presents":[2],"a":[3,12,104,128,153],"wide-range":[4],"routing":[5,55,129],"method":[6,100,166,178],"for":[7,11,49,107,122],"multiple":[8,25,39,62,85,181],"rovers":[9],"deployed":[10],"lunar":[13],"polar":[14],"exploration":[15,26,45,117,142,158],"mission.":[16],"In":[17],"the":[18,44,61,75,84,93,98,109,112,123,132,139,164,176,180,186,191],"mission":[19],"scenario":[20,68],"considered":[21],"in":[22,144],"this":[23],"paper,":[24],"points":[27,34,46,143],"are":[28,47,57,170],"divided":[29],"into":[30,119],"several":[31,120],"sets":[32],"of":[33,80,103,125,141],"to":[35,38,70,92],"be":[36],"assigned":[37],"rovers.":[40,86,126],"Subsequently,":[41,127],"routes":[42,187],"between":[43,156],"generated":[48],"each":[50,145],"rover.":[51],"assignment":[53],"and":[54,77,135,195],"problems":[56,183],"well":[58],"known":[59],"as":[60],"Traveling":[63],"Salesman":[64],"Problem":[65],"(mTSP).":[66],"The":[67,160],"aims":[69],"minimize":[71,196],"two":[72,157],"objective":[73],"functions:":[74],"sum":[76],"standard":[78],"deviation":[79],"operation":[81,193],"time":[82,194],"among":[83],"problem":[88],"is":[89,101],"then":[90,151],"subject":[91],"multi-objective":[94],"mTSP":[95],"(MOmTSP).":[96],"Therefore,":[97],"proposed":[99,165,177],"composed":[102],"three-step":[105],"procedure":[106],"solving":[108],"MOmTSP.":[110],"First,":[111],"k-means":[113],"algorithm":[114,130,137],"divides":[115],"an":[116],"area":[118],"regions":[121],"number":[124],"with":[131,167],"space-filling":[133],"curve":[134],"2-opt":[136],"determines":[138],"order":[140],"region.":[146],"A":[147],"local":[148],"path":[149,155],"planner":[150],"generates":[152],"feasible":[154],"points.":[159],"simulation":[161],"results":[162],"using":[163],"80":[168],"cases":[169],"statistically":[171],"analyzed.":[172],"We":[173],"confirm":[174],"that":[175,188],"solves":[179],"optimization":[182],"by":[184],"finding":[185],"can":[189],"equalize":[190],"rover's":[192],"their":[197],"deviations.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}