Abstract

Abstract
High-performance sport has evolved into an arena where psychological excellence is as decisive as physical prowess. The ability to effectively regulate emotions, particularly pre-competitive anxiety/negativity (PCA), consistently distinguishes elite performance. This article presents a critical and in-depth analysis of the contemporary literature on emotional management in sport. Beginning with a deconstruction of the athlete’s complex emotional landscape, it delves into the neurocognitive mechanisms and multifactorial antecedents of these states, identifying them as a central obstacle to optimal performance. The core of the work focuses on evaluating a spectrum of evidence-based psychological interventions, ranging from physiological regulation strategies and pre-competitive routines to third-wave approaches such as Acceptance and Commitment Therapy (ACT) and mindfulness training. The analysis reveals a paradigm shift from models aimed at eliminating anxiety/negativity to approaches that promote psychological flexibility and acceptance. It is concluded that the most effective intervention resides in an integrated, periodized, and personalized model—a “toolbox” of psychological skills—adapted to the athlete’s individual needs and the phases of their training cycle. This work argues that the future of sport psychology lies in promoting the athlete’s holistic well-being as the fundamental pillar for sustainable, high-level performance.

Abstract
We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation. In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt. We further propose aBAE, an annealed variant of BAE drawing on methods from statistical inference, to enhance robustness. Our proposals are parallelizable in both quantum and classical components, offer tools for fast noise model assessment, and can leverage preexisting information. Additionally, they accommodate experimental limitations and preferred cost trade-offs. We propose a robust benchmark for amplitude estimation algorithms and use it to test BAE against other approaches, demonstrating its competitive performance in both noisy and noiseless scenarios. In both cases, it achieves lower error than any other algorithm as a function of the cost. In the presence of decoherence, it is capable of learning when other algorithms fail. © 2025 Elsevier B.V., All rights reserved.

Abstract
In an era where robots are becoming an integral part of human quotidian activities, understanding how they function is crucial. Among the inherent building complexities, from electronics to mechanics, path planning emerges as a universal aspect of robotics. The primary contribution of this work is to provide an overview of the current state of robot path planning topics and a comparison between those same algorithms and its inherent characteristics. The path planning concept relies on the process by which an algorithm determines a collision-free path between a start and an end point, optimizing parameters such as energy consumption and distance. The quest for the most effective path planning method has been a long-standing discussion, as the choice of method is highly dependent on the specific application. This review consolidates and elucidates the categories of path planning methods, specifically classical or analytical methods, and computer intelligence methods. In addition, the operational principles of these categories will be explored, discussing their respective advantages and disadvantages, and reinforcing these discussions with relevant studies in the field. This work will focus on the most prevalent and recognized methods within the robotics path planning problem, being mobile robotics or manipulator arms, including Cell Decomposition, A*, Probabilistic Roadmaps, Rapidly-exploring Random Trees, Genetic Algorithms, Particle Swarm Optimization, Ant Colony Optimization, Artificial Potential Fields, Fuzzy, and Neural Networks. Following the detailed explanation of these methods, a comparative analysis of their advantages and drawbacks is organized in a comprehensive table. This comparison will be based on various quality metrics, such as the type of trajectory provided (global or local), the scenario implementation type (real or simulated scenarios), testing environments (static or dynamic), hybrid implementation possibilities, real-time implementation, completeness of the method, consideration of the robot's kinodynamic constraints, use of smoothing techniques, and whether the implementation is online or offline.

Abstract
To achieve carbon neutrality by 2050, commercial buildings have installed photovoltaic systems to reduce carbon emissions and operational costs. Nevertheless, PV generation does not always match the building’s energy demand profile, therefore storage systems are needed to store excess energy and supply it when necessary. This paper presents a Mixed Integer Linear Programming optimisation algorithm designed to schedule the operation of the electric storage system, aiming to minimise the building’s energy-related costs. An annual hourly simulation of the optimised system was performed to assess the cost reduction. To prevent excessive operation of the electric storage system, an approach to penalise low energy charging was studied, with results showing a significant increase in the system’s lifespan.

Abstract