{"id":"https://openalex.org/W4391350936","doi":"https://doi.org/10.1007/s10514-024-10156-6","title":"Maximal coverage problems with routing constraints using cross-entropy Monte Carlo tree search","display_name":"Maximal coverage problems with routing constraints using cross-entropy Monte Carlo tree search","publication_year":2024,"publication_date":"2024-01-30","ids":{"openalex":"https://openalex.org/W4391350936","doi":"https://doi.org/10.1007/s10514-024-10156-6"},"language":"en","primary_location":{"id":"doi:10.1007/s10514-024-10156-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10514-024-10156-6","pdf_url":null,"source":{"id":"https://openalex.org/S144091109","display_name":"Autonomous Robots","issn_l":"0929-5593","issn":["0929-5593","1573-7527"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Robots","raw_type":"journal-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/A5029201671","display_name":"Pao-Te Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Pao-Te Lin","raw_affiliation_strings":["Department of Mathematics, National Central University, Taoyuan City, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, National Central University, Taoyuan City, Taiwan","institution_ids":["https://openalex.org/I22265921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039241771","display_name":"Kuo-Shih Tseng","orcid":"https://orcid.org/0000-0002-7818-5821"},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Kuo-Shih Tseng","raw_affiliation_strings":["Department of Mathematics, National Central University, Taoyuan City, Taiwan"],"raw_orcid":"https://orcid.org/0000-0002-7818-5821","affiliations":[{"raw_affiliation_string":"Department of Mathematics, National Central University, Taoyuan City, Taiwan","institution_ids":["https://openalex.org/I22265921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039241771"],"corresponding_institution_ids":["https://openalex.org/I22265921"],"apc_list":{"value":3390,"currency":"USD","value_usd":3390},"apc_paid":null,"fwci":0.6436,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.62726094,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"48","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.996999979019165,"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/computer-science","display_name":"Computer science","score":0.8285833597183228},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.6409453749656677},{"id":"https://openalex.org/keywords/cross-entropy-method","display_name":"Cross-entropy method","score":0.6360222101211548},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.5454055666923523},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5176344513893127},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5163780450820923},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.45870694518089294},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.44324877858161926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4152897000312805},{"id":"https://openalex.org/keywords/cross-entropy","display_name":"Cross entropy","score":0.4134625792503357},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26627323031425476},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.232613205909729},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.20274072885513306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1408296525478363}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8285833597183228},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.6409453749656677},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.6360222101211548},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.5454055666923523},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5176344513893127},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5163780450820923},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.45870694518089294},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.44324877858161926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4152897000312805},{"id":"https://openalex.org/C167981619","wikidata":"https://www.wikidata.org/wiki/Q1685498","display_name":"Cross entropy","level":3,"score":0.4134625792503357},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26627323031425476},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.232613205909729},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.20274072885513306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1408296525478363},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10514-024-10156-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10514-024-10156-6","pdf_url":null,"source":{"id":"https://openalex.org/S144091109","display_name":"Autonomous Robots","issn_l":"0929-5593","issn":["0929-5593","1573-7527"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Robots","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2867172543","display_name":"Submodular Tree for Informative Path Planning","funder_award_id":"NSTC112-2221-E008-075","funder_id":"https://openalex.org/F2461203286","funder_display_name":"National Science and Technology Council"},{"id":"https://openalex.org/G3603821646","display_name":"Deep Inverse Reinforcement Learning for Informative Path Planning","funder_award_id":"MOST108-2221-E008-074-MY3","funder_id":"https://openalex.org/F4320322795","funder_display_name":"Ministry of Science and Technology, Taiwan"},{"id":"https://openalex.org/G7472062344","display_name":null,"funder_award_id":"111-2221-E-008-097","funder_id":"https://openalex.org/F2461203286","funder_display_name":"National Science and Technology Council"}],"funders":[{"id":"https://openalex.org/F2461203286","display_name":"National Science and Technology Council","ror":"https://ror.org/02kv4zf79"},{"id":"https://openalex.org/F4320322795","display_name":"Ministry of Science and Technology, Taiwan","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W14624541","https://openalex.org/W1517928915","https://openalex.org/W1535179827","https://openalex.org/W1555599194","https://openalex.org/W1566959760","https://openalex.org/W1577352482","https://openalex.org/W1625390266","https://openalex.org/W1680189815","https://openalex.org/W1714211023","https://openalex.org/W2011193572","https://openalex.org/W2019738489","https://openalex.org/W2031445638","https://openalex.org/W2033885045","https://openalex.org/W2040872506","https://openalex.org/W2042986967","https://openalex.org/W2062205231","https://openalex.org/W2064209160","https://openalex.org/W2080379754","https://openalex.org/W2089437550","https://openalex.org/W2107667896","https://openalex.org/W2110786553","https://openalex.org/W2128138357","https://openalex.org/W2132083787","https://openalex.org/W2133615895","https://openalex.org/W2136454334","https://openalex.org/W2156514784","https://openalex.org/W2168405694","https://openalex.org/W2215252637","https://openalex.org/W2257979135","https://openalex.org/W2396961959","https://openalex.org/W2409009991","https://openalex.org/W2525579820","https://openalex.org/W2531699011","https://openalex.org/W2552165419","https://openalex.org/W2552315440","https://openalex.org/W2586783934","https://openalex.org/W2757107770","https://openalex.org/W2769990600","https://openalex.org/W2771728020","https://openalex.org/W2883975974","https://openalex.org/W2962686327","https://openalex.org/W2996863123","https://openalex.org/W3047792530","https://openalex.org/W3081925040","https://openalex.org/W3092357259","https://openalex.org/W3125164440","https://openalex.org/W3146269391","https://openalex.org/W3167700388","https://openalex.org/W4212774754","https://openalex.org/W4223583037","https://openalex.org/W4256361765","https://openalex.org/W4376523934","https://openalex.org/W6674260428","https://openalex.org/W6687060249","https://openalex.org/W6736119040","https://openalex.org/W6742099052","https://openalex.org/W6767850189"],"related_works":["https://openalex.org/W2080931671","https://openalex.org/W1584645679","https://openalex.org/W2400292122","https://openalex.org/W2770616710","https://openalex.org/W2052147111","https://openalex.org/W1980187201","https://openalex.org/W286550118","https://openalex.org/W2088933359","https://openalex.org/W3122506910","https://openalex.org/W2132083787"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2}],"updated_date":"2026-08-08T07:41:36.138363","created_date":"2025-10-10T00:00:00"}