{"id":"https://openalex.org/W2737109631","doi":"https://doi.org/10.1109/icra.2017.7989094","title":"Multi-objective search for optimal multi-robot planning with finite LTL specifications and resource constraints","display_name":"Multi-objective search for optimal multi-robot planning with finite LTL specifications and resource constraints","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2737109631","doi":"https://doi.org/10.1109/icra.2017.7989094","mag":"2737109631"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2017.7989094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-204949","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004137684","display_name":"Philipp Schillinger","orcid":"https://orcid.org/0000-0002-9547-9784"},"institutions":[{"id":"https://openalex.org/I889804353","display_name":"Robert Bosch (Germany)","ror":"https://ror.org/01fe0jt45","country_code":"DE","type":"company","lineage":["https://openalex.org/I889804353"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["DE","SE"],"is_corresponding":true,"raw_author_name":"Philipp Schillinger","raw_affiliation_strings":["Bosch Center for Artificial Intelligence, Renningen, Germany","EES, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Bosch Center for Artificial Intelligence, Renningen, Germany","institution_ids":["https://openalex.org/I889804353"]},{"raw_affiliation_string":"EES, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113560639","display_name":"Mathias B\u00fcrger","orcid":null},"institutions":[{"id":"https://openalex.org/I889804353","display_name":"Robert Bosch (Germany)","ror":"https://ror.org/01fe0jt45","country_code":"DE","type":"company","lineage":["https://openalex.org/I889804353"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mathias Burger","raw_affiliation_strings":["Bosch Center for Artificial Intelligence, Renningen, Germany"],"affiliations":[{"raw_affiliation_string":"Bosch Center for Artificial Intelligence, Renningen, Germany","institution_ids":["https://openalex.org/I889804353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055348953","display_name":"Dimos V. Dimarogonas","orcid":"https://orcid.org/0000-0001-7309-8086"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Dimos V. Dimarogonas","raw_affiliation_strings":["EES, KTH Royal Institute of Technology, Stockholm, Sweden","Supported by the H2020 ERC Starting Grant BUCOPHSYS, Knut och Alice Wallenberg Foundation (KAW)"],"affiliations":[{"raw_affiliation_string":"EES, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Supported by the H2020 ERC Starting Grant BUCOPHSYS, Knut och Alice Wallenberg Foundation (KAW)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004137684"],"corresponding_institution_ids":["https://openalex.org/I86987016","https://openalex.org/I889804353"],"apc_list":null,"apc_paid":null,"fwci":0.739,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.80701587,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"768","last_page":"774"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9973999857902527,"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/T10142","display_name":"Formal Methods in Verification","score":0.9969000220298767,"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.6562259197235107},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6080211997032166},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.550547182559967},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5459643006324768},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.5418491959571838},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5355441570281982},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.4790179133415222},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4446497857570648},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3912235498428345},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3443259000778198},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24533000588417053},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24388769268989563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12178412079811096}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6562259197235107},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6080211997032166},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.550547182559967},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5459643006324768},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5418491959571838},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5355441570281982},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4790179133415222},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4446497857570648},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3912235498428345},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3443259000778198},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24533000588417053},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24388769268989563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12178412079811096},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2017.7989094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:DiVA.org:kth-204949","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-204949","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:kth-204949","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-204949","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7220330460","display_name":null,"funder_award_id":"731869","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W145270132","https://openalex.org/W311217234","https://openalex.org/W790410956","https://openalex.org/W1498432697","https://openalex.org/W1540883472","https://openalex.org/W1592570595","https://openalex.org/W1650438417","https://openalex.org/W1964007137","https://openalex.org/W1980088782","https://openalex.org/W1989179252","https://openalex.org/W1998259641","https://openalex.org/W2004620590","https://openalex.org/W2051956023","https://openalex.org/W2054151210","https://openalex.org/W2084485573","https://openalex.org/W2089853005","https://openalex.org/W2151958719","https://openalex.org/W2291453770","https://openalex.org/W2410933284","https://openalex.org/W2789239344","https://openalex.org/W4302557773","https://openalex.org/W6748721847"],"related_works":["https://openalex.org/W2072180474","https://openalex.org/W1960052459","https://openalex.org/W3049557657","https://openalex.org/W3150915502","https://openalex.org/W2380059383","https://openalex.org/W4224278052","https://openalex.org/W2063679720","https://openalex.org/W2375707231","https://openalex.org/W2111158727","https://openalex.org/W1809059965"],"abstract_inverted_index":{"We":[0,66],"present":[1],"an":[2,43],"efficient":[3],"approach":[4,96],"to":[5,27,57,62],"plan":[6],"action":[7],"sequences":[8],"for":[9,72],"a":[10,15],"team":[11,34],"of":[12,76,90,94],"robots":[13],"from":[14],"single":[16],"finite":[17],"LTL":[18,84],"mission":[19,31],"specification.":[20],"The":[21,86],"resulting":[22],"execution":[23,39],"strategy":[24],"is":[25,55,97],"proven":[26],"solve":[28],"the":[29,50,91],"given":[30],"with":[32,37],"minimal":[33],"costs,":[35],"e.g.,":[36],"shortest":[38,52],"time.":[40],"For":[41],"planning,":[42],"established":[44],"graph-based":[45],"search":[46],"method":[47],"based":[48],"on":[49],"multi-objective":[51],"path":[53],"problem":[54],"adapted":[56],"multi-robot":[58],"planning":[59,69],"and":[60,88],"extended":[61],"support":[63],"resource":[64],"constraints.":[65],"further":[67],"improve":[68],"efficiency":[70,87],"significantly":[71],"missions":[73],"which":[74],"consist":[75],"independent":[77],"parts":[78],"by":[79],"using":[80],"previous":[81],"results":[82],"regarding":[83],"decomposition.":[85],"practicality":[89],"ROS":[92],"implementation":[93],"our":[95],"demonstrated":[98],"in":[99],"example":[100],"scenarios.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}