{"id":"https://openalex.org/W2999103220","doi":"https://doi.org/10.1109/ro-man46459.2019.8956393","title":"Deep-Pack: A Vision-Based 2D Online Bin Packing Algorithm with Deep Reinforcement Learning","display_name":"Deep-Pack: A Vision-Based 2D Online Bin Packing Algorithm with Deep Reinforcement Learning","publication_year":2019,"publication_date":"2019-10-01","ids":{"openalex":"https://openalex.org/W2999103220","doi":"https://doi.org/10.1109/ro-man46459.2019.8956393","mag":"2999103220"},"language":"en","primary_location":{"id":"doi:10.1109/ro-man46459.2019.8956393","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ro-man46459.2019.8956393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 28th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5049058603","display_name":"Olyvia Kundu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Olyvia Kundu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001713925","display_name":"Samrat Dutta","orcid":"https://orcid.org/0000-0002-0825-8589"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samrat Dutta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053838336","display_name":"Swagat Kumar","orcid":"https://orcid.org/0000-0001-7405-3445"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Swagat Kumar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9986000061035156,"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.9986000061035156,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9970999956130981,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.9545352458953857},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.813784122467041},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7753832936286926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.724034309387207},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.6439043879508972},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5681614875793457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5580915808677673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5526694059371948},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5247271656990051},{"id":"https://openalex.org/keywords/pixel","display_name":"Pixel","score":0.5137604475021362},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.501457691192627},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.47658678889274597},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.44443079829216003},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42438775300979614},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.39025455713272095},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.11983364820480347}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9545352458953857},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.813784122467041},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7753832936286926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.724034309387207},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.6439043879508972},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5681614875793457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5580915808677673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5526694059371948},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5247271656990051},{"id":"https://openalex.org/C160633673","wikidata":"https://www.wikidata.org/wiki/Q355198","display_name":"Pixel","level":2,"score":0.5137604475021362},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.501457691192627},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.47658678889274597},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.44443079829216003},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42438775300979614},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.39025455713272095},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.11983364820480347},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ro-man46459.2019.8956393","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ro-man46459.2019.8956393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 28th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/c45106be-3ab7-4b86-b07f-49efa92df914","is_oa":false,"landing_page_url":"https://research.edgehill.ac.uk/en/publications/c45106be-3ab7-4b86-b07f-49efa92df914","pdf_url":null,"source":{"id":"https://openalex.org/S4306402462","display_name":"Edge Hill University Research Information Repository (Edge Hill University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165525304","host_organization_name":"Edge Hill University","host_organization_lineage":["https://openalex.org/I165525304"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kundu, O, Dutta, S & Kumar, S 2020, Deep-Pack : A Vision-Based 2D Online Bin Packing Algorithm with Deep Reinforcement Learning. in 2019 28th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN). IEEE International Workshop on Robot and Human Communication (ROMAN), IEEE, pp. 1-7, 28th IEEE International Conference on Robot and Human Interactive Communication, RO-MAN 2019, New Delhi, India, 14/10/19. https://doi.org/10.1109/RO-MAN46459.2019.8956393","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W14327270","https://openalex.org/W1522301498","https://openalex.org/W1543921836","https://openalex.org/W1548063969","https://openalex.org/W1570896421","https://openalex.org/W1757796397","https://openalex.org/W1966419424","https://openalex.org/W1976093834","https://openalex.org/W1976704149","https://openalex.org/W1984448842","https://openalex.org/W2026209456","https://openalex.org/W2029125735","https://openalex.org/W2044180942","https://openalex.org/W2053822166","https://openalex.org/W2055717964","https://openalex.org/W2078659331","https://openalex.org/W2086102640","https://openalex.org/W2109469182","https://openalex.org/W2115211925","https://openalex.org/W2121002339","https://openalex.org/W2130942839","https://openalex.org/W2145339207","https://openalex.org/W2257979135","https://openalex.org/W2403006405","https://openalex.org/W2418108244","https://openalex.org/W2507756961","https://openalex.org/W2560592986","https://openalex.org/W2577702044","https://openalex.org/W2603098331","https://openalex.org/W2741094041","https://openalex.org/W2748734647","https://openalex.org/W2797538013","https://openalex.org/W2952332632","https://openalex.org/W2964121744","https://openalex.org/W4298857966","https://openalex.org/W6631190155","https://openalex.org/W6637967152","https://openalex.org/W6646191937","https://openalex.org/W6677067356","https://openalex.org/W6679436768","https://openalex.org/W6713189077","https://openalex.org/W6725207838","https://openalex.org/W6730742100","https://openalex.org/W6743228126","https://openalex.org/W6750550842"],"related_works":["https://openalex.org/W76601469","https://openalex.org/W4235035380","https://openalex.org/W2971368033","https://openalex.org/W1590563747","https://openalex.org/W2026961896","https://openalex.org/W2056716554","https://openalex.org/W4255148175","https://openalex.org/W3167861864","https://openalex.org/W2963371694","https://openalex.org/W4288260564"],"abstract_inverted_index":{"This":[0],"paper":[1],"looks":[2],"into":[3],"the":[4,12,27,32,37,47,84,88,95,99,107,120,130,136],"problem":[5,78],"of":[6,44,49,87],"online":[7,38,157,166],"2D":[8,156],"bin":[9,89,167],"packing":[10,29,158,168],"where":[11,98],"objective":[13],"is":[14,73,112,141,149],"to":[15,25,55,62,75,103,123,129,151,164],"place":[16,124],"an":[17,81,125],"incoming":[18,100,126],"object":[19,101,127],"in":[20,114],"a":[21,116],"way":[22,117],"so":[23,118,134],"as":[24,90,106],"maximize":[26],"overall":[28],"density":[30],"inside":[31],"bin.":[33],"Unlike":[34],"off-line":[35],"methods,":[36],"methods":[39],"do":[40],"not":[41],"make":[42],"use":[43],"information":[45],"about":[46],"sequence":[48],"future":[50,144],"objects":[51],"that":[52,79,119,135],"are":[53,59],"going":[54],"arrive":[56],"and":[57,92,159],"hence,":[58],"comparatively":[60],"difficult":[61],"solve.":[63],"A":[64],"deep":[65],"reinforcement":[66],"learning":[67],"framework":[68],"based":[69],"on":[70],"Double":[71],"DQN":[72],"proposed":[74],"solve":[76],"this":[77],"takes":[80],"image":[82],"showing":[83],"current":[85],"state":[86],"input":[91],"gives":[93],"out":[94],"pixel":[96],"location":[97],"needs":[102],"be":[104,162],"placed":[105,132],"output.":[108],"The":[109,146],"reward":[110],"function":[111],"defined":[113],"such":[115],"system":[121],"learns":[122],"adjacent":[128],"already":[131],"items":[133],"maximum":[137],"grouped":[138],"empty":[139],"area":[140],"retained":[142],"for":[143,155],"placement.":[145],"resulting":[147],"approach":[148],"shown":[150],"outperform":[152],"existing":[153],"state-of-the-art-method":[154],"can":[160],"easily":[161],"extended":[163],"3D":[165],"problems.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}