{"id":"https://openalex.org/W4413209197","doi":"https://doi.org/10.1145/3712255.3726766","title":"Improving Continuous Coverage Path Planning through Subpath Selection and Multi-Objective Bilevel Optimization","display_name":"Improving Continuous Coverage Path Planning through Subpath Selection and Multi-Objective Bilevel Optimization","publication_year":2025,"publication_date":"2025-07-14","ids":{"openalex":"https://openalex.org/W4413209197","doi":"https://doi.org/10.1145/3712255.3726766"},"language":"en","primary_location":{"id":"doi:10.1145/3712255.3726766","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3712255.3726766","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-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/A5036803873","display_name":"Lukas Bostelmann-Arp","orcid":"https://orcid.org/0000-0003-2951-5051"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke University Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Lukas Bostelmann-Arp","raw_affiliation_strings":["Otto-von-Guericke University, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Otto-von-Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007360440","display_name":"Christoph Steup","orcid":"https://orcid.org/0000-0001-6936-9760"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke University Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Steup","raw_affiliation_strings":["Otto-von-Guericke University, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Otto-von-Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064569017","display_name":"Sanaz Mostaghim","orcid":"https://orcid.org/0000-0002-9917-5227"},"institutions":[{"id":"https://openalex.org/I4210111151","display_name":"Fraunhofer Institute for Transportation and Infrastructure Systems","ror":"https://ror.org/01nqmht92","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210111151","https://openalex.org/I4923324"]},{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke University Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sanaz Mostaghim","raw_affiliation_strings":["Fraunhofer Institute for Transportation and Infrastructure Systems IVI, Magdeburg, Germany","Otto-von-Guericke University, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Fraunhofer Institute for Transportation and Infrastructure Systems IVI, Magdeburg, Germany","institution_ids":["https://openalex.org/I4210111151"]},{"raw_affiliation_string":"Otto-von-Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036803873"],"corresponding_institution_ids":["https://openalex.org/I95793202"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38188494,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"783","last_page":"786"},"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/T12546","display_name":"Smart Parking Systems Research","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9912999868392944,"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/bilevel-optimization","display_name":"Bilevel optimization","score":0.7847033739089966},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6442283391952515},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5890103578567505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.585578203201294},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5243930220603943},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4333621859550476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2553737759590149},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2535872757434845},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20598196983337402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20497679710388184},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1018470823764801}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.7847033739089966},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6442283391952515},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5890103578567505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.585578203201294},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5243930220603943},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4333621859550476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2553737759590149},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2535872757434845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20598196983337402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20497679710388184},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1018470823764801},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3712255.3726766","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3712255.3726766","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},{"id":"pmh:oai:publica.fraunhofer.de:publica/500066","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/500066","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2000152514","https://openalex.org/W2126105956","https://openalex.org/W2902841061","https://openalex.org/W3021613070","https://openalex.org/W4386520503","https://openalex.org/W4387839955","https://openalex.org/W4408058432"],"related_works":["https://openalex.org/W4318070895","https://openalex.org/W3157915181","https://openalex.org/W4401134013","https://openalex.org/W2896140431","https://openalex.org/W1536852012","https://openalex.org/W3015956618","https://openalex.org/W1994436307","https://openalex.org/W2920493340","https://openalex.org/W2071082401","https://openalex.org/W1989923016"],"abstract_inverted_index":{"Coverage":[0],"Path":[1],"Planning":[2],"(CPP)":[3],"is":[4],"a":[5,36,73],"fundamental":[6],"problem":[7,24],"in":[8],"robotics":[9],"with":[10],"diverse":[11],"applications,":[12],"including":[13],"area":[14],"surveillance":[15],"or":[16],"search":[17],"and":[18,41,58,113],"rescue.":[19],"The":[20],"weighted":[21],"continuous":[22,40,86],"CPP":[23,28,87],"extends":[25],"the":[26,33,50,59,80,85,90,97,104],"classical":[27],"by":[29],"focusing":[30],"on":[31],"maximizing":[32],"coverage":[34],"of":[35,61,96],"value":[37],"function":[38],"using":[39],"free-form":[42],"paths.":[43,65],"This":[44],"extension":[45],"introduces":[46],"unique":[47],"challenges,":[48,69],"particularly":[49],"computational":[51,111],"effort":[52],"required":[53],"for":[54],"equidistant":[55],"path":[56],"evaluation":[57],"difficulty":[60],"achieving":[62],"locally":[63],"optimal":[64],"To":[66],"address":[67],"these":[68],"this":[70,78,101],"work":[71],"proposes":[72],"bilevel":[74],"optimization":[75],"approach.":[76],"In":[77],"framework,":[79],"upper-level":[81],"decision-maker":[82],"(DM)":[83],"solves":[84],"problem,":[88],"while":[89],"lower-level":[91],"DM":[92],"periodically":[93],"optimizes":[94],"sub-elements":[95],"solutions.":[98],"By":[99],"leveraging":[100],"hierarchical":[102],"structure,":[103],"proposed":[105],"approach":[106],"aims":[107],"to":[108,116],"achieve":[109],"improved":[110],"efficiency":[112],"enhanced":[114],"adaptation":[115],"local":[117],"scenario":[118],"variations.":[119]},"counts_by_year":[],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}