We study the problem of generating arbitrarily large environments to improve the throughput of multi-robot systems. Prior work proposes Quality Diversity (QD) algorithms as an effective method for optimizing the environments of automated warehouses. However, these approaches optimize only relatively small environments, falling short when it comes to replicating real-world warehouse sizes. The challenge arises from the exponential increase in the search space as the environment size increases.

When you purchase through links in our articles, we may earn a small commission. This machine exceeds expectations -- as long as you don't expect much AI. HP's ZBook 8 G1i is a capable professional workstation with fast performance, good thermals, and an unusually long warranty. The HP ZBook 8 G1i is a high-end workstation laptop designed for professional workloads: CAD, 3D modeling, and video editing . It's priced to match, too.

The rapid growth of e-commerce in recent years has significantly transformed people's shopping habits [1]. Consumers increasingly favor online shopping over in-person purchases, leading to a substantial impact on product logistics, which plays a crucial role in customer satisfaction. In addition to product quality and other factors, the timely delivery of orders has become a key determinant of customer satisfaction. Picking and replenishment tasks are responsible for 65% of operating costs [2]. In a conventional manual order picking system, often referred to as a picker-to-parts system, pickers dedicate 70% of their working time to searching for items and traveling within the facility [3, 4].

We study the problem of generating arbitrarily large environments to improve the throughput of multi-robot systems. Prior work proposes Quality Diversity (QD) algorithms as an effective method for optimizing the environments of automated warehouses. However, these approaches optimize only relatively small environments, falling short when it comes to replicating real-world warehouse sizes. The challenge arises from the exponential increase in the search space as the environment size increases.

We study optimizing a destination-to-chutes task mapping to improve throughput in Robotic Sorting Systems (RSS), where a team of robots sort packages on a sortation floor by transporting them from induct workstations to eject chutes based on their shipping destinations (e.g. Los Angeles or Pittsburgh). The destination-to-chutes task mapping is used to determine which chutes a robot can drop its package. Finding a high-quality task mapping is challenging because of the complexity of a real-world RSS. First, optimizing task mapping is interdependent with robot target assignment and path planning. Second, chutes will be CLOSED for a period of time once they receive sufficient packages to allow for downstream processing. Third, task mapping quality directly impacts the downstream processing, as scattered chutes for the same destination increase package handling time. In this paper, we first formally define task mappings and the problem of Task Mapping Optimization (TMO). We then present a simulator of RSS to evaluate task mappings. We then present a simple TMO method based on the Evolutionary Algorithm and Mixed Integer Linear Programming, demonstrating the advantage of our optimized task mappings over the greedily generated ones in various RSS setups with different map sizes, numbers of chutes, and destinations. Finally, we use Quality Diversity algorithms to analyze the throughput of a diverse set of task mappings. Our code is available online at https://github.com/lunjohnzhang/tmo_public.

RoboCup is an international scientific initiative with the goal of advancing the state of the art of intelligent robots, AI and automation. The annual RoboCup event, where teams gather from across the globe to take part in competitions across a number of leagues, this year took place in Salvador, Brazil from 15-21 July. In a series of interviews, we've been meeting some of the RoboCup trustees, committee members, and participants, to find out more about their respective leagues. Christoph Steup is an Executive Committee member and oversees the @Work League. Ahead of the event in Brazil, we spoke to Christoph to find out more about the @Work League, the tasks that teams need to complete, and future plans for the League.

Personal use of this material is permitted. Abstract --Efficient planning of activities is essential for modern industrial assembly lines to uphold manufacturing standards, prevent project constraint violations, and achieve cost-effective operations. While exact solutions to such challenges can be obtained through Integer Programming (IP), the dependence of the search space on input parameters often makes IP computationally infeasible for large-scale scenarios. Heuristic methods, such as Genetic Algorithms, can also be applied, but they frequently produce suboptimal solutions in extensive cases. This paper introduces a novel mathematical model of a generic industrial assembly line formulated as a Markov Decision Process (MDP), without imposing assumptions on the type of assembly line a notable distinction from most existing models. The proposed model is employed to create a virtual environment for training Deep Reinforcement Learning (DRL) agents to optimize task and resource scheduling. T o enhance the efficiency of agent training, the paper proposes two innovative tools. The first is an action-masking technique, which ensures the agent selects only feasible actions, thereby reducing training time. The second is a multi-agent approach, where each workstation is managed by an individual agent, as a result, the state and action spaces were reduced. A centralized training framework with decentralized execution is adopted, offering a scalable learning architecture for optimizing industrial assembly lines. This framework allows the agents to learn offline and subsequently provide real-time solutions during operations by leveraging a neural network that maps the current factory state to the optimal action. The effectiveness of the proposed scheme is validated through numerical simulations, demonstrating significantly faster convergence to the optimal solution compared to a comparable model-based approach.

Should Microsoft and the PC industry have paid more attention to the GPU during the development of AI and Copilot PCs? After a year's time waiting for Copilot PCs (and their newfangled "Neural Processing Units" to take off, I can't help but wonder. Microsoft launched the Copilot PC initiative on May 20, 2024, and began shipping them on June 18. Since then, Microsoft has supported Copilot PCs with a handful of features, rolling them out first for PCs with the Qualcomm Snapdragon chips inside and then later for PCs powered by Intel Core Ultra Series 2 chips and the AMD Ryzen AI 300 processor. Qualcomm is essentially blameless, delivering a potent PC processor with most AI capabilities and long battery life.

At HP Amplify 2025, the company's big annual conference for showcasing its latest products and services, HP unveiled nearly the entire set of its new PCs for the year. I lost count at some point, but HP claims over 60 new models of laptops and PCs. While technically true, it's a bit fudged--the company counts some variants of the same computer as separate. For example, if the same laptop comes in Intel, AMD, and Snapdragon options, then each one is a distinct "model" even if everything else is the same. That also goes for screen sizes, 2-in-1 variants, and so on.

Multi-agent systems often rely on specialized agents with distinct roles rather than general-purpose agents that perform the entire task independently. However, the conditions that govern the optimal degree of specialization remain poorly understood. In this work, we propose that specialist teams outperform generalist ones when environmental constraints limit task parallelizability -- the potential to execute task components concurrently. Drawing inspiration from distributed systems, we introduce a heuristic to predict the relative efficiency of generalist versus specialist teams by estimating the speed-up achieved when two agents perform a task in parallel rather than focus on complementary subtasks. We validate this heuristic through three multi-agent reinforcement learning (MARL) experiments in Overcooked-AI, demonstrating that key factors limiting task parallelizability influence specialization. We also observe that as the state space expands, agents tend to converge on specialist strategies, even when generalist ones are theoretically more efficient, highlighting potential biases in MARL training algorithms. Our findings provide a principled framework for interpreting specialization given the task and environment, and introduce a novel benchmark for evaluating whether MARL finds optimal strategies.