Abstract
Autonomous Mobile Robots (AMRs) and Automated Guided Vehicles (AGVs) have emerged as key innovations in the industry world, with AMRs offering flexibility a nd adaptability for dynamic environments, while AGVs provide high accuracy for repetitive tasks; thus, this research proposes a study of fleets of both AGVs and AMRs to enhance productivity and efficiency in industrial settings. Several tests were performed where the duration of a mission, the success and collision rate, and the average number of disputes per mission were analyzed in order to obtain results. In conclusion, while AGVs tend to be more reliable and consistent in task completion, AMRs offer greater flexibility a nd speed.

Abstract

Abstract

Abstract
In the power system decarbonization roadmap, novel grid management tools and market mechanisms are fundamental to solving technical problems concerning renewable energy forecast uncertainty. This work proposes a predictive algorithm for procurement of grid flexibility by the system operator (SO), which combines the SO flexible assets with active and reactive power short-term flexibility markets. The goal is to reduce the cognitive load of the human operator when analyzing multiple flexibility options and trajectories for the forecasted load/RES and create a human-in-the-loop approach for balancing risk, stakes, and cost. This work also formulates the decision problem into several steps where the operator must decide to book flexibility now or wait for the next forecast update (time-to-decide method), considering that flexibility (availability) price may increase with a lower notification time. Numerical results obtained for a public MV grid (Oberrhein) show that the time-to-decide method improves up to 22% a performance indicator related to a cost-loss matrix, compared to the option of booking the flexibility now at a lower price and without waiting for a forecast update.

Abstract
Financial fraud is the cause of multi-billion dollar losses annually. Traditionally, fraud detection systems rely on rules due to their transparency and interpretability, key features in domains where decisions need to be explained. However, rule systems require significant input from domain experts to create and tune, an issue that rule induction algorithms attempt to mitigate by inferring rules directly from data. We explore the application of these algorithms to fraud detection, where rule systems are constrained to have a low false positive rate (FPR) or alert rate, by proposing RIFF, a rule induction algorithm that distills a low FPR rule set directly from decision trees. Our experiments show that the induced rules are often able to maintain or improve performance of the original models for low FPR tasks, while substantially reducing their complexity and outperforming rules hand-tuned by experts.

Abstract