{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T03:15:39Z","timestamp":1758078939105,"version":"3.44.0"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643686196","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,16]]},"abstract":"<jats:p>The sparsest packing problem emerges in manufacturing multi-hole extrusion dies to obtain small and precise products in the automotive, aviation, food, and medical industries. The goal is to maximize the minimum Euclidean distance between the objects and between the objects to the boundaries of the container. Additionally, this task might be subject to balancing constraints that determine that the deviation of gravity center of the system should stay within a threshold. We present a novel custom environment that encompasses the constraints present in this task. We experiment with the proposed environment using Proximal Policy Optimization to assess the applicability of reinforcement learning for the sparsest packing problem with circular objects in a circular container. Our results indicate that the proposed agent learns efficiently, demonstrating promising results in both finding feasible solutions and optimizing the placement of objects. Our approach not only shows the potential of reinforcement learning for solving the sparsest packing problem but also provides insights into its effectiveness in environments with complex spatial and balancing constraints.<\/jats:p>","DOI":"10.3233\/faia250517","type":"book-chapter","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T13:19:16Z","timestamp":1758028756000},"source":"Crossref","is-referenced-by-count":0,"title":["Reinforcement Learning for Circular Sparsest Packing Problems"],"prefix":"10.3233","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7235-1529","authenticated-orcid":false,"given":"Fernanda Miyuki","family":"Yamada","sequence":"first","affiliation":[{"name":"The University of Electro-Communications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9437-6943","authenticated-orcid":false,"given":"Jo\u00e3o Paulo","family":"Gois","sequence":"additional","affiliation":[{"name":"Federal University of ABC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2325-2070","authenticated-orcid":false,"given":"Harlen Costa","family":"Batagelo","sequence":"additional","affiliation":[{"name":"Federal University of ABC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5814-1426","authenticated-orcid":false,"given":"Hiroki","family":"Takahashi","sequence":"additional","affiliation":[{"name":"The University of Electro-Communications"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","New Trends in Intelligent Software Methodologies, Tools and Techniques"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA250517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T13:19:16Z","timestamp":1758028756000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA250517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"ISBN":["9781643686196"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia250517","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,16]]}}}