{"id":"https://openalex.org/W3199445231","doi":"https://doi.org/10.1109/cdc45484.2021.9683287","title":"Computing Complexity-aware Plans Using Kolmogorov Complexity","display_name":"Computing Complexity-aware Plans Using Kolmogorov Complexity","publication_year":2021,"publication_date":"2021-12-14","ids":{"openalex":"https://openalex.org/W3199445231","doi":"https://doi.org/10.1109/cdc45484.2021.9683287","mag":"3199445231"},"language":"en","primary_location":{"id":"doi:10.1109/cdc45484.2021.9683287","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc45484.2021.9683287","pdf_url":null,"source":{"id":"https://openalex.org/S4363607724","display_name":"2021 60th IEEE Conference on Decision and Control (CDC)","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":"2021 60th IEEE Conference on Decision and Control (CDC)","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/A5005403023","display_name":"Elis Stefansson","orcid":null},"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":true,"raw_author_name":"Elis Stefansson","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Sweden"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045975901","display_name":"Karl Henrik Johansson","orcid":"https://orcid.org/0000-0001-9940-5929"},"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":"Karl H. Johansson","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Sweden"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005403023"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":1.4118,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.801854,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"529","issue":null,"first_page":"3420","last_page":"3427"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9980000257492065,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.704213559627533},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.635514497756958},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4316607117652893},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4104590117931366},{"id":"https://openalex.org/keywords/complexity-management","display_name":"Complexity management","score":0.41026127338409424},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15145260095596313},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.062343209981918335}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.704213559627533},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.635514497756958},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4316607117652893},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4104590117931366},{"id":"https://openalex.org/C57936825","wikidata":"https://www.wikidata.org/wiki/Q1780925","display_name":"Complexity management","level":2,"score":0.41026127338409424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15145260095596313},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.062343209981918335},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc45484.2021.9683287","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc45484.2021.9683287","pdf_url":null,"source":{"id":"https://openalex.org/S4363607724","display_name":"2021 60th IEEE Conference on Decision and Control (CDC)","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":"2021 60th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W48257500","https://openalex.org/W81409850","https://openalex.org/W1536997931","https://openalex.org/W1638203394","https://openalex.org/W1997070622","https://openalex.org/W2003250112","https://openalex.org/W2013391942","https://openalex.org/W2050326303","https://openalex.org/W2069525910","https://openalex.org/W2075773711","https://openalex.org/W2077770566","https://openalex.org/W2122410182","https://openalex.org/W2122741244","https://openalex.org/W2128411788","https://openalex.org/W2138966161","https://openalex.org/W2145339207","https://openalex.org/W2154727088","https://openalex.org/W2161521419","https://openalex.org/W2239029832","https://openalex.org/W2257979135","https://openalex.org/W2341171179","https://openalex.org/W2498189457","https://openalex.org/W2564832474","https://openalex.org/W2575655030","https://openalex.org/W2617186574","https://openalex.org/W2623293810","https://openalex.org/W2782709542","https://openalex.org/W2800935510","https://openalex.org/W2810315705","https://openalex.org/W2822752092","https://openalex.org/W2904715276","https://openalex.org/W2962948942","https://openalex.org/W2963916141","https://openalex.org/W2964108562","https://openalex.org/W2964169085","https://openalex.org/W2966368748","https://openalex.org/W3009133380","https://openalex.org/W3026843238","https://openalex.org/W3036384875","https://openalex.org/W3116495571","https://openalex.org/W3174379051","https://openalex.org/W3186860181","https://openalex.org/W3199445231","https://openalex.org/W4297786979","https://openalex.org/W6636753242","https://openalex.org/W6682864419","https://openalex.org/W6683639705","https://openalex.org/W6732499416","https://openalex.org/W6732837357","https://openalex.org/W6752336532","https://openalex.org/W6752937632","https://openalex.org/W6774181345","https://openalex.org/W6778367973","https://openalex.org/W6779736323","https://openalex.org/W6781949637"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W3005820693","https://openalex.org/W226726922","https://openalex.org/W1484909457","https://openalex.org/W4246258635","https://openalex.org/W2571335838","https://openalex.org/W2099977515","https://openalex.org/W2068750653","https://openalex.org/W2461808546"],"abstract_inverted_index":{"In":[0],"this":[1,54],"paper,":[2],"we":[3],"introduce":[4],"complexity-aware":[5],"planning":[6,37],"for":[7,106],"finite-horizon":[8],"deterministic":[9,31],"finite":[10],"automata":[11],"with":[12,118],"rewards":[13],"as":[14],"outputs,":[15],"based":[16],"on":[17,101],"Kolmogorov":[18,20],"complexity.":[19,48],"complexity":[21,95],"is":[22,50,56,64],"considered":[23],"since":[24],"it":[25],"can":[26],"detect":[27],"computational":[28],"regularities":[29],"of":[30],"optimal":[32,80],"policies.":[33],"We":[34,66,97],"present":[35,67],"a":[36,44,78,87,102,107],"objective":[38,55],"yielding":[39],"an":[40],"explicit":[41],"trade-off":[42],"between":[43],"policy\u2019s":[45],"performance":[46,90],"and":[47,82],"It":[49],"proven":[51],"that":[52,61,116],"maximising":[53,89],"non-trivial":[57],"in":[58],"the":[59,74,83,99],"sense":[60],"dynamic":[62],"programming":[63],"infeasible.":[65],"two":[68],"algorithms":[69,100,112],"obtaining":[70],"low-complexity":[71,79,114],"policies,":[72],"where":[73,110],"first":[75],"algorithm":[76,85],"obtains":[77],"policy,":[81],"second":[84],"finds":[86],"policy":[88],"while":[91],"maintaining":[92],"local":[93],"(stage-wise)":[94],"constraints.":[96],"evaluate":[98],"simple":[103],"navigation":[104],"task":[105],"mobile":[108],"robot,":[109],"our":[111],"yield":[113],"policies":[115],"concur":[117],"intuition.":[119]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}