AMAnna Mannucci

Anna Mannucci

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Anna Mannucci has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • The ILIAD Safety Stack: Human-Aware Infrastructure-Free Navigation of Industrial Mobile Robots

    by Sergi Molina, Anna Mannucci, Martin Magnusson, Daniel Adolfsson, Henrik Andreasson, Mazin Hamad, Saeed Abdolshah, Ravi Teja Chadalavada, Luigi Palmieri, Timm Linder, et al.

    Current intralogistics services require keeping up with e-commerce demands, reducing delivery times and waste, and increasing overall flexibility. As a consequence, the use of automated guided vehicles (AGVs) and, more recently, autonomous mobile robots (AMRs) for logistics operations is steadily increasing.


  • Open Access

    Priority-Based Distributed Coordination for Heterogeneous Multi-Robot Systems With Realistic Assumptions

    by Michele Cecchi, Matteo Paiano, Anna Mannucci, Alessandro Palleschi, Federico Pecora, Lucia Pallottino

    A standing challenge in current intralogistics is to reliably, effectively, yet safely coordinate large-scale, heterogeneous multi-robot fleets without posing constraints on the infrastructure or unrealistic assumptions on robots. A centralized approach, proposed by some of the authors in prior work, allows to overcome these limitations with medium-scale fleets (i.e., tens of robots). With the aim of scaling to hundreds of robots, in this article we explore a decentralized variant of the same approach. The proposed framework maintains the key features of the original approach, namely, ensuring safety despite uncertainties on robot motions, and generality with respect to robot platforms, motion planners and controllers. We include considerations on liveness and report solutions to prevent or recover from deadlocks in specific situations. We validate the approach empirically in simulation with large, heterogeneous multi-robot fleets (with up to 100 robots) operating in both benchmark and realistic environments.


  • Open Access

    On Provably Safe and Live Multirobot Coordination With Online Goal Posting

    by Anna Mannucci, Lucia Pallottino, Federico Pecora

    A standing challenge in multirobot systems is to realize safe and efficient motion planning and coordination methods that are capable of accounting for uncertainties and contingencies. The challenge is rendered harder by the fact that robots may be heterogeneous and that their plans may be posted asynchronously. Most existing approaches require constraints on the infrastructure or unrealistic assumptions on robot models. In this article, we propose a centralized, loosely-coupled supervisory controller that overcomes these limitations. The approach responds to newly posed constraints and uncertainties during trajectory execution, ensuring at all times that planned robot trajectories remain kinodynamically feasible, that the fleet is in a safe state, and that there are no deadlocks or livelocks. This is achieved without the need for hand-coded rules, fixed robot priorities, or environment modification. We formally state all relevant properties of robot behavior in the most general terms possible, without assuming particular robot models or environments, and provide both formal and empirical proof that the proposed fleet control algorithms guarantee safety and liveness.


  • Open Access

    Online Task Assignment and Coordination in Multi-Robot Fleets

    by Paolo Forte, Anna Mannucci, Henrik Andreasson, Federico Pecora

    We propose a loosely-coupled framework for integrated task assignment, motion planning, coordination and control of heterogeneous fleets of robots subject to non-cooperative tasks. The approach accounts for the important real-world requirement that tasks can be posted asynchronously. We exploit systematic search for optimal task assignment, where interference is considered as a cost and estimated with knowledge of the kinodynamic models and current state of the robots. Safety is guaranteed by an online coordination algorithm, where the absence of collisions is treated as a hard constraint. The relation between the weight of interference cost in task assignment and computational overhead is analyzed empirically, and the approach is compared against alternative realizations using local search algorithms for task assignment.


  • On Null Space-Based Inverse Kinematics Techniques for Fleet Management: Toward Time-Varying Task Activation

    by Anna Mannucci, Danilo Caporale, Lucia Pallottino

    Multirobot fleets play an important role in industrial logistics, surveillance, and exploration applications. A wide literature exists on the topic, both resorting to reactive (i.e. collision avoidance) and to deliberative (i.e. motion planning) techniques. In this work, null space-based inverse kinematics (NSB-IK) methods are applied to the problem of fleet management. Several NSB-IK approaches existing in the literature are reviewed, and compared with a reverse priority approach, which originated in manipulator control, and is here applied for the first time to the considered problem. All NSB-IK approaches are here described in a unified formalism, which allows (i) to encode the property of each controller into a set of seven main key features, (ii) to study possible new control laws with an opportune choice of these parameters. Furthermore, motivated by the envisioned application scenario, we tackle the problem of task-switching activation. Leveraging on the iCAT TPC technique Simetti and Casalino, 2016, in this article, we propose a method to obtain continuity in the control in face of activation or deactivation of tasks, and subtasks by defining suitable damped projection operators. The proposed approaches are evaluated formally, and via simulations. Performances with respect to standard methods are compared considering a specific case study for multivehicles management.


  • Open Access

    Towards an Autonomous Unwrapping System for Intralogistics

    by Chiara Gabellieri, Martin Magnusson, Manolo Garabini, Lucia Pallottino, Alessandro Palleschi, Anna Mannucci, Michele Pierallini, Elisa Stefanini, Manuel Giuseppe Catalano, Danilo Caporale, et al.

    Warehouse logistics is a rapidly growing market for robots. However, one key procedure that has not received much attention is the unwrapping of pallets to prepare them for objects picking. In fact, to prevent the goods from falling and to protect them, pallets are normally wrapped in plastic when they enter the warehouse. Currently, unwrapping is mainly performed by human operators, due to the complexity of its planning and control phases. Autonomous solutions exist, but usually they are designed for specific situations, require a large footprint and are characterized by low flexibility. In this work, we propose a novel integrated robotic solution for autonomous plastic film removal relying on an impedance-controlled robot. The main contribution is twofold: on one side, a strategy to plan Cartesian impedance and trajectory to execute the cut without damaging the goods is discussed; on the other side, we present a cutting device that we designed for this purpose. The proposed solution presents the characteristics of high versatility and the need for a reduced footprint, due to the adopted technologies and the integration with a mobile base. Experimental results are shown to validate the proposed approach.


  • Provably Safe Multi-Robot Coordination With Unreliable Communication

    by Anna Mannucci, Lucia Pallottino, Federico Pecora

    Coordination is a core problem in multi-robot systems, since it is key to ensuring safety and efficiency. Both centralized and decentralized solutions have been proposed, however, most assume perfect communication. This article proposes a centralized method which removes this assumption, and is suitable for fleets of robots driven by generic second order dynamics. We formally prove that (i) safety is guaranteed if communication errors are limited to delays, and (ii) the probability of unsafety is bounded by a function of the channel model in networks with packet loss. The approach exploits knowledge of the network's non-idealities to ensure the best possible performance of the fleet. The method is validated via several experiments with simulated robots.