{"id":"https://openalex.org/W4416750015","doi":"https://doi.org/10.1109/iros60139.2025.11247042","title":"Object Packing and Scheduling for Sequential 3D Printing: a Linear Arithmetic Model and a CEGAR-inspired Optimal Solver","display_name":"Object Packing and Scheduling for Sequential 3D Printing: a Linear Arithmetic Model and a CEGAR-inspired Optimal Solver","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W4416750015","doi":"https://doi.org/10.1109/iros60139.2025.11247042"},"language":null,"primary_location":{"id":"doi:10.1109/iros60139.2025.11247042","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11247042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5031732925","display_name":"Pavel Surynek","orcid":"https://orcid.org/0000-0001-7200-0542"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Surynek","raw_affiliation_strings":["Czech Technical University in Prague,Faculty of Information Technology,Praha 6,Czechia,160 00"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague,Faculty of Information Technology,Praha 6,Czechia,160 00","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119019905","display_name":"Vojt\u011bch Bubn\u00edk","orcid":null},"institutions":[{"id":"https://openalex.org/I2801617088","display_name":"Holloman Air Force Base","ror":"https://ror.org/030bv9h77","country_code":"US","type":"government","lineage":["https://openalex.org/I1330347796","https://openalex.org/I2801617088","https://openalex.org/I4210089612","https://openalex.org/I4210102105"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vojt\u011bch Bubn\u00edk","raw_affiliation_strings":["Prusa Research,Holešovice,Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Prusa Research,Holešovice,Czechia","institution_ids":["https://openalex.org/I2801617088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119019906","display_name":"Luk\u00e1\u0161 Mat\u011bna","orcid":null},"institutions":[{"id":"https://openalex.org/I2801617088","display_name":"Holloman Air Force Base","ror":"https://ror.org/030bv9h77","country_code":"US","type":"government","lineage":["https://openalex.org/I1330347796","https://openalex.org/I2801617088","https://openalex.org/I4210089612","https://openalex.org/I4210102105"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Luk\u00e1\u0161 Mat\u011bna","raw_affiliation_strings":["Prusa Research,Holešovice,Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Prusa Research,Holešovice,Czechia","institution_ids":["https://openalex.org/I2801617088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5119019907","display_name":"Petr Kubi\u0161","orcid":null},"institutions":[{"id":"https://openalex.org/I2801617088","display_name":"Holloman Air Force Base","ror":"https://ror.org/030bv9h77","country_code":"US","type":"government","lineage":["https://openalex.org/I1330347796","https://openalex.org/I2801617088","https://openalex.org/I4210089612","https://openalex.org/I4210102105"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Petr Kubi\u0161","raw_affiliation_strings":["Prusa Research,Holešovice,Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Prusa Research,Holešovice,Czechia","institution_ids":["https://openalex.org/I2801617088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43880884,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5679","last_page":"5686"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8956000208854675,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8956000208854675,"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/T10783","display_name":"Additive Manufacturing and 3D Printing Technologies","score":0.02019999921321869,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T11159","display_name":"Manufacturing Process and Optimization","score":0.01119999960064888,"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/counterexample","display_name":"Counterexample","score":0.6784999966621399},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6560999751091003},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.623199999332428},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5716999769210815},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4747999906539917},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.46709999442100525},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4228000044822693},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.4004000127315521}],"concepts":[{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6784999966621399},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6560999751091003},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.623199999332428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5936999917030334},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5716999769210815},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4747999906539917},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.46709999442100525},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4228000044822693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41200000047683716},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.4004000127315521},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3723999857902527},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36320000886917114},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3156999945640564},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3098999857902527},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.29809999465942383},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27810001373291016},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros60139.2025.11247042","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11247042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1481397690","https://openalex.org/W1559424388","https://openalex.org/W2022846948","https://openalex.org/W2077575565","https://openalex.org/W2080574972","https://openalex.org/W2086037850","https://openalex.org/W2127574686","https://openalex.org/W2158395308","https://openalex.org/W2254077872","https://openalex.org/W2398886006","https://openalex.org/W4205985266","https://openalex.org/W4206807714","https://openalex.org/W4389667770"],"related_works":[],"abstract_inverted_index":{"We":[0,61,74],"address":[1],"the":[2,14,39,48,52,64,69,78,102,105],"problem":[3,67,79,106],"of":[4,51,71,107],"object":[5,108],"arrangement":[6,109],"and":[7,110],"scheduling":[8,111],"for":[9,92],"sequential":[10,29,40,65],"3D":[11,16,30],"printing.":[12],"Unlike":[13],"standard":[15],"printing,":[17,31],"where":[18],"all":[19],"objects":[20,32],"are":[21,33],"printed":[22,59],"slice":[23,25],"by":[24,120],"at":[26,63],"once,":[27],"in":[28],"completed":[34],"one":[35],"after":[36],"other.":[37],"In":[38],"case,":[41],"it":[42],"is":[43,86],"necessary":[44],"to":[45,76,129,134],"ensure":[46],"that":[47],"moving":[49],"parts":[50],"printer":[53],"do":[54,99],"not":[55,100],"collide":[56],"with":[57],"previously":[58],"objects.":[60],"look":[62],"printing":[66],"from":[68],"perspective":[70],"combinatorial":[72],"optimization.":[73],"propose":[75],"express":[77],"as":[80],"a":[81,90,117,131],"linear":[82],"arithmetic":[83],"formula,":[84],"which":[85,126],"then":[87],"solved":[88],"using":[89],"solver":[91],"satisfiability":[93],"modulo":[94],"theories":[95],"(SMT).":[96],"However,":[97],"we":[98,114],"solve":[101],"formula":[103],"expressing":[104],"directly,":[112],"but":[113],"have":[115],"proposed":[116],"technique":[118],"inspired":[119],"counterexample":[121],"guided":[122],"abstraction":[123],"refinement":[124],"(CEGAR),":[125],"turned":[127],"out":[128],"be":[130],"key":[132],"innovation":[133],"efficiency.":[135]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-28T00:00:00"}